./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:19:49,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:19:50,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:19:50,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:19:50,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:19:50,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:19:50,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:19:50,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:19:50,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:19:50,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:19:50,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:19:50,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:19:50,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:19:50,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:19:50,045 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:19:50,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:19:50,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:19:50,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:19:50,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:19:50,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:19:50,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:19:50,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:19:50,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:19:50,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:19:50,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:19:50,051 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:19:50,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:19:50,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:19:50,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:19:50,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:19:50,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:19:50,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:19:50,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:19:50,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:19:50,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:19:50,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:19:50,053 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:19:50,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:19:50,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:19:50,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:19:50,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:19:50,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:19:50,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:19:50,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:19:50,057 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2024-10-11 21:19:50,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:19:50,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:19:50,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:19:50,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:19:50,359 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:19:50,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-10-11 21:19:51,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:19:52,002 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:19:52,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2024-10-11 21:19:52,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/116090425/ff909a91688a4ad7a780289e315d3030/FLAG60620b60d [2024-10-11 21:19:52,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/116090425/ff909a91688a4ad7a780289e315d3030 [2024-10-11 21:19:52,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:19:52,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:19:52,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:19:52,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:19:52,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:19:52,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@211a3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52, skipping insertion in model container [2024-10-11 21:19:52,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:19:52,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:19:52,636 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:19:52,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:19:52,689 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:19:52,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52 WrapperNode [2024-10-11 21:19:52,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:19:52,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:19:52,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:19:52,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:19:52,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,725 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 234 [2024-10-11 21:19:52,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:19:52,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:19:52,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:19:52,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:19:52,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,750 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:19:52,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:19:52,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:19:52,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:19:52,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:19:52,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (1/1) ... [2024-10-11 21:19:52,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:19:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:19:52,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:19:52,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:19:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:19:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 21:19:52,853 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 21:19:52,853 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 21:19:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 21:19:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 21:19:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 21:19:52,854 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 21:19:52,854 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 21:19:52,856 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 21:19:52,856 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 21:19:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 21:19:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 21:19:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:19:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 21:19:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 21:19:52,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:19:52,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:19:52,936 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:19:52,940 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:19:53,308 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 21:19:53,308 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:19:53,358 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:19:53,358 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 21:19:53,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:19:53 BoogieIcfgContainer [2024-10-11 21:19:53,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:19:53,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:19:53,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:19:53,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:19:53,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:19:52" (1/3) ... [2024-10-11 21:19:53,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50459ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:19:53, skipping insertion in model container [2024-10-11 21:19:53,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:19:52" (2/3) ... [2024-10-11 21:19:53,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50459ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:19:53, skipping insertion in model container [2024-10-11 21:19:53,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:19:53" (3/3) ... [2024-10-11 21:19:53,369 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2024-10-11 21:19:53,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:19:53,388 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 21:19:53,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:19:53,457 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7fe6061c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:19:53,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 21:19:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 88 states have internal predecessors, (133), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 21:19:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:19:53,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:53,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:53,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:53,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:53,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1327421223, now seen corresponding path program 1 times [2024-10-11 21:19:53,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:53,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772571595] [2024-10-11 21:19:53,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:53,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:53,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:53,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772571595] [2024-10-11 21:19:53,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772571595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:19:53,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604735476] [2024-10-11 21:19:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:53,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:19:53,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:53,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:19:53,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:19:53,981 INFO L87 Difference]: Start difference. First operand has 110 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 88 states have internal predecessors, (133), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:54,694 INFO L93 Difference]: Finished difference Result 351 states and 543 transitions. [2024-10-11 21:19:54,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:19:54,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 21:19:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:54,711 INFO L225 Difference]: With dead ends: 351 [2024-10-11 21:19:54,711 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 21:19:54,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:19:54,720 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 300 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:54,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 386 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:19:54,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 21:19:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 197. [2024-10-11 21:19:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 160 states have internal predecessors, (235), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2024-10-11 21:19:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2024-10-11 21:19:54,810 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 49 [2024-10-11 21:19:54,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:54,811 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2024-10-11 21:19:54,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2024-10-11 21:19:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:19:54,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:54,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:54,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:19:54,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 778090325, now seen corresponding path program 1 times [2024-10-11 21:19:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172264726] [2024-10-11 21:19:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:55,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:55,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172264726] [2024-10-11 21:19:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172264726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:19:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626721082] [2024-10-11 21:19:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:55,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:19:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:55,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:19:55,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:19:55,069 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:55,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:55,889 INFO L93 Difference]: Finished difference Result 538 states and 786 transitions. [2024-10-11 21:19:55,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:19:55,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 21:19:55,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:55,901 INFO L225 Difference]: With dead ends: 538 [2024-10-11 21:19:55,901 INFO L226 Difference]: Without dead ends: 348 [2024-10-11 21:19:55,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 21:19:55,904 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 285 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:55,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 689 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 21:19:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-11 21:19:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 285. [2024-10-11 21:19:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 226 states have (on average 1.5044247787610618) internal successors, (340), 232 states have internal predecessors, (340), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2024-10-11 21:19:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 415 transitions. [2024-10-11 21:19:56,000 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 415 transitions. Word has length 49 [2024-10-11 21:19:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 415 transitions. [2024-10-11 21:19:56,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 415 transitions. [2024-10-11 21:19:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:19:56,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:56,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:19:56,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1067276841, now seen corresponding path program 1 times [2024-10-11 21:19:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:56,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957902763] [2024-10-11 21:19:56,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:56,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:56,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957902763] [2024-10-11 21:19:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957902763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:56,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:19:56,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181693427] [2024-10-11 21:19:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:56,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:19:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:56,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:19:56,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:19:56,140 INFO L87 Difference]: Start difference. First operand 285 states and 415 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:56,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:56,860 INFO L93 Difference]: Finished difference Result 875 states and 1275 transitions. [2024-10-11 21:19:56,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:19:56,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 21:19:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:56,867 INFO L225 Difference]: With dead ends: 875 [2024-10-11 21:19:56,869 INFO L226 Difference]: Without dead ends: 597 [2024-10-11 21:19:56,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:19:56,873 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 332 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:56,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 677 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:19:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-11 21:19:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 454. [2024-10-11 21:19:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 363 states have (on average 1.4903581267217632) internal successors, (541), 371 states have internal predecessors, (541), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2024-10-11 21:19:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 660 transitions. [2024-10-11 21:19:56,937 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 660 transitions. Word has length 49 [2024-10-11 21:19:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 660 transitions. [2024-10-11 21:19:56,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 660 transitions. [2024-10-11 21:19:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:19:56,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:56,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:19:56,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:56,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2096636139, now seen corresponding path program 1 times [2024-10-11 21:19:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143421498] [2024-10-11 21:19:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:57,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143421498] [2024-10-11 21:19:57,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143421498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:57,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:57,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:19:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571815330] [2024-10-11 21:19:57,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:57,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:19:57,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:19:57,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:19:57,053 INFO L87 Difference]: Start difference. First operand 454 states and 660 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:57,782 INFO L93 Difference]: Finished difference Result 1403 states and 2042 transitions. [2024-10-11 21:19:57,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 21:19:57,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 21:19:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:57,789 INFO L225 Difference]: With dead ends: 1403 [2024-10-11 21:19:57,789 INFO L226 Difference]: Without dead ends: 956 [2024-10-11 21:19:57,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:19:57,794 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 279 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:57,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 654 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:19:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2024-10-11 21:19:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 739. [2024-10-11 21:19:57,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 590 states have (on average 1.4694915254237289) internal successors, (867), 602 states have internal predecessors, (867), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2024-10-11 21:19:57,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1072 transitions. [2024-10-11 21:19:57,902 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1072 transitions. Word has length 49 [2024-10-11 21:19:57,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:57,902 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 1072 transitions. [2024-10-11 21:19:57,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1072 transitions. [2024-10-11 21:19:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 21:19:57,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:57,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:57,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:19:57,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:57,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:57,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1437104617, now seen corresponding path program 1 times [2024-10-11 21:19:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168386196] [2024-10-11 21:19:57,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:57,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:58,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168386196] [2024-10-11 21:19:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168386196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:58,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:58,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:19:58,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222780295] [2024-10-11 21:19:58,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:58,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:19:58,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:19:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:19:58,012 INFO L87 Difference]: Start difference. First operand 739 states and 1072 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:58,606 INFO L93 Difference]: Finished difference Result 2041 states and 2967 transitions. [2024-10-11 21:19:58,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:19:58,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2024-10-11 21:19:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:58,613 INFO L225 Difference]: With dead ends: 2041 [2024-10-11 21:19:58,614 INFO L226 Difference]: Without dead ends: 1310 [2024-10-11 21:19:58,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:19:58,616 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 394 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:58,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 455 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:19:58,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-10-11 21:19:58,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1117. [2024-10-11 21:19:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 885 states have (on average 1.4418079096045198) internal successors, (1276), 906 states have internal predecessors, (1276), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-11 21:19:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1589 transitions. [2024-10-11 21:19:58,709 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1589 transitions. Word has length 49 [2024-10-11 21:19:58,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:58,710 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1589 transitions. [2024-10-11 21:19:58,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:58,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1589 transitions. [2024-10-11 21:19:58,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:19:58,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:58,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:58,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:19:58,714 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash -839140415, now seen corresponding path program 1 times [2024-10-11 21:19:58,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391072623] [2024-10-11 21:19:58,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391072623] [2024-10-11 21:19:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391072623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:58,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:19:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963262033] [2024-10-11 21:19:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:58,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:19:58,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:19:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:19:58,806 INFO L87 Difference]: Start difference. First operand 1117 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:59,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:59,187 INFO L93 Difference]: Finished difference Result 2368 states and 3413 transitions. [2024-10-11 21:19:59,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:19:59,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:19:59,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:59,195 INFO L225 Difference]: With dead ends: 2368 [2024-10-11 21:19:59,195 INFO L226 Difference]: Without dead ends: 1259 [2024-10-11 21:19:59,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:19:59,199 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:59,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 386 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:19:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2024-10-11 21:19:59,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1127. [2024-10-11 21:19:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 895 states have (on average 1.4268156424581007) internal successors, (1277), 916 states have internal predecessors, (1277), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-11 21:19:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1590 transitions. [2024-10-11 21:19:59,298 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1590 transitions. Word has length 50 [2024-10-11 21:19:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:59,299 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1590 transitions. [2024-10-11 21:19:59,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1590 transitions. [2024-10-11 21:19:59,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:19:59,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:59,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:59,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:19:59,301 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:59,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash -816508161, now seen corresponding path program 1 times [2024-10-11 21:19:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239259005] [2024-10-11 21:19:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:19:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:19:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:19:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239259005] [2024-10-11 21:19:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239259005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:19:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:19:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:19:59,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517961412] [2024-10-11 21:19:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:19:59,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:19:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:19:59,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:19:59,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:19:59,401 INFO L87 Difference]: Start difference. First operand 1127 states and 1590 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:19:59,795 INFO L93 Difference]: Finished difference Result 2416 states and 3457 transitions. [2024-10-11 21:19:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:19:59,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:19:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:19:59,805 INFO L225 Difference]: With dead ends: 2416 [2024-10-11 21:19:59,806 INFO L226 Difference]: Without dead ends: 1297 [2024-10-11 21:19:59,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:19:59,810 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 104 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:19:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 381 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:19:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-10-11 21:19:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1155. [2024-10-11 21:19:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 923 states have (on average 1.4138678223185266) internal successors, (1305), 944 states have internal predecessors, (1305), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2024-10-11 21:19:59,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1618 transitions. [2024-10-11 21:19:59,894 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1618 transitions. Word has length 50 [2024-10-11 21:19:59,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:19:59,895 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1618 transitions. [2024-10-11 21:19:59,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:19:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1618 transitions. [2024-10-11 21:19:59,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:19:59,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:19:59,896 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:19:59,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:19:59,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:19:59,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:19:59,897 INFO L85 PathProgramCache]: Analyzing trace with hash -675959551, now seen corresponding path program 1 times [2024-10-11 21:19:59,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:19:59,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433331995] [2024-10-11 21:19:59,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:19:59,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:19:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:19:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:19:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:19:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:19:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:19:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:00,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433331995] [2024-10-11 21:20:00,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433331995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:00,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:00,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:00,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053596492] [2024-10-11 21:20:00,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:00,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:00,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:00,031 INFO L87 Difference]: Start difference. First operand 1155 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:00,667 INFO L93 Difference]: Finished difference Result 1677 states and 2348 transitions. [2024-10-11 21:20:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 21:20:00,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:20:00,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:00,674 INFO L225 Difference]: With dead ends: 1677 [2024-10-11 21:20:00,674 INFO L226 Difference]: Without dead ends: 994 [2024-10-11 21:20:00,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:20:00,678 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 352 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:00,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 497 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:00,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-10-11 21:20:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 832. [2024-10-11 21:20:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 663 states have (on average 1.4027149321266967) internal successors, (930), 677 states have internal predecessors, (930), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2024-10-11 21:20:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1145 transitions. [2024-10-11 21:20:00,745 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1145 transitions. Word has length 50 [2024-10-11 21:20:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:00,747 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1145 transitions. [2024-10-11 21:20:00,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1145 transitions. [2024-10-11 21:20:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:20:00,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:00,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:00,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:20:00,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:00,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1493608001, now seen corresponding path program 1 times [2024-10-11 21:20:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:00,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124470237] [2024-10-11 21:20:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:00,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:00,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:00,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124470237] [2024-10-11 21:20:00,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124470237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:00,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205222827] [2024-10-11 21:20:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:00,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:00,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:00,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:00,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:00,880 INFO L87 Difference]: Start difference. First operand 832 states and 1145 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:01,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:01,548 INFO L93 Difference]: Finished difference Result 1622 states and 2236 transitions. [2024-10-11 21:20:01,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:01,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:20:01,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:01,554 INFO L225 Difference]: With dead ends: 1622 [2024-10-11 21:20:01,554 INFO L226 Difference]: Without dead ends: 1019 [2024-10-11 21:20:01,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-10-11 21:20:01,556 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 348 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:01,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 492 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-11 21:20:01,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 826. [2024-10-11 21:20:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 659 states have (on average 1.3975720789074355) internal successors, (921), 671 states have internal predecessors, (921), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2024-10-11 21:20:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1128 transitions. [2024-10-11 21:20:01,609 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1128 transitions. Word has length 50 [2024-10-11 21:20:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:01,609 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1128 transitions. [2024-10-11 21:20:01,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1128 transitions. [2024-10-11 21:20:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:20:01,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:01,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:01,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:20:01,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:01,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:01,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1112415553, now seen corresponding path program 1 times [2024-10-11 21:20:01,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:01,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813667621] [2024-10-11 21:20:01,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:01,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:01,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813667621] [2024-10-11 21:20:01,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813667621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:01,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:01,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 21:20:01,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287309694] [2024-10-11 21:20:01,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:01,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:20:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:01,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:20:01,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:01,718 INFO L87 Difference]: Start difference. First operand 826 states and 1128 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:02,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:02,373 INFO L93 Difference]: Finished difference Result 1563 states and 2131 transitions. [2024-10-11 21:20:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 21:20:02,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:20:02,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:02,378 INFO L225 Difference]: With dead ends: 1563 [2024-10-11 21:20:02,378 INFO L226 Difference]: Without dead ends: 880 [2024-10-11 21:20:02,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:20:02,380 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 312 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:02,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 532 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:20:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-11 21:20:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 718. [2024-10-11 21:20:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 576 states have (on average 1.3958333333333333) internal successors, (804), 586 states have internal predecessors, (804), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2024-10-11 21:20:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 976 transitions. [2024-10-11 21:20:02,427 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 976 transitions. Word has length 50 [2024-10-11 21:20:02,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 976 transitions. [2024-10-11 21:20:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 976 transitions. [2024-10-11 21:20:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 21:20:02,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:02,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:20:02,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:02,430 INFO L85 PathProgramCache]: Analyzing trace with hash -881729153, now seen corresponding path program 1 times [2024-10-11 21:20:02,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:02,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137718362] [2024-10-11 21:20:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:02,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:02,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:02,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137718362] [2024-10-11 21:20:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137718362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:02,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664250134] [2024-10-11 21:20:02,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:02,507 INFO L87 Difference]: Start difference. First operand 718 states and 976 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:02,921 INFO L93 Difference]: Finished difference Result 2230 states and 3074 transitions. [2024-10-11 21:20:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:02,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-10-11 21:20:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:02,929 INFO L225 Difference]: With dead ends: 2230 [2024-10-11 21:20:02,929 INFO L226 Difference]: Without dead ends: 1521 [2024-10-11 21:20:02,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:20:02,932 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 397 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:02,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 329 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:20:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2024-10-11 21:20:03,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1347. [2024-10-11 21:20:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1077 states have (on average 1.372330547818013) internal successors, (1478), 1094 states have internal predecessors, (1478), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2024-10-11 21:20:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1837 transitions. [2024-10-11 21:20:03,032 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1837 transitions. Word has length 50 [2024-10-11 21:20:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:03,032 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1837 transitions. [2024-10-11 21:20:03,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1837 transitions. [2024-10-11 21:20:03,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 21:20:03,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:03,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:03,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 21:20:03,033 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:03,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:03,034 INFO L85 PathProgramCache]: Analyzing trace with hash 849275354, now seen corresponding path program 1 times [2024-10-11 21:20:03,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:03,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168548352] [2024-10-11 21:20:03,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:03,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:03,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:03,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:03,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168548352] [2024-10-11 21:20:03,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168548352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:03,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:03,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:03,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961333830] [2024-10-11 21:20:03,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:03,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:03,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:03,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:03,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:03,077 INFO L87 Difference]: Start difference. First operand 1347 states and 1837 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:03,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:03,337 INFO L93 Difference]: Finished difference Result 2600 states and 3526 transitions. [2024-10-11 21:20:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:03,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2024-10-11 21:20:03,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:03,345 INFO L225 Difference]: With dead ends: 2600 [2024-10-11 21:20:03,345 INFO L226 Difference]: Without dead ends: 1262 [2024-10-11 21:20:03,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:03,348 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 261 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:03,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 213 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:20:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-10-11 21:20:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1093. [2024-10-11 21:20:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 879 states have (on average 1.3651877133105803) internal successors, (1200), 894 states have internal predecessors, (1200), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2024-10-11 21:20:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1474 transitions. [2024-10-11 21:20:03,439 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1474 transitions. Word has length 51 [2024-10-11 21:20:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:03,440 INFO L471 AbstractCegarLoop]: Abstraction has 1093 states and 1474 transitions. [2024-10-11 21:20:03,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 21:20:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1474 transitions. [2024-10-11 21:20:03,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 21:20:03,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:03,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:03,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 21:20:03,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:03,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:03,441 INFO L85 PathProgramCache]: Analyzing trace with hash -251614292, now seen corresponding path program 1 times [2024-10-11 21:20:03,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:03,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587311479] [2024-10-11 21:20:03,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:03,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:20:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587311479] [2024-10-11 21:20:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587311479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:03,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249686545] [2024-10-11 21:20:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:03,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:03,505 INFO L87 Difference]: Start difference. First operand 1093 states and 1474 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 21:20:03,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:03,921 INFO L93 Difference]: Finished difference Result 3152 states and 4268 transitions. [2024-10-11 21:20:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:20:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2024-10-11 21:20:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:03,932 INFO L225 Difference]: With dead ends: 3152 [2024-10-11 21:20:03,932 INFO L226 Difference]: Without dead ends: 2067 [2024-10-11 21:20:03,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:20:03,935 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 307 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:03,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 340 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:20:03,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2024-10-11 21:20:04,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1798. [2024-10-11 21:20:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1446 states have (on average 1.3430152143845089) internal successors, (1942), 1470 states have internal predecessors, (1942), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2024-10-11 21:20:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2391 transitions. [2024-10-11 21:20:04,071 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2391 transitions. Word has length 52 [2024-10-11 21:20:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:04,071 INFO L471 AbstractCegarLoop]: Abstraction has 1798 states and 2391 transitions. [2024-10-11 21:20:04,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 21:20:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2391 transitions. [2024-10-11 21:20:04,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:20:04,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:04,076 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:04,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 21:20:04,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:04,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1516919357, now seen corresponding path program 1 times [2024-10-11 21:20:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13467360] [2024-10-11 21:20:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:20:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:20:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13467360] [2024-10-11 21:20:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13467360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 21:20:04,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358441703] [2024-10-11 21:20:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:20:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:20:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:20:04,150 INFO L87 Difference]: Start difference. First operand 1798 states and 2391 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:05,003 INFO L93 Difference]: Finished difference Result 5727 states and 7670 transitions. [2024-10-11 21:20:05,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 21:20:05,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2024-10-11 21:20:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:05,022 INFO L225 Difference]: With dead ends: 5727 [2024-10-11 21:20:05,022 INFO L226 Difference]: Without dead ends: 3938 [2024-10-11 21:20:05,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2024-10-11 21:20:05,027 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 657 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:05,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 463 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:20:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2024-10-11 21:20:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3526. [2024-10-11 21:20:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 2824 states have (on average 1.3229461756373937) internal successors, (3736), 2885 states have internal predecessors, (3736), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586) [2024-10-11 21:20:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 4706 transitions. [2024-10-11 21:20:05,339 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 4706 transitions. Word has length 69 [2024-10-11 21:20:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:05,339 INFO L471 AbstractCegarLoop]: Abstraction has 3526 states and 4706 transitions. [2024-10-11 21:20:05,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-11 21:20:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 4706 transitions. [2024-10-11 21:20:05,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:20:05,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:05,343 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:05,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 21:20:05,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:05,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:05,344 INFO L85 PathProgramCache]: Analyzing trace with hash 234992606, now seen corresponding path program 1 times [2024-10-11 21:20:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:05,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376230418] [2024-10-11 21:20:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:05,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 21:20:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 21:20:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:20:05,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376230418] [2024-10-11 21:20:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376230418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99498097] [2024-10-11 21:20:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:05,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:05,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:05,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:05,522 INFO L87 Difference]: Start difference. First operand 3526 states and 4706 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:20:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:06,274 INFO L93 Difference]: Finished difference Result 6812 states and 9045 transitions. [2024-10-11 21:20:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 21:20:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2024-10-11 21:20:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:06,293 INFO L225 Difference]: With dead ends: 6812 [2024-10-11 21:20:06,294 INFO L226 Difference]: Without dead ends: 4004 [2024-10-11 21:20:06,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:20:06,301 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 380 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:06,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 404 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:20:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2024-10-11 21:20:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 3502. [2024-10-11 21:20:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3502 states, 2796 states have (on average 1.311874105865522) internal successors, (3668), 2861 states have internal predecessors, (3668), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2024-10-11 21:20:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4583 transitions. [2024-10-11 21:20:06,610 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4583 transitions. Word has length 81 [2024-10-11 21:20:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:06,611 INFO L471 AbstractCegarLoop]: Abstraction has 3502 states and 4583 transitions. [2024-10-11 21:20:06,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:20:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4583 transitions. [2024-10-11 21:20:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-11 21:20:06,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:06,613 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:06,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 21:20:06,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1969097056, now seen corresponding path program 1 times [2024-10-11 21:20:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:06,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391226869] [2024-10-11 21:20:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:06,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 21:20:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 21:20:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:20:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:06,675 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 21:20:06,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:06,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391226869] [2024-10-11 21:20:06,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391226869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:06,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:06,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:20:06,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177655229] [2024-10-11 21:20:06,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:06,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:06,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:06,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:06,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:06,678 INFO L87 Difference]: Start difference. First operand 3502 states and 4583 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:20:07,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:07,050 INFO L93 Difference]: Finished difference Result 3878 states and 5082 transitions. [2024-10-11 21:20:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:07,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 81 [2024-10-11 21:20:07,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:07,065 INFO L225 Difference]: With dead ends: 3878 [2024-10-11 21:20:07,066 INFO L226 Difference]: Without dead ends: 3194 [2024-10-11 21:20:07,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:07,068 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 259 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:07,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 208 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:20:07,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2024-10-11 21:20:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2820. [2024-10-11 21:20:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2255 states have (on average 1.317960088691796) internal successors, (2972), 2310 states have internal predecessors, (2972), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2024-10-11 21:20:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3706 transitions. [2024-10-11 21:20:07,316 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3706 transitions. Word has length 81 [2024-10-11 21:20:07,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:07,316 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3706 transitions. [2024-10-11 21:20:07,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:20:07,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3706 transitions. [2024-10-11 21:20:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 21:20:07,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:07,317 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:07,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 21:20:07,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:07,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:07,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1355169990, now seen corresponding path program 1 times [2024-10-11 21:20:07,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:07,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634835428] [2024-10-11 21:20:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 21:20:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 21:20:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 21:20:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:07,405 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 21:20:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:07,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634835428] [2024-10-11 21:20:07,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634835428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:07,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:07,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 21:20:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34034985] [2024-10-11 21:20:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:07,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:20:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:20:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:20:07,408 INFO L87 Difference]: Start difference. First operand 2820 states and 3706 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:20:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:08,355 INFO L93 Difference]: Finished difference Result 4971 states and 6606 transitions. [2024-10-11 21:20:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 21:20:08,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2024-10-11 21:20:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:08,370 INFO L225 Difference]: With dead ends: 4971 [2024-10-11 21:20:08,370 INFO L226 Difference]: Without dead ends: 3130 [2024-10-11 21:20:08,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-10-11 21:20:08,376 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 981 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:08,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 523 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 21:20:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-11 21:20:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2820. [2024-10-11 21:20:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2255 states have (on average 1.3082039911308203) internal successors, (2950), 2310 states have internal predecessors, (2950), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-10-11 21:20:08,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3651 transitions. [2024-10-11 21:20:08,656 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3651 transitions. Word has length 83 [2024-10-11 21:20:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 2820 states and 3651 transitions. [2024-10-11 21:20:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-11 21:20:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3651 transitions. [2024-10-11 21:20:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 21:20:08,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:08,660 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:08,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 21:20:08,661 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:08,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:08,661 INFO L85 PathProgramCache]: Analyzing trace with hash 11317420, now seen corresponding path program 1 times [2024-10-11 21:20:08,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:08,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020297360] [2024-10-11 21:20:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:08,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:20:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 21:20:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 21:20:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:20:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:20:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:20:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 21:20:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 21:20:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:20:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 21:20:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:20:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020297360] [2024-10-11 21:20:08,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020297360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:20:08,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:20:08,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:20:08,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638044680] [2024-10-11 21:20:08,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:20:08,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:20:08,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:20:08,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:20:08,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:20:08,739 INFO L87 Difference]: Start difference. First operand 2820 states and 3651 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:20:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:20:09,173 INFO L93 Difference]: Finished difference Result 3194 states and 4150 transitions. [2024-10-11 21:20:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:20:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 89 [2024-10-11 21:20:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:20:09,188 INFO L225 Difference]: With dead ends: 3194 [2024-10-11 21:20:09,189 INFO L226 Difference]: Without dead ends: 3193 [2024-10-11 21:20:09,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:20:09,191 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 251 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:20:09,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 196 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:20:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2024-10-11 21:20:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2819. [2024-10-11 21:20:09,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2255 states have (on average 1.3042128603104213) internal successors, (2941), 2309 states have internal predecessors, (2941), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2024-10-11 21:20:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3642 transitions. [2024-10-11 21:20:09,454 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3642 transitions. Word has length 89 [2024-10-11 21:20:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:20:09,454 INFO L471 AbstractCegarLoop]: Abstraction has 2819 states and 3642 transitions. [2024-10-11 21:20:09,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 21:20:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3642 transitions. [2024-10-11 21:20:09,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 21:20:09,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:20:09,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:09,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 21:20:09,456 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-11 21:20:09,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:20:09,457 INFO L85 PathProgramCache]: Analyzing trace with hash 350840331, now seen corresponding path program 1 times [2024-10-11 21:20:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:20:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947603086] [2024-10-11 21:20:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:20:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:20:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 21:20:09,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 21:20:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 21:20:09,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 21:20:09,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 21:20:09,504 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 21:20:09,506 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 21:20:09,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 21:20:09,507 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 21:20:09,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 21:20:09,510 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:20:09,588 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:20:09,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:20:09 BoogieIcfgContainer [2024-10-11 21:20:09,594 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:20:09,595 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:20:09,595 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:20:09,595 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:20:09,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:19:53" (3/4) ... [2024-10-11 21:20:09,597 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 21:20:09,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:20:09,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:20:09,686 INFO L158 Benchmark]: Toolchain (without parser) took 17318.21ms. Allocated memory was 169.9MB in the beginning and 658.5MB in the end (delta: 488.6MB). Free memory was 91.1MB in the beginning and 546.4MB in the end (delta: -455.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,686 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:20:09,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.34ms. Allocated memory is still 169.9MB. Free memory was 90.9MB in the beginning and 138.7MB in the end (delta: -47.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.56ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 136.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,687 INFO L158 Benchmark]: Boogie Preprocessor took 36.86ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 134.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,687 INFO L158 Benchmark]: RCFGBuilder took 592.87ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 123.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,687 INFO L158 Benchmark]: TraceAbstraction took 16232.93ms. Allocated memory was 169.9MB in the beginning and 658.5MB in the end (delta: 488.6MB). Free memory was 123.3MB in the beginning and 554.8MB in the end (delta: -431.5MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,688 INFO L158 Benchmark]: Witness Printer took 91.20ms. Allocated memory is still 658.5MB. Free memory was 553.7MB in the beginning and 546.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 21:20:09,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 169.9MB. Free memory is still 136.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.34ms. Allocated memory is still 169.9MB. Free memory was 90.9MB in the beginning and 138.7MB in the end (delta: -47.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.56ms. Allocated memory is still 169.9MB. Free memory was 138.7MB in the beginning and 136.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.86ms. Allocated memory is still 169.9MB. Free memory was 136.7MB in the beginning and 134.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 592.87ms. Allocated memory is still 169.9MB. Free memory was 134.6MB in the beginning and 123.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16232.93ms. Allocated memory was 169.9MB in the beginning and 658.5MB in the end (delta: 488.6MB). Free memory was 123.3MB in the beginning and 554.8MB in the end (delta: -431.5MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB. * Witness Printer took 91.20ms. Allocated memory is still 658.5MB. Free memory was 553.7MB in the beginning and 546.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 119]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 1 [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L434] RET init_threads() [L435] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L281] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L286] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L436] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L309] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L437] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 [L443] kernel_st = 1 [L444] CALL eval() [L218] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] return (__retres1); [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L252] RET transmit1() [L222] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L197] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L213] return (__retres1); [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L238] CALL master() [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L55] COND TRUE 1 [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L353] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L148] return (__retres1); [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] CALL, EXPR is_transmit1_triggered() [L152] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L167] return (__retres1); [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L353] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=2147483647] [L238] RET master() [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L103] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L119] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 110 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.1s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6482 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6299 mSDsluCounter, 7825 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5696 mSDsCounter, 1230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7953 IncrementalHoareTripleChecker+Invalid, 9183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1230 mSolverCounterUnsat, 2129 mSDtfsCounter, 7953 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3526occurred in iteration=14, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1141 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 2332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 108/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 21:20:09,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)