./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd --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 c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:45:13,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:45:13,367 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-13 12:45:13,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:45:13,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:45:13,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:45:13,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:45:13,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:45:13,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:45:13,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:45:13,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:45:13,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:45:13,406 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:45:13,406 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:45:13,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:45:13,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:45:13,407 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:45:13,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:45:13,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:45:13,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:45:13,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:45:13,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:45:13,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:45:13,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:13,411 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:45:13,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:45:13,412 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd 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 -> c2172e48d59a79636c380f4fc82a3f737aa7d3f80daa2bd10bb2cc27a12a3e78 [2024-11-13 12:45:13,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:45:13,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:45:13,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:45:13,737 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:45:13,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:45:13,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c Unable to find full path for "g++" [2024-11-13 12:45:15,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:45:16,020 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:45:16,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2024-11-13 12:45:16,045 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/data/3d4b539f2/933ef5af2b044560911de6420dc70f6f/FLAGe27f8ffb2 [2024-11-13 12:45:16,069 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/data/3d4b539f2/933ef5af2b044560911de6420dc70f6f [2024-11-13 12:45:16,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:45:16,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:45:16,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:16,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:45:16,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:45:16,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4d8d4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16, skipping insertion in model container [2024-11-13 12:45:16,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:45:16,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:16,496 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:45:16,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:45:16,653 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:45:16,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16 WrapperNode [2024-11-13 12:45:16,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:45:16,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:16,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:45:16,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:45:16,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,733 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 847 [2024-11-13 12:45:16,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:45:16,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:45:16,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:45:16,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:45:16,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,770 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-11-13 12:45:16,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:45:16,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:45:16,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:45:16,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:45:16,801 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (1/1) ... [2024-11-13 12:45:16,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:45:16,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:16,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:45:16,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-13 12:45:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-13 12:45:16,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:45:16,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:45:16,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:45:16,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:45:18,065 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2024-11-13 12:45:18,066 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:45:18,097 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:45:18,102 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-13 12:45:18,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:18 BoogieIcfgContainer [2024-11-13 12:45:18,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:45:18,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:45:18,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:45:18,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:45:18,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:45:16" (1/3) ... [2024-11-13 12:45:18,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762762f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:18, skipping insertion in model container [2024-11-13 12:45:18,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:45:16" (2/3) ... [2024-11-13 12:45:18,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762762f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:45:18, skipping insertion in model container [2024-11-13 12:45:18,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:18" (3/3) ... [2024-11-13 12:45:18,114 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2024-11-13 12:45:18,130 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:45:18,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mem_slave_tlm.1.cil.c that has 2 procedures, 286 locations, 1 initial locations, 13 loop locations, and 8 error locations. [2024-11-13 12:45:18,222 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:45:18,237 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;@12057a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:45:18,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-13 12:45:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 271 states have (on average 1.8523985239852399) internal successors, (502), 284 states have internal predecessors, (502), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-13 12:45:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-13 12:45:18,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:18,257 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] [2024-11-13 12:45:18,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:18,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:18,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2129145192, now seen corresponding path program 1 times [2024-11-13 12:45:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:18,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416838953] [2024-11-13 12:45:18,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:18,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416838953] [2024-11-13 12:45:18,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416838953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:18,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:18,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:18,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979783773] [2024-11-13 12:45:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:18,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:18,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:18,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:18,550 INFO L87 Difference]: Start difference. First operand has 286 states, 271 states have (on average 1.8523985239852399) internal successors, (502), 284 states have internal predecessors, (502), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:19,113 INFO L93 Difference]: Finished difference Result 755 states and 1348 transitions. [2024-11-13 12:45:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:19,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-13 12:45:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:19,126 INFO L225 Difference]: With dead ends: 755 [2024-11-13 12:45:19,126 INFO L226 Difference]: Without dead ends: 454 [2024-11-13 12:45:19,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:19,132 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 269 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:19,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 793 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:45:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-13 12:45:19,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2024-11-13 12:45:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 432 states have (on average 1.5856481481481481) internal successors, (685), 439 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 685 transitions. [2024-11-13 12:45:19,197 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 685 transitions. Word has length 20 [2024-11-13 12:45:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:19,197 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 685 transitions. [2024-11-13 12:45:19,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 685 transitions. [2024-11-13 12:45:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 12:45:19,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:19,201 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] [2024-11-13 12:45:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:45:19,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:19,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 638186121, now seen corresponding path program 1 times [2024-11-13 12:45:19,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331700882] [2024-11-13 12:45:19,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:19,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331700882] [2024-11-13 12:45:19,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331700882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:19,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:19,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:45:19,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681284875] [2024-11-13 12:45:19,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:19,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:19,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:19,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:19,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:19,386 INFO L87 Difference]: Start difference. First operand 440 states and 685 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:19,510 INFO L93 Difference]: Finished difference Result 1116 states and 1750 transitions. [2024-11-13 12:45:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:19,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-13 12:45:19,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:19,514 INFO L225 Difference]: With dead ends: 1116 [2024-11-13 12:45:19,514 INFO L226 Difference]: Without dead ends: 690 [2024-11-13 12:45:19,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:19,517 INFO L432 NwaCegarLoop]: 646 mSDtfsCounter, 238 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:19,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1058 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-13 12:45:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 682. [2024-11-13 12:45:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 674 states have (on average 1.5771513353115727) internal successors, (1063), 681 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1063 transitions. [2024-11-13 12:45:19,575 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1063 transitions. Word has length 24 [2024-11-13 12:45:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:19,576 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1063 transitions. [2024-11-13 12:45:19,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1063 transitions. [2024-11-13 12:45:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-13 12:45:19,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:19,579 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 12:45:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:45:19,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:19,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash -776386451, now seen corresponding path program 1 times [2024-11-13 12:45:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571159699] [2024-11-13 12:45:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:19,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571159699] [2024-11-13 12:45:19,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571159699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:19,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:19,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:19,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396437537] [2024-11-13 12:45:19,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:19,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:19,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:19,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:19,737 INFO L87 Difference]: Start difference. First operand 682 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:20,212 INFO L93 Difference]: Finished difference Result 1632 states and 2556 transitions. [2024-11-13 12:45:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:20,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-13 12:45:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:20,217 INFO L225 Difference]: With dead ends: 1632 [2024-11-13 12:45:20,217 INFO L226 Difference]: Without dead ends: 964 [2024-11-13 12:45:20,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:20,219 INFO L432 NwaCegarLoop]: 649 mSDtfsCounter, 616 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:20,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1491 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2024-11-13 12:45:20,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 848. [2024-11-13 12:45:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 840 states have (on average 1.5833333333333333) internal successors, (1330), 847 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1330 transitions. [2024-11-13 12:45:20,263 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1330 transitions. Word has length 55 [2024-11-13 12:45:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:20,264 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1330 transitions. [2024-11-13 12:45:20,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1330 transitions. [2024-11-13 12:45:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-13 12:45:20,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:20,271 INFO L215 NwaCegarLoop]: trace histogram [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-11-13 12:45:20,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:45:20,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:20,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:20,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1529940943, now seen corresponding path program 1 times [2024-11-13 12:45:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606028921] [2024-11-13 12:45:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:20,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606028921] [2024-11-13 12:45:20,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606028921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:20,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869098841] [2024-11-13 12:45:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:20,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:20,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:20,445 INFO L87 Difference]: Start difference. First operand 848 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:20,846 INFO L93 Difference]: Finished difference Result 2112 states and 3294 transitions. [2024-11-13 12:45:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-13 12:45:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:20,853 INFO L225 Difference]: With dead ends: 2112 [2024-11-13 12:45:20,853 INFO L226 Difference]: Without dead ends: 1278 [2024-11-13 12:45:20,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:20,857 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 427 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:20,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1535 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-11-13 12:45:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2024-11-13 12:45:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1183 states have (on average 1.5672020287404902) internal successors, (1854), 1190 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1854 transitions. [2024-11-13 12:45:20,907 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1854 transitions. Word has length 58 [2024-11-13 12:45:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:20,907 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1854 transitions. [2024-11-13 12:45:20,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1854 transitions. [2024-11-13 12:45:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 12:45:20,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:20,910 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:20,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:45:20,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:20,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:20,911 INFO L85 PathProgramCache]: Analyzing trace with hash 932849540, now seen corresponding path program 1 times [2024-11-13 12:45:20,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:20,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035995570] [2024-11-13 12:45:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:21,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:21,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:21,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035995570] [2024-11-13 12:45:21,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035995570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:21,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:21,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208669831] [2024-11-13 12:45:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:21,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:21,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:21,039 INFO L87 Difference]: Start difference. First operand 1191 states and 1854 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:21,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:21,576 INFO L93 Difference]: Finished difference Result 3750 states and 5723 transitions. [2024-11-13 12:45:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:21,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-13 12:45:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:21,587 INFO L225 Difference]: With dead ends: 3750 [2024-11-13 12:45:21,587 INFO L226 Difference]: Without dead ends: 2570 [2024-11-13 12:45:21,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:21,589 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 685 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:21,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1074 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2024-11-13 12:45:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2224. [2024-11-13 12:45:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2216 states have (on average 1.5374548736462095) internal successors, (3407), 2223 states have internal predecessors, (3407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3407 transitions. [2024-11-13 12:45:21,684 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3407 transitions. Word has length 69 [2024-11-13 12:45:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:21,685 INFO L471 AbstractCegarLoop]: Abstraction has 2224 states and 3407 transitions. [2024-11-13 12:45:21,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3407 transitions. [2024-11-13 12:45:21,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-13 12:45:21,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:21,687 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:45:21,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:45:21,688 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1688790436, now seen corresponding path program 1 times [2024-11-13 12:45:21,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:21,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601752661] [2024-11-13 12:45:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:21,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:21,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:21,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601752661] [2024-11-13 12:45:21,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601752661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:21,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168064442] [2024-11-13 12:45:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:21,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:21,788 INFO L87 Difference]: Start difference. First operand 2224 states and 3407 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:21,901 INFO L93 Difference]: Finished difference Result 4678 states and 7256 transitions. [2024-11-13 12:45:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:21,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-13 12:45:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:21,916 INFO L225 Difference]: With dead ends: 4678 [2024-11-13 12:45:21,916 INFO L226 Difference]: Without dead ends: 2467 [2024-11-13 12:45:21,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:21,920 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 362 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:21,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 694 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2024-11-13 12:45:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2260. [2024-11-13 12:45:22,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2260 states, 2252 states have (on average 1.5697158081705151) internal successors, (3535), 2259 states have internal predecessors, (3535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:22,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3535 transitions. [2024-11-13 12:45:22,025 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3535 transitions. Word has length 69 [2024-11-13 12:45:22,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:22,025 INFO L471 AbstractCegarLoop]: Abstraction has 2260 states and 3535 transitions. [2024-11-13 12:45:22,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:22,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3535 transitions. [2024-11-13 12:45:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-13 12:45:22,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:22,029 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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-11-13 12:45:22,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:45:22,029 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -37267398, now seen corresponding path program 1 times [2024-11-13 12:45:22,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:22,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564641939] [2024-11-13 12:45:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:22,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564641939] [2024-11-13 12:45:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564641939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016775565] [2024-11-13 12:45:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:22,163 INFO L87 Difference]: Start difference. First operand 2260 states and 3535 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:22,367 INFO L93 Difference]: Finished difference Result 4815 states and 7522 transitions. [2024-11-13 12:45:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:22,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-11-13 12:45:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:22,380 INFO L225 Difference]: With dead ends: 4815 [2024-11-13 12:45:22,380 INFO L226 Difference]: Without dead ends: 2567 [2024-11-13 12:45:22,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:22,385 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 193 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 823 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:22,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2024-11-13 12:45:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2024-11-13 12:45:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2553 states, 2545 states have (on average 1.5618860510805501) internal successors, (3975), 2552 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3975 transitions. [2024-11-13 12:45:22,515 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3975 transitions. Word has length 87 [2024-11-13 12:45:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:22,515 INFO L471 AbstractCegarLoop]: Abstraction has 2553 states and 3975 transitions. [2024-11-13 12:45:22,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3975 transitions. [2024-11-13 12:45:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-13 12:45:22,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:22,519 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:45:22,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1215158240, now seen corresponding path program 1 times [2024-11-13 12:45:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365242306] [2024-11-13 12:45:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365242306] [2024-11-13 12:45:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365242306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142067692] [2024-11-13 12:45:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:22,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:22,628 INFO L87 Difference]: Start difference. First operand 2553 states and 3975 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:23,047 INFO L93 Difference]: Finished difference Result 5993 states and 9430 transitions. [2024-11-13 12:45:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-13 12:45:23,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:23,062 INFO L225 Difference]: With dead ends: 5993 [2024-11-13 12:45:23,062 INFO L226 Difference]: Without dead ends: 3616 [2024-11-13 12:45:23,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,066 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 248 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:23,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 868 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:45:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2024-11-13 12:45:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2983. [2024-11-13 12:45:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2975 states have (on average 1.4857142857142858) internal successors, (4420), 2982 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4420 transitions. [2024-11-13 12:45:23,210 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4420 transitions. Word has length 96 [2024-11-13 12:45:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:23,211 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4420 transitions. [2024-11-13 12:45:23,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4420 transitions. [2024-11-13 12:45:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 12:45:23,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:23,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 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-11-13 12:45:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:45:23,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 679327311, now seen corresponding path program 1 times [2024-11-13 12:45:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30876052] [2024-11-13 12:45:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-13 12:45:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30876052] [2024-11-13 12:45:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30876052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314713844] [2024-11-13 12:45:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,292 INFO L87 Difference]: Start difference. First operand 2983 states and 4420 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:23,557 INFO L93 Difference]: Finished difference Result 7791 states and 11616 transitions. [2024-11-13 12:45:23,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:23,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-13 12:45:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:23,575 INFO L225 Difference]: With dead ends: 7791 [2024-11-13 12:45:23,575 INFO L226 Difference]: Without dead ends: 4820 [2024-11-13 12:45:23,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,580 INFO L432 NwaCegarLoop]: 635 mSDtfsCounter, 314 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:23,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1003 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2024-11-13 12:45:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4226. [2024-11-13 12:45:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4226 states, 4218 states have (on average 1.4902797534376482) internal successors, (6286), 4225 states have internal predecessors, (6286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4226 states to 4226 states and 6286 transitions. [2024-11-13 12:45:23,792 INFO L78 Accepts]: Start accepts. Automaton has 4226 states and 6286 transitions. Word has length 104 [2024-11-13 12:45:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 4226 states and 6286 transitions. [2024-11-13 12:45:23,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 4226 states and 6286 transitions. [2024-11-13 12:45:23,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-13 12:45:23,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:23,796 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:23,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:45:23,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1620720296, now seen corresponding path program 1 times [2024-11-13 12:45:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35294548] [2024-11-13 12:45:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:23,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:23,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35294548] [2024-11-13 12:45:23,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35294548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432670356] [2024-11-13 12:45:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:23,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:23,917 INFO L87 Difference]: Start difference. First operand 4226 states and 6286 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:24,120 INFO L93 Difference]: Finished difference Result 8109 states and 12116 transitions. [2024-11-13 12:45:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:24,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-13 12:45:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:24,136 INFO L225 Difference]: With dead ends: 8109 [2024-11-13 12:45:24,136 INFO L226 Difference]: Without dead ends: 4157 [2024-11-13 12:45:24,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:24,141 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 336 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:24,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 436 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:24,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2024-11-13 12:45:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 4157. [2024-11-13 12:45:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4157 states, 4149 states have (on average 1.460351892022174) internal successors, (6059), 4156 states have internal predecessors, (6059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 6059 transitions. [2024-11-13 12:45:24,337 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 6059 transitions. Word has length 104 [2024-11-13 12:45:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 4157 states and 6059 transitions. [2024-11-13 12:45:24,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 6059 transitions. [2024-11-13 12:45:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-13 12:45:24,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:24,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 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-11-13 12:45:24,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 12:45:24,340 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:24,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 75648003, now seen corresponding path program 1 times [2024-11-13 12:45:24,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:24,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119293147] [2024-11-13 12:45:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:45:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119293147] [2024-11-13 12:45:24,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119293147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:24,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385885192] [2024-11-13 12:45:24,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:24,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:24,439 INFO L87 Difference]: Start difference. First operand 4157 states and 6059 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:25,043 INFO L93 Difference]: Finished difference Result 11327 states and 16390 transitions. [2024-11-13 12:45:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-13 12:45:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:25,069 INFO L225 Difference]: With dead ends: 11327 [2024-11-13 12:45:25,069 INFO L226 Difference]: Without dead ends: 7075 [2024-11-13 12:45:25,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:25,074 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 651 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:25,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1259 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:45:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2024-11-13 12:45:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 6310. [2024-11-13 12:45:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6310 states, 6302 states have (on average 1.4393843224373215) internal successors, (9071), 6309 states have internal predecessors, (9071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6310 states to 6310 states and 9071 transitions. [2024-11-13 12:45:25,371 INFO L78 Accepts]: Start accepts. Automaton has 6310 states and 9071 transitions. Word has length 107 [2024-11-13 12:45:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:25,372 INFO L471 AbstractCegarLoop]: Abstraction has 6310 states and 9071 transitions. [2024-11-13 12:45:25,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 6310 states and 9071 transitions. [2024-11-13 12:45:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-13 12:45:25,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:25,375 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:25,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 12:45:25,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash 565438577, now seen corresponding path program 1 times [2024-11-13 12:45:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632495792] [2024-11-13 12:45:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:25,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632495792] [2024-11-13 12:45:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632495792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527373792] [2024-11-13 12:45:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:25,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:25,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:25,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:25,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:25,481 INFO L87 Difference]: Start difference. First operand 6310 states and 9071 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:25,842 INFO L93 Difference]: Finished difference Result 12377 states and 17820 transitions. [2024-11-13 12:45:25,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:25,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2024-11-13 12:45:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:25,863 INFO L225 Difference]: With dead ends: 12377 [2024-11-13 12:45:25,864 INFO L226 Difference]: Without dead ends: 6151 [2024-11-13 12:45:25,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:25,873 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 334 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:25,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 840 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6151 states. [2024-11-13 12:45:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6151 to 6113. [2024-11-13 12:45:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6113 states, 6105 states have (on average 1.3991809991809991) internal successors, (8542), 6112 states have internal predecessors, (8542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6113 states to 6113 states and 8542 transitions. [2024-11-13 12:45:26,223 INFO L78 Accepts]: Start accepts. Automaton has 6113 states and 8542 transitions. Word has length 111 [2024-11-13 12:45:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 6113 states and 8542 transitions. [2024-11-13 12:45:26,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6113 states and 8542 transitions. [2024-11-13 12:45:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-13 12:45:26,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:26,226 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:26,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 12:45:26,226 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:26,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:26,227 INFO L85 PathProgramCache]: Analyzing trace with hash 975121341, now seen corresponding path program 1 times [2024-11-13 12:45:26,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:26,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836248115] [2024-11-13 12:45:26,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:26,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836248115] [2024-11-13 12:45:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836248115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084208011] [2024-11-13 12:45:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:26,341 INFO L87 Difference]: Start difference. First operand 6113 states and 8542 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:26,775 INFO L93 Difference]: Finished difference Result 16659 states and 23262 transitions. [2024-11-13 12:45:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:45:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-11-13 12:45:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:26,807 INFO L225 Difference]: With dead ends: 16659 [2024-11-13 12:45:26,808 INFO L226 Difference]: Without dead ends: 10689 [2024-11-13 12:45:26,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:26,816 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 627 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:26,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2632 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:26,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2024-11-13 12:45:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 9350. [2024-11-13 12:45:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9350 states, 9342 states have (on average 1.4051594947548705) internal successors, (13127), 9349 states have internal predecessors, (13127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9350 states to 9350 states and 13127 transitions. [2024-11-13 12:45:27,223 INFO L78 Accepts]: Start accepts. Automaton has 9350 states and 13127 transitions. Word has length 113 [2024-11-13 12:45:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:27,223 INFO L471 AbstractCegarLoop]: Abstraction has 9350 states and 13127 transitions. [2024-11-13 12:45:27,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 9350 states and 13127 transitions. [2024-11-13 12:45:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-13 12:45:27,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:27,226 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:27,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:45:27,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -681291816, now seen corresponding path program 1 times [2024-11-13 12:45:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:27,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433480129] [2024-11-13 12:45:27,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:27,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:45:27,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433480129] [2024-11-13 12:45:27,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433480129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:27,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226499013] [2024-11-13 12:45:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:27,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:27,362 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:27,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:45:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:27,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:45:27,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:45:27,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226499013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:27,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-13 12:45:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292474204] [2024-11-13 12:45:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:27,687 INFO L87 Difference]: Start difference. First operand 9350 states and 13127 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:27,992 INFO L93 Difference]: Finished difference Result 17526 states and 24641 transitions. [2024-11-13 12:45:27,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-11-13 12:45:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:28,018 INFO L225 Difference]: With dead ends: 17526 [2024-11-13 12:45:28,018 INFO L226 Difference]: Without dead ends: 8184 [2024-11-13 12:45:28,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:28,029 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 293 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:28,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 465 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8184 states. [2024-11-13 12:45:28,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8184 to 7641. [2024-11-13 12:45:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7641 states, 7633 states have (on average 1.3961745054369186) internal successors, (10657), 7640 states have internal predecessors, (10657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7641 states to 7641 states and 10657 transitions. [2024-11-13 12:45:28,439 INFO L78 Accepts]: Start accepts. Automaton has 7641 states and 10657 transitions. Word has length 115 [2024-11-13 12:45:28,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:28,439 INFO L471 AbstractCegarLoop]: Abstraction has 7641 states and 10657 transitions. [2024-11-13 12:45:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 7641 states and 10657 transitions. [2024-11-13 12:45:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-13 12:45:28,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:28,443 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:28,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:45:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 12:45:28,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:28,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:28,650 INFO L85 PathProgramCache]: Analyzing trace with hash -913828229, now seen corresponding path program 1 times [2024-11-13 12:45:28,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:28,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335450890] [2024-11-13 12:45:28,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:28,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:45:28,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:28,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335450890] [2024-11-13 12:45:28,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335450890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:28,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:28,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:28,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531232269] [2024-11-13 12:45:28,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:28,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:28,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:45:28,835 INFO L87 Difference]: Start difference. First operand 7641 states and 10657 transitions. Second operand has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:29,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:29,474 INFO L93 Difference]: Finished difference Result 15880 states and 22122 transitions. [2024-11-13 12:45:29,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:29,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2024-11-13 12:45:29,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:29,515 INFO L225 Difference]: With dead ends: 15880 [2024-11-13 12:45:29,515 INFO L226 Difference]: Without dead ends: 15876 [2024-11-13 12:45:29,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:29,521 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 728 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:29,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1298 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:29,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15876 states. [2024-11-13 12:45:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15876 to 13829. [2024-11-13 12:45:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 13821 states have (on average 1.4090152666232545) internal successors, (19474), 13828 states have internal predecessors, (19474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:29,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 19474 transitions. [2024-11-13 12:45:29,997 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 19474 transitions. Word has length 117 [2024-11-13 12:45:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:29,999 INFO L471 AbstractCegarLoop]: Abstraction has 13829 states and 19474 transitions. [2024-11-13 12:45:29,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.0) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 19474 transitions. [2024-11-13 12:45:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 12:45:30,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:30,002 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:45:30,002 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1769362244, now seen corresponding path program 1 times [2024-11-13 12:45:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409134210] [2024-11-13 12:45:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:45:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409134210] [2024-11-13 12:45:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409134210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:30,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290545260] [2024-11-13 12:45:30,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:30,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:30,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:30,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:30,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:45:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:30,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:45:30,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-13 12:45:30,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:30,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290545260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:30,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:30,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-13 12:45:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910813026] [2024-11-13 12:45:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:30,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:45:30,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:30,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:45:30,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:30,395 INFO L87 Difference]: Start difference. First operand 13829 states and 19474 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:30,892 INFO L93 Difference]: Finished difference Result 14210 states and 19978 transitions. [2024-11-13 12:45:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:45:30,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2024-11-13 12:45:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:30,930 INFO L225 Difference]: With dead ends: 14210 [2024-11-13 12:45:30,930 INFO L226 Difference]: Without dead ends: 14209 [2024-11-13 12:45:30,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:30,937 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 151 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:30,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1257 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:30,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14209 states. [2024-11-13 12:45:31,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14209 to 13828. [2024-11-13 12:45:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13828 states, 13821 states have (on average 1.407495839664279) internal successors, (19453), 13827 states have internal predecessors, (19453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13828 states to 13828 states and 19453 transitions. [2024-11-13 12:45:31,451 INFO L78 Accepts]: Start accepts. Automaton has 13828 states and 19453 transitions. Word has length 122 [2024-11-13 12:45:31,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:31,452 INFO L471 AbstractCegarLoop]: Abstraction has 13828 states and 19453 transitions. [2024-11-13 12:45:31,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13828 states and 19453 transitions. [2024-11-13 12:45:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-13 12:45:31,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:31,454 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:31,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 12:45:31,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 12:45:31,655 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:31,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:31,655 INFO L85 PathProgramCache]: Analyzing trace with hash -984345052, now seen corresponding path program 1 times [2024-11-13 12:45:31,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:31,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311995471] [2024-11-13 12:45:31,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:31,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:45:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311995471] [2024-11-13 12:45:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311995471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:31,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328342671] [2024-11-13 12:45:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:31,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:31,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:31,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:45:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:31,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 12:45:31,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:45:32,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:32,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328342671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-13 12:45:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509536965] [2024-11-13 12:45:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:32,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:32,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:32,004 INFO L87 Difference]: Start difference. First operand 13828 states and 19453 transitions. Second operand has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:32,426 INFO L93 Difference]: Finished difference Result 14209 states and 19957 transitions. [2024-11-13 12:45:32,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:32,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123 [2024-11-13 12:45:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:32,452 INFO L225 Difference]: With dead ends: 14209 [2024-11-13 12:45:32,453 INFO L226 Difference]: Without dead ends: 14208 [2024-11-13 12:45:32,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:45:32,455 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 151 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:32,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 885 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 12:45:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14208 states. [2024-11-13 12:45:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14208 to 13827. [2024-11-13 12:45:33,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13827 states, 13821 states have (on average 1.4059764127053036) internal successors, (19432), 13826 states have internal predecessors, (19432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13827 states to 13827 states and 19432 transitions. [2024-11-13 12:45:33,117 INFO L78 Accepts]: Start accepts. Automaton has 13827 states and 19432 transitions. Word has length 123 [2024-11-13 12:45:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:33,118 INFO L471 AbstractCegarLoop]: Abstraction has 13827 states and 19432 transitions. [2024-11-13 12:45:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 13827 states and 19432 transitions. [2024-11-13 12:45:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 12:45:33,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:33,129 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:33,150 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:45:33,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 12:45:33,330 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:33,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1826014199, now seen corresponding path program 1 times [2024-11-13 12:45:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:33,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474538493] [2024-11-13 12:45:33,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:33,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:45:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:33,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474538493] [2024-11-13 12:45:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474538493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243253240] [2024-11-13 12:45:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:33,522 INFO L87 Difference]: Start difference. First operand 13827 states and 19432 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:33,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:33,966 INFO L93 Difference]: Finished difference Result 17742 states and 24766 transitions. [2024-11-13 12:45:33,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:33,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-11-13 12:45:33,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:33,982 INFO L225 Difference]: With dead ends: 17742 [2024-11-13 12:45:33,982 INFO L226 Difference]: Without dead ends: 3798 [2024-11-13 12:45:33,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:33,995 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:33,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 488 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:45:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2024-11-13 12:45:34,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 2827. [2024-11-13 12:45:34,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2821 states have (on average 1.151719248493442) internal successors, (3249), 2826 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3249 transitions. [2024-11-13 12:45:34,145 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3249 transitions. Word has length 205 [2024-11-13 12:45:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:34,147 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 3249 transitions. [2024-11-13 12:45:34,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3249 transitions. [2024-11-13 12:45:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-13 12:45:34,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:34,153 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-13 12:45:34,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 12:45:34,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:34,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:34,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1556840292, now seen corresponding path program 1 times [2024-11-13 12:45:34,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:34,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557958691] [2024-11-13 12:45:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:34,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-13 12:45:34,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:34,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557958691] [2024-11-13 12:45:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557958691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994156680] [2024-11-13 12:45:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:34,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:34,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:34,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:34,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:34,251 INFO L87 Difference]: Start difference. First operand 2827 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:34,299 INFO L93 Difference]: Finished difference Result 3558 states and 4034 transitions. [2024-11-13 12:45:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:34,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-11-13 12:45:34,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:34,305 INFO L225 Difference]: With dead ends: 3558 [2024-11-13 12:45:34,305 INFO L226 Difference]: Without dead ends: 937 [2024-11-13 12:45:34,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:34,308 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 164 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:34,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 301 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-13 12:45:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 927. [2024-11-13 12:45:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 921 states have (on average 1.0738327904451683) internal successors, (989), 926 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 989 transitions. [2024-11-13 12:45:34,344 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 989 transitions. Word has length 216 [2024-11-13 12:45:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:34,345 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 989 transitions. [2024-11-13 12:45:34,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 989 transitions. [2024-11-13 12:45:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-13 12:45:34,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:34,349 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-13 12:45:34,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 12:45:34,349 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1711489722, now seen corresponding path program 1 times [2024-11-13 12:45:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741938315] [2024-11-13 12:45:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:45:34,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:34,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741938315] [2024-11-13 12:45:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741938315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:45:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743470713] [2024-11-13 12:45:34,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:34,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:34,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:45:34,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:45:34,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:45:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:34,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:45:34,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:45:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-13 12:45:34,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:45:34,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743470713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:34,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:45:34,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-13 12:45:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973704110] [2024-11-13 12:45:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:34,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:34,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:34,939 INFO L87 Difference]: Start difference. First operand 927 states and 989 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,026 INFO L93 Difference]: Finished difference Result 1127 states and 1203 transitions. [2024-11-13 12:45:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:45:35,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-13 12:45:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,030 INFO L225 Difference]: With dead ends: 1127 [2024-11-13 12:45:35,030 INFO L226 Difference]: Without dead ends: 549 [2024-11-13 12:45:35,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:45:35,031 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 232 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 519 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:35,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-11-13 12:45:35,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2024-11-13 12:45:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 547 states have (on average 1.0694698354661791) internal successors, (585), 548 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 585 transitions. [2024-11-13 12:45:35,052 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 585 transitions. Word has length 220 [2024-11-13 12:45:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 585 transitions. [2024-11-13 12:45:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 585 transitions. [2024-11-13 12:45:35,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-13 12:45:35,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:35,056 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:35,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:45:35,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:45:35,257 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:35,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:35,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1431011372, now seen corresponding path program 1 times [2024-11-13 12:45:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:35,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367554282] [2024-11-13 12:45:35,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:35,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:45:35,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:35,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367554282] [2024-11-13 12:45:35,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367554282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:35,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:35,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:45:35,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233573875] [2024-11-13 12:45:35,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:35,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:35,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:35,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:35,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:35,393 INFO L87 Difference]: Start difference. First operand 549 states and 585 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,469 INFO L93 Difference]: Finished difference Result 651 states and 690 transitions. [2024-11-13 12:45:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-13 12:45:35,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,473 INFO L225 Difference]: With dead ends: 651 [2024-11-13 12:45:35,473 INFO L226 Difference]: Without dead ends: 546 [2024-11-13 12:45:35,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:45:35,474 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 158 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 801 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-13 12:45:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 543. [2024-11-13 12:45:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 541 states have (on average 1.0628465804066543) internal successors, (575), 542 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 575 transitions. [2024-11-13 12:45:35,498 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 575 transitions. Word has length 225 [2024-11-13 12:45:35,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 575 transitions. [2024-11-13 12:45:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 575 transitions. [2024-11-13 12:45:35,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 12:45:35,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:35,502 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:35,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:45:35,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:35,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 554073117, now seen corresponding path program 1 times [2024-11-13 12:45:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540467732] [2024-11-13 12:45:35,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-13 12:45:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540467732] [2024-11-13 12:45:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540467732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:45:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923416140] [2024-11-13 12:45:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:45:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:45:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:35,579 INFO L87 Difference]: Start difference. First operand 543 states and 575 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,615 INFO L93 Difference]: Finished difference Result 755 states and 795 transitions. [2024-11-13 12:45:35,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:45:35,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-13 12:45:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,619 INFO L225 Difference]: With dead ends: 755 [2024-11-13 12:45:35,619 INFO L226 Difference]: Without dead ends: 478 [2024-11-13 12:45:35,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:45:35,622 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 7 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 394 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-13 12:45:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 391. [2024-11-13 12:45:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 389 states have (on average 1.0668380462724936) internal successors, (415), 390 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 415 transitions. [2024-11-13 12:45:35,641 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 415 transitions. Word has length 227 [2024-11-13 12:45:35,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,641 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 415 transitions. [2024-11-13 12:45:35,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 415 transitions. [2024-11-13 12:45:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-13 12:45:35,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:45:35,644 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 12:45:35,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 12:45:35,645 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-13 12:45:35,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:45:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1035153375, now seen corresponding path program 1 times [2024-11-13 12:45:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:45:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743718156] [2024-11-13 12:45:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:45:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:45:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:45:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-13 12:45:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:45:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743718156] [2024-11-13 12:45:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743718156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:45:35,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:45:35,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:45:35,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012919] [2024-11-13 12:45:35,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:45:35,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:45:35,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:45:35,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:45:35,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:45:35,835 INFO L87 Difference]: Start difference. First operand 391 states and 415 transitions. Second operand has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:45:35,913 INFO L93 Difference]: Finished difference Result 400 states and 424 transitions. [2024-11-13 12:45:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:45:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-13 12:45:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:45:35,917 INFO L225 Difference]: With dead ends: 400 [2024-11-13 12:45:35,917 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 12:45:35,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:45:35,918 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 202 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:45:35,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 505 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:45:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 12:45:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 12:45:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 12:45:35,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2024-11-13 12:45:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:45:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:45:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 54.25) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:45:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 12:45:35,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 12:45:35,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-13 12:45:35,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-13 12:45:35,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-13 12:45:35,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-13 12:45:35,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-13 12:45:35,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-13 12:45:35,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-13 12:45:35,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-13 12:45:35,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:45:35,930 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, 1, 1, 1, 1] [2024-11-13 12:45:35,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 12:45:41,663 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:45:41,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:45:41 BoogieIcfgContainer [2024-11-13 12:45:41,730 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:45:41,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:45:41,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:45:41,731 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:45:41,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:45:18" (3/4) ... [2024-11-13 12:45:41,734 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 12:45:41,740 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-13 12:45:41,754 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-13 12:45:41,755 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-13 12:45:41,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 12:45:41,757 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 12:45:41,915 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:45:41,915 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 12:45:41,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:45:41,916 INFO L158 Benchmark]: Toolchain (without parser) took 25841.34ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 91.9MB in the beginning and 409.9MB in the end (delta: -318.0MB). Peak memory consumption was 714.3MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,917 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 75.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:41,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.24ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 72.3MB in the end (delta: 19.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,918 INFO L158 Benchmark]: Boogie Preprocessor took 63.94ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:45:41,918 INFO L158 Benchmark]: RCFGBuilder took 1303.07ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 67.1MB in the end (delta: -1.9MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,918 INFO L158 Benchmark]: TraceAbstraction took 23625.09ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 66.5MB in the beginning and 426.5MB in the end (delta: -360.1MB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,918 INFO L158 Benchmark]: Witness Printer took 185.23ms. Allocated memory is still 1.1GB. Free memory was 426.5MB in the beginning and 409.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:45:41,920 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.24ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 75.1MB in the end (delta: 196.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.24ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 72.3MB in the end (delta: 19.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 117.4MB. Free memory was 72.0MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.94ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 65.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1303.07ms. Allocated memory is still 117.4MB. Free memory was 65.2MB in the beginning and 67.1MB in the end (delta: -1.9MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23625.09ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 1.0GB). Free memory was 66.5MB in the beginning and 426.5MB in the end (delta: -360.1MB). Peak memory consumption was 730.2MB. Max. memory is 16.1GB. * Witness Printer took 185.23ms. Allocated memory is still 1.1GB. Free memory was 426.5MB in the beginning and 409.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 143]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 479]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 829]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 836]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 286 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 17.7s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7549 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7549 mSDsluCounter, 21419 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10969 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2250 IncrementalHoareTripleChecker+Invalid, 2680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 10450 mSDtfsCounter, 2250 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 686 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13829occurred in iteration=15, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 8584 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3394 NumberOfCodeBlocks, 3394 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3367 ConstructedInterpolants, 0 QuantifiedInterpolants, 5918 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 27 InterpolantComputations, 23 PerfectInterpolantSequences, 815/831 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 485]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) || (((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 1255]: Loop Invariant Derived loop invariant: (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0)) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((s_run_st != 0) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((s_run_st != 0) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) || (((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0))) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st != 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) && (req_tt_a == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req != 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) - InvariantResult [Line: 876]: Location Invariant Derived location invariant: (((((req_tt_a == 0) && ((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || (((((((((((c_req_type == 0) && (2 != s_run_pc)) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) - InvariantResult [Line: 1001]: Loop Invariant Derived loop invariant: ((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: ((((((((((((req_type___0 == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) - InvariantResult [Line: 1119]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6))) || (((((s_run_st != 0) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (m_run_pc == 0))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (s_run_pc == 0)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. Ensures: (0 && (((((((((((((((((((((((((((((((((((((((((m_run_st == \old(m_run_st)) && (m_run_i == \old(m_run_i))) && (m_run_pc == \old(m_run_pc))) && (s_memory0 == \old(s_memory0))) && (s_run_st == \old(s_run_st))) && (s_run_i == \old(s_run_i))) && (s_run_pc == \old(s_run_pc))) && (c_m_lock == \old(c_m_lock))) && (c_m_ev == \old(c_m_ev))) && (c_req_type == \old(c_req_type))) && (c_req_a == \old(c_req_a))) && (c_req_d == \old(c_req_d))) && (c_rsp_type == \old(c_rsp_type))) && (c_rsp_status == \old(c_rsp_status))) && (c_rsp_d == \old(c_rsp_d))) && (c_empty_req == \old(c_empty_req))) && (c_empty_rsp == \old(c_empty_rsp))) && (c_read_req_ev == \old(c_read_req_ev))) && (c_write_req_ev == \old(c_write_req_ev))) && (c_read_rsp_ev == \old(c_read_rsp_ev))) && (c_write_rsp_ev == \old(c_write_rsp_ev))) && (d_t == \old(d_t))) && (a_t == \old(a_t))) && (req_t_type == \old(req_t_type))) && (req_t_a == \old(req_t_a))) && (req_t_d == \old(req_t_d))) && (rsp_t_type == \old(rsp_t_type))) && (rsp_t_status == \old(rsp_t_status))) && (rsp_t_d == \old(rsp_t_d))) && (req_tt_type == \old(req_tt_type))) && (req_tt_a == \old(req_tt_a))) && (req_tt_d == \old(req_tt_d))) && (rsp_tt_type == \old(rsp_tt_type))) && (rsp_tt_status == \old(rsp_tt_status))) && (rsp_tt_d == \old(rsp_tt_d))) && (req_t_type___0 == \old(req_t_type___0))) && (req_t_a___0 == \old(req_t_a___0))) && (req_t_d___0 == \old(req_t_d___0))) && (rsp_t_type___0 == \old(rsp_t_type___0))) && (rsp_t_status___0 == \old(rsp_t_status___0))) && (rsp_t_d___0 == \old(rsp_t_d___0)))) RESULT: Ultimate proved your program to be correct! [2024-11-13 12:45:41,956 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0fc26e6-b5ea-421c-8870-050b83b31b30/bin/uautomizer-verify-qhAvR1uOyd/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 Result: TRUE