./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 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/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_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu --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.2.3-dev-9bd2c7f [2023-11-19 07:36:56,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:36:56,716 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-19 07:36:56,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:36:56,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:36:56,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:36:56,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:36:56,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:36:56,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:36:56,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:36:56,784 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:36:56,785 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:36:56,786 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:36:56,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:36:56,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:36:56,789 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:36:56,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:36:56,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:36:56,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:36:56,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:36:56,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:36:56,792 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:36:56,793 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:36:56,793 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:36:56,794 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:36:56,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:36:56,795 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:36:56,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:36:56,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:36:56,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:36:56,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:36:56,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:36:56,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:36:56,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:36:56,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:36:56,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:36:56,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:36:56,800 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:36:56,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:36:56,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:36:56,801 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:36:56,801 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu 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 [2023-11-19 07:36:57,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:36:57,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:36:57,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:36:57,149 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:36:57,150 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:36:57,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-19 07:37:00,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:37:00,759 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:37:00,759 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/sv-benchmarks/c/systemc/mem_slave_tlm.1.cil.c [2023-11-19 07:37:00,777 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/data/25b6a6862/1152ae7a00734890a646add3ca656ec3/FLAG3edcb721f [2023-11-19 07:37:00,792 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/data/25b6a6862/1152ae7a00734890a646add3ca656ec3 [2023-11-19 07:37:00,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:37:00,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:37:00,797 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:00,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:37:00,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:37:00,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:00" (1/1) ... [2023-11-19 07:37:00,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6823f972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:00, skipping insertion in model container [2023-11-19 07:37:00,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:00" (1/1) ... [2023-11-19 07:37:00,882 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:37:01,135 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:01,159 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:37:01,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:01,276 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:37:01,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01 WrapperNode [2023-11-19 07:37:01,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:01,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:01,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:37:01,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:37:01,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,368 INFO L138 Inliner]: procedures = 19, calls = 19, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 860 [2023-11-19 07:37:01,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:01,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:37:01,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:37:01,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:37:01,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:37:01,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:37:01,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:37:01,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:37:01,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (1/1) ... [2023-11-19 07:37:01,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:01,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:01,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:37:01,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:37:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:37:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:37:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-19 07:37:01,519 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-19 07:37:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:37:01,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:37:01,623 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:37:01,626 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:37:02,608 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:37:02,636 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:37:02,638 INFO L302 CfgBuilder]: Removed 13 assume(true) statements. [2023-11-19 07:37:02,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:02 BoogieIcfgContainer [2023-11-19 07:37:02,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:37:02,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:37:02,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:37:02,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:37:02,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:00" (1/3) ... [2023-11-19 07:37:02,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da44ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:02, skipping insertion in model container [2023-11-19 07:37:02,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:01" (2/3) ... [2023-11-19 07:37:02,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40da44ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:02, skipping insertion in model container [2023-11-19 07:37:02,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:02" (3/3) ... [2023-11-19 07:37:02,668 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.1.cil.c [2023-11-19 07:37:02,693 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:37:02,694 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-19 07:37:02,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:37:02,784 INFO L357 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, mHoare=true, 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;@ca43045, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:37:02,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-19 07:37:02,790 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) [2023-11-19 07:37:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:37:02,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:02,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:37:02,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:02,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:02,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1773166344, now seen corresponding path program 1 times [2023-11-19 07:37:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:02,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093229321] [2023-11-19 07:37:02,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:02,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:03,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:03,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093229321] [2023-11-19 07:37:03,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093229321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:03,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:03,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190755958] [2023-11-19 07:37:03,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:03,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:03,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:03,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:03,186 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) [2023-11-19 07:37:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:03,708 INFO L93 Difference]: Finished difference Result 755 states and 1348 transitions. [2023-11-19 07:37:03,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:03,711 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 [2023-11-19 07:37:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:03,726 INFO L225 Difference]: With dead ends: 755 [2023-11-19 07:37:03,727 INFO L226 Difference]: Without dead ends: 454 [2023-11-19 07:37:03,732 INFO L412 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 [2023-11-19 07:37:03,736 INFO L413 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.4s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:03,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 793 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:37:03,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-11-19 07:37:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2023-11-19 07:37:03,839 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) [2023-11-19 07:37:03,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 685 transitions. [2023-11-19 07:37:03,845 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 685 transitions. Word has length 20 [2023-11-19 07:37:03,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:03,846 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 685 transitions. [2023-11-19 07:37:03,847 INFO L496 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) [2023-11-19 07:37:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 685 transitions. [2023-11-19 07:37:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 07:37:03,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:03,849 INFO L195 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] [2023-11-19 07:37:03,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:37:03,851 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:03,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash 282207273, now seen corresponding path program 1 times [2023-11-19 07:37:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365519931] [2023-11-19 07:37:03,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:03,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:03,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:03,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365519931] [2023-11-19 07:37:03,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365519931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:03,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:03,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:37:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232605372] [2023-11-19 07:37:03,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:03,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:03,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:03,989 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) [2023-11-19 07:37:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:04,093 INFO L93 Difference]: Finished difference Result 1117 states and 1751 transitions. [2023-11-19 07:37:04,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:04,094 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 [2023-11-19 07:37:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:04,100 INFO L225 Difference]: With dead ends: 1117 [2023-11-19 07:37:04,100 INFO L226 Difference]: Without dead ends: 691 [2023-11-19 07:37:04,109 INFO L412 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 [2023-11-19 07:37:04,111 INFO L413 NwaCegarLoop]: 646 mSDtfsCounter, 244 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:04,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1058 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2023-11-19 07:37:04,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 682. [2023-11-19 07:37:04,156 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) [2023-11-19 07:37:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1063 transitions. [2023-11-19 07:37:04,161 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1063 transitions. Word has length 24 [2023-11-19 07:37:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:04,161 INFO L495 AbstractCegarLoop]: Abstraction has 682 states and 1063 transitions. [2023-11-19 07:37:04,161 INFO L496 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) [2023-11-19 07:37:04,162 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1063 transitions. [2023-11-19 07:37:04,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:37:04,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:04,166 INFO L195 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] [2023-11-19 07:37:04,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:37:04,167 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:04,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1461842607, now seen corresponding path program 1 times [2023-11-19 07:37:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615991972] [2023-11-19 07:37:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:04,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:04,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:04,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615991972] [2023-11-19 07:37:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615991972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:04,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:04,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070070764] [2023-11-19 07:37:04,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:04,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:04,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:04,372 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) [2023-11-19 07:37:04,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:04,809 INFO L93 Difference]: Finished difference Result 1632 states and 2556 transitions. [2023-11-19 07:37:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:04,811 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 [2023-11-19 07:37:04,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:04,820 INFO L225 Difference]: With dead ends: 1632 [2023-11-19 07:37:04,820 INFO L226 Difference]: Without dead ends: 964 [2023-11-19 07:37:04,822 INFO L412 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 [2023-11-19 07:37:04,828 INFO L413 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.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:04,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1491 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:37:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-11-19 07:37:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 848. [2023-11-19 07:37:04,885 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) [2023-11-19 07:37:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1330 transitions. [2023-11-19 07:37:04,895 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1330 transitions. Word has length 55 [2023-11-19 07:37:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:04,896 INFO L495 AbstractCegarLoop]: Abstraction has 848 states and 1330 transitions. [2023-11-19 07:37:04,897 INFO L496 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) [2023-11-19 07:37:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1330 transitions. [2023-11-19 07:37:04,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-19 07:37:04,927 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:04,927 INFO L195 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] [2023-11-19 07:37:04,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:37:04,928 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:04,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 264726864, now seen corresponding path program 1 times [2023-11-19 07:37:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:04,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886946527] [2023-11-19 07:37:04,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886946527] [2023-11-19 07:37:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886946527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999741439] [2023-11-19 07:37:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:05,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:05,140 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) [2023-11-19 07:37:05,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:05,534 INFO L93 Difference]: Finished difference Result 2112 states and 3294 transitions. [2023-11-19 07:37:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:05,535 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 [2023-11-19 07:37:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:05,546 INFO L225 Difference]: With dead ends: 2112 [2023-11-19 07:37:05,547 INFO L226 Difference]: Without dead ends: 1278 [2023-11-19 07:37:05,549 INFO L412 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 [2023-11-19 07:37:05,556 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 427 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2023-11-19 07:37:05,557 INFO L414 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] [2023-11-19 07:37:05,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2023-11-19 07:37:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1191. [2023-11-19 07:37:05,622 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) [2023-11-19 07:37:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1854 transitions. [2023-11-19 07:37:05,631 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1854 transitions. Word has length 58 [2023-11-19 07:37:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:05,632 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 1854 transitions. [2023-11-19 07:37:05,632 INFO L496 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) [2023-11-19 07:37:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1854 transitions. [2023-11-19 07:37:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-19 07:37:05,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:05,635 INFO L195 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] [2023-11-19 07:37:05,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:05,636 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:05,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 93056873, now seen corresponding path program 1 times [2023-11-19 07:37:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702189677] [2023-11-19 07:37:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:05,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702189677] [2023-11-19 07:37:05,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702189677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:05,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:05,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:05,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431800090] [2023-11-19 07:37:05,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:05,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:05,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:05,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:05,820 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) [2023-11-19 07:37:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:06,385 INFO L93 Difference]: Finished difference Result 3750 states and 5723 transitions. [2023-11-19 07:37:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:06,386 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 [2023-11-19 07:37:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:06,402 INFO L225 Difference]: With dead ends: 3750 [2023-11-19 07:37:06,403 INFO L226 Difference]: Without dead ends: 2570 [2023-11-19 07:37:06,405 INFO L412 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 [2023-11-19 07:37:06,406 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 685 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1079 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 [2023-11-19 07:37:06,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1079 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-19 07:37:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2023-11-19 07:37:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2224. [2023-11-19 07:37:06,510 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) [2023-11-19 07:37:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3407 transitions. [2023-11-19 07:37:06,525 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3407 transitions. Word has length 69 [2023-11-19 07:37:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:06,526 INFO L495 AbstractCegarLoop]: Abstraction has 2224 states and 3407 transitions. [2023-11-19 07:37:06,526 INFO L496 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) [2023-11-19 07:37:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3407 transitions. [2023-11-19 07:37:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-19 07:37:06,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:06,531 INFO L195 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] [2023-11-19 07:37:06,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:37:06,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:06,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:06,533 INFO L85 PathProgramCache]: Analyzing trace with hash 848997769, now seen corresponding path program 1 times [2023-11-19 07:37:06,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:06,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204437277] [2023-11-19 07:37:06,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:06,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:06,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:06,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204437277] [2023-11-19 07:37:06,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204437277] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:06,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:06,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922878962] [2023-11-19 07:37:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:06,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:06,638 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) [2023-11-19 07:37:06,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:06,772 INFO L93 Difference]: Finished difference Result 4678 states and 7256 transitions. [2023-11-19 07:37:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:06,773 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 [2023-11-19 07:37:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:06,791 INFO L225 Difference]: With dead ends: 4678 [2023-11-19 07:37:06,791 INFO L226 Difference]: Without dead ends: 2467 [2023-11-19 07:37:06,795 INFO L412 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 [2023-11-19 07:37:06,796 INFO L413 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 [2023-11-19 07:37:06,796 INFO L414 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] [2023-11-19 07:37:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2023-11-19 07:37:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2260. [2023-11-19 07:37:06,955 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) [2023-11-19 07:37:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2260 states to 2260 states and 3535 transitions. [2023-11-19 07:37:06,970 INFO L78 Accepts]: Start accepts. Automaton has 2260 states and 3535 transitions. Word has length 69 [2023-11-19 07:37:06,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:06,970 INFO L495 AbstractCegarLoop]: Abstraction has 2260 states and 3535 transitions. [2023-11-19 07:37:06,970 INFO L496 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) [2023-11-19 07:37:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2260 states and 3535 transitions. [2023-11-19 07:37:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-19 07:37:06,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:06,974 INFO L195 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] [2023-11-19 07:37:06,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:37:06,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:06,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1060133084, now seen corresponding path program 1 times [2023-11-19 07:37:06,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:06,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52735837] [2023-11-19 07:37:06,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:06,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52735837] [2023-11-19 07:37:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52735837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:07,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:07,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:07,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665817563] [2023-11-19 07:37:07,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:07,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:07,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:07,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:07,052 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) [2023-11-19 07:37:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:07,240 INFO L93 Difference]: Finished difference Result 4815 states and 7522 transitions. [2023-11-19 07:37:07,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:07,241 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 [2023-11-19 07:37:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:07,257 INFO L225 Difference]: With dead ends: 4815 [2023-11-19 07:37:07,257 INFO L226 Difference]: Without dead ends: 2567 [2023-11-19 07:37:07,261 INFO L412 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 [2023-11-19 07:37:07,262 INFO L413 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 [2023-11-19 07:37:07,262 INFO L414 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] [2023-11-19 07:37:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2023-11-19 07:37:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2553. [2023-11-19 07:37:07,383 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) [2023-11-19 07:37:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3975 transitions. [2023-11-19 07:37:07,398 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3975 transitions. Word has length 87 [2023-11-19 07:37:07,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:07,399 INFO L495 AbstractCegarLoop]: Abstraction has 2553 states and 3975 transitions. [2023-11-19 07:37:07,399 INFO L496 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) [2023-11-19 07:37:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3975 transitions. [2023-11-19 07:37:07,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-19 07:37:07,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:07,403 INFO L195 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] [2023-11-19 07:37:07,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:37:07,404 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:07,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash 809233504, now seen corresponding path program 1 times [2023-11-19 07:37:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:07,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897350514] [2023-11-19 07:37:07,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:07,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:07,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:07,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:07,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897350514] [2023-11-19 07:37:07,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897350514] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:07,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251650163] [2023-11-19 07:37:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:07,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:07,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:07,526 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) [2023-11-19 07:37:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:07,980 INFO L93 Difference]: Finished difference Result 5993 states and 9430 transitions. [2023-11-19 07:37:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:07,981 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 [2023-11-19 07:37:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:08,004 INFO L225 Difference]: With dead ends: 5993 [2023-11-19 07:37:08,005 INFO L226 Difference]: Without dead ends: 3616 [2023-11-19 07:37:08,010 INFO L412 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 [2023-11-19 07:37:08,012 INFO L413 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 [2023-11-19 07:37:08,012 INFO L414 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] [2023-11-19 07:37:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2023-11-19 07:37:08,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 2983. [2023-11-19 07:37:08,151 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) [2023-11-19 07:37:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4420 transitions. [2023-11-19 07:37:08,165 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4420 transitions. Word has length 96 [2023-11-19 07:37:08,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:08,166 INFO L495 AbstractCegarLoop]: Abstraction has 2983 states and 4420 transitions. [2023-11-19 07:37:08,167 INFO L496 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) [2023-11-19 07:37:08,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4420 transitions. [2023-11-19 07:37:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-19 07:37:08,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:08,172 INFO L195 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] [2023-11-19 07:37:08,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:37:08,173 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:08,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1044800824, now seen corresponding path program 1 times [2023-11-19 07:37:08,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:08,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342592274] [2023-11-19 07:37:08,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:08,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:37:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342592274] [2023-11-19 07:37:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342592274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506003664] [2023-11-19 07:37:08,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:08,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:08,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:08,294 INFO L87 Difference]: Start difference. First operand 2983 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2023-11-19 07:37:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:08,705 INFO L93 Difference]: Finished difference Result 5993 states and 8876 transitions. [2023-11-19 07:37:08,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:08,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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 [2023-11-19 07:37:08,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:08,727 INFO L225 Difference]: With dead ends: 5993 [2023-11-19 07:37:08,727 INFO L226 Difference]: Without dead ends: 3227 [2023-11-19 07:37:08,732 INFO L412 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 [2023-11-19 07:37:08,735 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 615 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:08,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1279 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:37:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2023-11-19 07:37:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3152. [2023-11-19 07:37:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4802798982188294) internal successors, (4654), 3151 states have internal predecessors, (4654), 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) [2023-11-19 07:37:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4654 transitions. [2023-11-19 07:37:08,909 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4654 transitions. Word has length 104 [2023-11-19 07:37:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:08,909 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4654 transitions. [2023-11-19 07:37:08,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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) [2023-11-19 07:37:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4654 transitions. [2023-11-19 07:37:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-19 07:37:08,914 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:08,914 INFO L195 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] [2023-11-19 07:37:08,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:37:08,915 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:08,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:08,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2134366008, now seen corresponding path program 1 times [2023-11-19 07:37:08,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:08,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372267004] [2023-11-19 07:37:08,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372267004] [2023-11-19 07:37:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372267004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:09,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:09,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:09,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816953082] [2023-11-19 07:37:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:09,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:09,024 INFO L87 Difference]: Start difference. First operand 3152 states and 4654 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) [2023-11-19 07:37:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:09,227 INFO L93 Difference]: Finished difference Result 6118 states and 9062 transitions. [2023-11-19 07:37:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:09,228 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 [2023-11-19 07:37:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:09,246 INFO L225 Difference]: With dead ends: 6118 [2023-11-19 07:37:09,246 INFO L226 Difference]: Without dead ends: 3152 [2023-11-19 07:37:09,250 INFO L412 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 [2023-11-19 07:37:09,251 INFO L413 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 [2023-11-19 07:37:09,252 INFO L414 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] [2023-11-19 07:37:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3152 states. [2023-11-19 07:37:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3152 to 3152. [2023-11-19 07:37:09,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3152 states, 3144 states have (on average 1.4481552162849873) internal successors, (4553), 3151 states have internal predecessors, (4553), 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) [2023-11-19 07:37:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3152 states to 3152 states and 4553 transitions. [2023-11-19 07:37:09,407 INFO L78 Accepts]: Start accepts. Automaton has 3152 states and 4553 transitions. Word has length 104 [2023-11-19 07:37:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:09,407 INFO L495 AbstractCegarLoop]: Abstraction has 3152 states and 4553 transitions. [2023-11-19 07:37:09,408 INFO L496 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) [2023-11-19 07:37:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 3152 states and 4553 transitions. [2023-11-19 07:37:09,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-19 07:37:09,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:09,411 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-11-19 07:37:09,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:37:09,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:09,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1174128625, now seen corresponding path program 1 times [2023-11-19 07:37:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726800719] [2023-11-19 07:37:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:09,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 07:37:09,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:09,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726800719] [2023-11-19 07:37:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726800719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:09,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:09,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:09,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304808966] [2023-11-19 07:37:09,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:09,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:09,461 INFO L87 Difference]: Start difference. First operand 3152 states and 4553 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2023-11-19 07:37:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:09,684 INFO L93 Difference]: Finished difference Result 8079 states and 11760 transitions. [2023-11-19 07:37:09,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:09,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 105 [2023-11-19 07:37:09,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:09,712 INFO L225 Difference]: With dead ends: 8079 [2023-11-19 07:37:09,713 INFO L226 Difference]: Without dead ends: 4939 [2023-11-19 07:37:09,718 INFO L412 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 [2023-11-19 07:37:09,719 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 314 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:09,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1021 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2023-11-19 07:37:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4449. [2023-11-19 07:37:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 4441 states have (on average 1.4550776852060348) internal successors, (6462), 4448 states have internal predecessors, (6462), 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) [2023-11-19 07:37:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 6462 transitions. [2023-11-19 07:37:09,972 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 6462 transitions. Word has length 105 [2023-11-19 07:37:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:09,973 INFO L495 AbstractCegarLoop]: Abstraction has 4449 states and 6462 transitions. [2023-11-19 07:37:09,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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) [2023-11-19 07:37:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 6462 transitions. [2023-11-19 07:37:09,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-19 07:37:09,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:09,977 INFO L195 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] [2023-11-19 07:37:09,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:37:09,977 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:09,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash -352874665, now seen corresponding path program 1 times [2023-11-19 07:37:09,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:09,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671698571] [2023-11-19 07:37:09,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:09,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-19 07:37:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:10,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671698571] [2023-11-19 07:37:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671698571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:10,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124972842] [2023-11-19 07:37:10,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:10,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:10,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:10,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:10,056 INFO L87 Difference]: Start difference. First operand 4449 states and 6462 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) [2023-11-19 07:37:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:10,620 INFO L93 Difference]: Finished difference Result 11981 states and 17278 transitions. [2023-11-19 07:37:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:10,621 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 [2023-11-19 07:37:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:10,639 INFO L225 Difference]: With dead ends: 11981 [2023-11-19 07:37:10,639 INFO L226 Difference]: Without dead ends: 7435 [2023-11-19 07:37:10,646 INFO L412 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 [2023-11-19 07:37:10,647 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 651 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:10,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1329 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 07:37:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2023-11-19 07:37:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6646. [2023-11-19 07:37:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 6638 states have (on average 1.4344682133172642) internal successors, (9522), 6645 states have internal predecessors, (9522), 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) [2023-11-19 07:37:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 9522 transitions. [2023-11-19 07:37:10,985 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 9522 transitions. Word has length 107 [2023-11-19 07:37:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:10,985 INFO L495 AbstractCegarLoop]: Abstraction has 6646 states and 9522 transitions. [2023-11-19 07:37:10,986 INFO L496 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) [2023-11-19 07:37:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 9522 transitions. [2023-11-19 07:37:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-11-19 07:37:10,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:10,992 INFO L195 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] [2023-11-19 07:37:10,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:37:10,993 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:10,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1728043503, now seen corresponding path program 1 times [2023-11-19 07:37:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837721007] [2023-11-19 07:37:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:11,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:11,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837721007] [2023-11-19 07:37:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837721007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:11,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703213882] [2023-11-19 07:37:11,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:11,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:11,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:11,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:11,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:11,106 INFO L87 Difference]: Start difference. First operand 6646 states and 9522 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) [2023-11-19 07:37:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:11,657 INFO L93 Difference]: Finished difference Result 17842 states and 25502 transitions. [2023-11-19 07:37:11,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:37:11,658 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 [2023-11-19 07:37:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:11,684 INFO L225 Difference]: With dead ends: 17842 [2023-11-19 07:37:11,685 INFO L226 Difference]: Without dead ends: 11530 [2023-11-19 07:37:11,695 INFO L412 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 [2023-11-19 07:37:11,696 INFO L413 NwaCegarLoop]: 654 mSDtfsCounter, 643 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:11,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 2263 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:11,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11530 states. [2023-11-19 07:37:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11530 to 10146. [2023-11-19 07:37:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10146 states, 10138 states have (on average 1.4378575655947918) internal successors, (14577), 10145 states have internal predecessors, (14577), 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) [2023-11-19 07:37:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10146 states to 10146 states and 14577 transitions. [2023-11-19 07:37:12,190 INFO L78 Accepts]: Start accepts. Automaton has 10146 states and 14577 transitions. Word has length 113 [2023-11-19 07:37:12,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:12,190 INFO L495 AbstractCegarLoop]: Abstraction has 10146 states and 14577 transitions. [2023-11-19 07:37:12,191 INFO L496 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) [2023-11-19 07:37:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 10146 states and 14577 transitions. [2023-11-19 07:37:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:37:12,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:12,195 INFO L195 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] [2023-11-19 07:37:12,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:37:12,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:12,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1864219126, now seen corresponding path program 1 times [2023-11-19 07:37:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:12,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606451011] [2023-11-19 07:37:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:37:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:12,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606451011] [2023-11-19 07:37:12,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606451011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:12,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:12,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862964095] [2023-11-19 07:37:12,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:12,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:12,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:12,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:12,260 INFO L87 Difference]: Start difference. First operand 10146 states and 14577 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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) [2023-11-19 07:37:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:12,855 INFO L93 Difference]: Finished difference Result 20067 states and 28850 transitions. [2023-11-19 07:37:12,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:12,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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 115 [2023-11-19 07:37:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:12,879 INFO L225 Difference]: With dead ends: 20067 [2023-11-19 07:37:12,879 INFO L226 Difference]: Without dead ends: 10005 [2023-11-19 07:37:12,895 INFO L412 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 [2023-11-19 07:37:12,896 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 348 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 835 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 [2023-11-19 07:37:12,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 835 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10005 states. [2023-11-19 07:37:13,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10005 to 9944. [2023-11-19 07:37:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 9936 states have (on average 1.3970410628019323) internal successors, (13881), 9943 states have internal predecessors, (13881), 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) [2023-11-19 07:37:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 13881 transitions. [2023-11-19 07:37:13,364 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 13881 transitions. Word has length 115 [2023-11-19 07:37:13,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:13,364 INFO L495 AbstractCegarLoop]: Abstraction has 9944 states and 13881 transitions. [2023-11-19 07:37:13,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 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) [2023-11-19 07:37:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 13881 transitions. [2023-11-19 07:37:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-19 07:37:13,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:13,368 INFO L195 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] [2023-11-19 07:37:13,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:37:13,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:13,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:13,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1933744648, now seen corresponding path program 1 times [2023-11-19 07:37:13,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:13,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495319919] [2023-11-19 07:37:13,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:13,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:13,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495319919] [2023-11-19 07:37:13,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495319919] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:13,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587112356] [2023-11-19 07:37:13,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:13,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:13,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:13,483 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:13,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:37:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:13,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:37:13,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:37:13,764 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:37:13,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587112356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:13,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:37:13,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-19 07:37:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311506641] [2023-11-19 07:37:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:13,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:13,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:13,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:13,770 INFO L87 Difference]: Start difference. First operand 9944 states and 13881 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) [2023-11-19 07:37:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:14,150 INFO L93 Difference]: Finished difference Result 18599 states and 26006 transitions. [2023-11-19 07:37:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:14,151 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 [2023-11-19 07:37:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:14,168 INFO L225 Difference]: With dead ends: 18599 [2023-11-19 07:37:14,168 INFO L226 Difference]: Without dead ends: 8598 [2023-11-19 07:37:14,181 INFO L412 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 [2023-11-19 07:37:14,182 INFO L413 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 [2023-11-19 07:37:14,182 INFO L414 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] [2023-11-19 07:37:14,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8598 states. [2023-11-19 07:37:14,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8598 to 8027. [2023-11-19 07:37:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8027 states, 8019 states have (on average 1.3933158747973562) internal successors, (11173), 8026 states have internal predecessors, (11173), 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) [2023-11-19 07:37:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8027 states to 8027 states and 11173 transitions. [2023-11-19 07:37:14,597 INFO L78 Accepts]: Start accepts. Automaton has 8027 states and 11173 transitions. Word has length 115 [2023-11-19 07:37:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:14,598 INFO L495 AbstractCegarLoop]: Abstraction has 8027 states and 11173 transitions. [2023-11-19 07:37:14,598 INFO L496 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) [2023-11-19 07:37:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8027 states and 11173 transitions. [2023-11-19 07:37:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-19 07:37:14,600 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:14,601 INFO L195 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] [2023-11-19 07:37:14,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:14,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-19 07:37:14,826 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:14,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:14,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1930156709, now seen corresponding path program 1 times [2023-11-19 07:37:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:14,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316681686] [2023-11-19 07:37:14,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:14,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:37:14,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:14,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316681686] [2023-11-19 07:37:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316681686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687525486] [2023-11-19 07:37:14,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:14,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:14,956 INFO L87 Difference]: Start difference. First operand 8027 states and 11173 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) [2023-11-19 07:37:15,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:15,663 INFO L93 Difference]: Finished difference Result 16668 states and 23170 transitions. [2023-11-19 07:37:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:15,664 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 [2023-11-19 07:37:15,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:15,702 INFO L225 Difference]: With dead ends: 16668 [2023-11-19 07:37:15,703 INFO L226 Difference]: Without dead ends: 16664 [2023-11-19 07:37:15,707 INFO L412 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 [2023-11-19 07:37:15,708 INFO L413 NwaCegarLoop]: 399 mSDtfsCounter, 739 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1303 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 [2023-11-19 07:37:15,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1303 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16664 states. [2023-11-19 07:37:16,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16664 to 14601. [2023-11-19 07:37:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14593 states have (on average 1.4051942712259302) internal successors, (20506), 14600 states have internal predecessors, (20506), 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) [2023-11-19 07:37:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 20506 transitions. [2023-11-19 07:37:16,578 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 20506 transitions. Word has length 117 [2023-11-19 07:37:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:16,579 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 20506 transitions. [2023-11-19 07:37:16,579 INFO L496 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) [2023-11-19 07:37:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 20506 transitions. [2023-11-19 07:37:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-19 07:37:16,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:16,584 INFO L195 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] [2023-11-19 07:37:16,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 07:37:16,584 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:16,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1274447402, now seen corresponding path program 1 times [2023-11-19 07:37:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:16,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469248580] [2023-11-19 07:37:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:16,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:37:16,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:16,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469248580] [2023-11-19 07:37:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469248580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:16,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567455319] [2023-11-19 07:37:16,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:16,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:16,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:16,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:37:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:16,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-19 07:37:16,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:16,944 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 07:37:16,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:37:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567455319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:16,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:37:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2023-11-19 07:37:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006980737] [2023-11-19 07:37:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:16,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:16,948 INFO L87 Difference]: Start difference. First operand 14601 states and 20506 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) [2023-11-19 07:37:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:17,476 INFO L93 Difference]: Finished difference Result 15045 states and 21073 transitions. [2023-11-19 07:37:17,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:17,476 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 [2023-11-19 07:37:17,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:17,508 INFO L225 Difference]: With dead ends: 15045 [2023-11-19 07:37:17,509 INFO L226 Difference]: Without dead ends: 15044 [2023-11-19 07:37:17,514 INFO L412 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 [2023-11-19 07:37:17,515 INFO L413 NwaCegarLoop]: 497 mSDtfsCounter, 319 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:17,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 877 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15044 states. [2023-11-19 07:37:18,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15044 to 14600. [2023-11-19 07:37:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14600 states, 14593 states have (on average 1.4037552251079284) internal successors, (20485), 14599 states have internal predecessors, (20485), 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) [2023-11-19 07:37:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 20485 transitions. [2023-11-19 07:37:18,288 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 20485 transitions. Word has length 122 [2023-11-19 07:37:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:18,288 INFO L495 AbstractCegarLoop]: Abstraction has 14600 states and 20485 transitions. [2023-11-19 07:37:18,289 INFO L496 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) [2023-11-19 07:37:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 20485 transitions. [2023-11-19 07:37:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-19 07:37:18,291 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:18,291 INFO L195 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] [2023-11-19 07:37:18,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:18,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-19 07:37:18,514 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:18,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash 853164033, now seen corresponding path program 1 times [2023-11-19 07:37:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683056388] [2023-11-19 07:37:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:37:18,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683056388] [2023-11-19 07:37:18,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683056388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:18,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140975634] [2023-11-19 07:37:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:18,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:18,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:18,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:37:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:18,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-19 07:37:18,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:18,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:18,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:37:18,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140975634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:18,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:37:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-19 07:37:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290511212] [2023-11-19 07:37:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:18,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:18,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:37:18,823 INFO L87 Difference]: Start difference. First operand 14600 states and 20485 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) [2023-11-19 07:37:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:19,277 INFO L93 Difference]: Finished difference Result 15012 states and 21020 transitions. [2023-11-19 07:37:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:19,278 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 [2023-11-19 07:37:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:19,308 INFO L225 Difference]: With dead ends: 15012 [2023-11-19 07:37:19,308 INFO L226 Difference]: Without dead ends: 15011 [2023-11-19 07:37:19,313 INFO L412 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 [2023-11-19 07:37:19,314 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 156 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:19,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 885 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:19,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15011 states. [2023-11-19 07:37:19,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15011 to 14599. [2023-11-19 07:37:19,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14599 states, 14593 states have (on average 1.4023161789899268) internal successors, (20464), 14598 states have internal predecessors, (20464), 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) [2023-11-19 07:37:19,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14599 states to 14599 states and 20464 transitions. [2023-11-19 07:37:19,919 INFO L78 Accepts]: Start accepts. Automaton has 14599 states and 20464 transitions. Word has length 123 [2023-11-19 07:37:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:19,920 INFO L495 AbstractCegarLoop]: Abstraction has 14599 states and 20464 transitions. [2023-11-19 07:37:19,921 INFO L496 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) [2023-11-19 07:37:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 14599 states and 20464 transitions. [2023-11-19 07:37:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-11-19 07:37:19,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:19,931 INFO L195 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] [2023-11-19 07:37:19,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:20,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-19 07:37:20,146 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:20,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1222314496, now seen corresponding path program 1 times [2023-11-19 07:37:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:20,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132197397] [2023-11-19 07:37:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:20,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132197397] [2023-11-19 07:37:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132197397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:37:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085897283] [2023-11-19 07:37:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:20,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:20,271 INFO L87 Difference]: Start difference. First operand 14599 states and 20464 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) [2023-11-19 07:37:20,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:20,602 INFO L93 Difference]: Finished difference Result 18721 states and 26068 transitions. [2023-11-19 07:37:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:20,602 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 [2023-11-19 07:37:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:20,610 INFO L225 Difference]: With dead ends: 18721 [2023-11-19 07:37:20,611 INFO L226 Difference]: Without dead ends: 4005 [2023-11-19 07:37:20,627 INFO L412 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 [2023-11-19 07:37:20,628 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 163 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:20,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 488 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:37:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2023-11-19 07:37:20,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3136. [2023-11-19 07:37:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3130 states have (on average 1.1587859424920128) internal successors, (3627), 3135 states have internal predecessors, (3627), 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) [2023-11-19 07:37:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 3627 transitions. [2023-11-19 07:37:20,879 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 3627 transitions. Word has length 205 [2023-11-19 07:37:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:20,880 INFO L495 AbstractCegarLoop]: Abstraction has 3136 states and 3627 transitions. [2023-11-19 07:37:20,880 INFO L496 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) [2023-11-19 07:37:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 3627 transitions. [2023-11-19 07:37:20,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-19 07:37:20,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:20,889 INFO L195 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] [2023-11-19 07:37:20,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-19 07:37:20,889 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:20,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -692101379, now seen corresponding path program 1 times [2023-11-19 07:37:20,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628276006] [2023-11-19 07:37:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 07:37:21,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628276006] [2023-11-19 07:37:21,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628276006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:21,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472206947] [2023-11-19 07:37:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:21,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:21,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:21,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:21,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:37:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:37:21,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-19 07:37:21,507 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:37:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472206947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-19 07:37:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-19 07:37:21,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486765979] [2023-11-19 07:37:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:21,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:21,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:21,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:37:21,514 INFO L87 Difference]: Start difference. First operand 3136 states and 3627 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) [2023-11-19 07:37:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:21,680 INFO L93 Difference]: Finished difference Result 3974 states and 4606 transitions. [2023-11-19 07:37:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:21,681 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 [2023-11-19 07:37:21,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:21,685 INFO L225 Difference]: With dead ends: 3974 [2023-11-19 07:37:21,685 INFO L226 Difference]: Without dead ends: 1562 [2023-11-19 07:37:21,691 INFO L412 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 [2023-11-19 07:37:21,692 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 298 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:21,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 489 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2023-11-19 07:37:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1560. [2023-11-19 07:37:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1558 states have (on average 1.1482670089858793) internal successors, (1789), 1559 states have internal predecessors, (1789), 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) [2023-11-19 07:37:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1789 transitions. [2023-11-19 07:37:21,798 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1789 transitions. Word has length 220 [2023-11-19 07:37:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:21,799 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1789 transitions. [2023-11-19 07:37:21,799 INFO L496 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) [2023-11-19 07:37:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1789 transitions. [2023-11-19 07:37:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-11-19 07:37:21,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:21,806 INFO L195 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] [2023-11-19 07:37:21,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-19 07:37:22,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:22,026 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:22,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:22,027 INFO L85 PathProgramCache]: Analyzing trace with hash 980623008, now seen corresponding path program 1 times [2023-11-19 07:37:22,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315784194] [2023-11-19 07:37:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:22,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-19 07:37:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315784194] [2023-11-19 07:37:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315784194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:37:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347311322] [2023-11-19 07:37:22,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:22,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:22,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:22,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:22,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:22,215 INFO L87 Difference]: Start difference. First operand 1560 states and 1789 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) [2023-11-19 07:37:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:22,368 INFO L93 Difference]: Finished difference Result 2182 states and 2512 transitions. [2023-11-19 07:37:22,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:37:22,368 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 [2023-11-19 07:37:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:22,372 INFO L225 Difference]: With dead ends: 2182 [2023-11-19 07:37:22,372 INFO L226 Difference]: Without dead ends: 1592 [2023-11-19 07:37:22,374 INFO L412 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 [2023-11-19 07:37:22,375 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 216 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:22,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1051 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2023-11-19 07:37:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1524. [2023-11-19 07:37:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1522 states have (on average 1.136005256241787) internal successors, (1729), 1523 states have internal predecessors, (1729), 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) [2023-11-19 07:37:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 1729 transitions. [2023-11-19 07:37:22,475 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 1729 transitions. Word has length 225 [2023-11-19 07:37:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:22,476 INFO L495 AbstractCegarLoop]: Abstraction has 1524 states and 1729 transitions. [2023-11-19 07:37:22,476 INFO L496 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) [2023-11-19 07:37:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 1729 transitions. [2023-11-19 07:37:22,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-19 07:37:22,483 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:37:22,483 INFO L195 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] [2023-11-19 07:37:22,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-19 07:37:22,484 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-19 07:37:22,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1076956137, now seen corresponding path program 1 times [2023-11-19 07:37:22,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367823433] [2023-11-19 07:37:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-19 07:37:22,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:22,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367823433] [2023-11-19 07:37:22,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367823433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:22,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:22,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568633540] [2023-11-19 07:37:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:22,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:37:22,739 INFO L87 Difference]: Start difference. First operand 1524 states and 1729 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) [2023-11-19 07:37:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:37:22,900 INFO L93 Difference]: Finished difference Result 1544 states and 1749 transitions. [2023-11-19 07:37:22,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:37:22,901 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 [2023-11-19 07:37:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:37:22,902 INFO L225 Difference]: With dead ends: 1544 [2023-11-19 07:37:22,902 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:37:22,905 INFO L412 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 [2023-11-19 07:37:22,906 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 281 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:37:22,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 628 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:37:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:37:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:37:22,907 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) [2023-11-19 07:37:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:37:22,908 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 227 [2023-11-19 07:37:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:37:22,908 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:37:22,909 INFO L496 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) [2023-11-19 07:37:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:37:22,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:37:22,912 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-19 07:37:22,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-19 07:37:22,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-19 07:37:22,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-19 07:37:22,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-19 07:37:22,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-19 07:37:22,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-19 07:37:22,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-19 07:37:22,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-19 07:37:22,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:37:35,208 WARN L293 SmtUtils]: Spent 11.39s on a formula simplification. DAG size of input: 194 DAG size of output: 239 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-19 07:37:43,480 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-19 07:37:43,480 INFO L899 garLoopResultBuilder]: For program point $Ultimate##406(lines 764 808) no Hoare annotation was computed. [2023-11-19 07:37:43,480 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 617) no Hoare annotation was computed. [2023-11-19 07:37:43,480 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 130) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point $Ultimate##412(lines 772 807) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point L829(line 829) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point L829-1(line 829) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point $Ultimate##418(lines 780 806) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point L829-2(lines 829 835) no Hoare annotation was computed. [2023-11-19 07:37:43,481 INFO L899 garLoopResultBuilder]: For program point L829-3(lines 829 835) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L899 garLoopResultBuilder]: For program point L565(lines 565 569) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L899 garLoopResultBuilder]: For program point $Ultimate##424(lines 788 805) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L899 garLoopResultBuilder]: For program point s_run_returnLabel#1(lines 851 1112) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L899 garLoopResultBuilder]: For program point $Ultimate##430(lines 796 804) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L899 garLoopResultBuilder]: For program point L1095(lines 1087 1104) no Hoare annotation was computed. [2023-11-19 07:37:43,482 INFO L902 garLoopResultBuilder]: At program point L831(line 831) the Hoare annotation is: true [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point L765(lines 765 769) no Hoare annotation was computed. [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 703) no Hoare annotation was computed. [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 129) no Hoare annotation was computed. [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point L1096(lines 1096 1100) no Hoare annotation was computed. [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point $Ultimate##200(lines 364 372) no Hoare annotation was computed. [2023-11-19 07:37:43,483 INFO L899 garLoopResultBuilder]: For program point $Ultimate##442(lines 818 826) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##600(lines 1271 1315) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##606(lines 1279 1314) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##612(lines 1287 1313) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point $Ultimate##618(lines 1295 1312) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point L1296(lines 1296 1300) no Hoare annotation was computed. [2023-11-19 07:37:43,484 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 243) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point L966(lines 966 970) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point $Ultimate##624(lines 1303 1311) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point m_run_returnLabel#1(lines 85 844) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point L174(lines 144 175) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 128) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point L1033(lines 1033 1086) no Hoare annotation was computed. [2023-11-19 07:37:43,485 INFO L899 garLoopResultBuilder]: For program point $Ultimate##636(lines 1325 1333) no Hoare annotation was computed. [2023-11-19 07:37:43,486 INFO L899 garLoopResultBuilder]: For program point L439(lines 439 443) no Hoare annotation was computed. [2023-11-19 07:37:43,486 INFO L899 garLoopResultBuilder]: For program point L1034(lines 1034 1038) no Hoare annotation was computed. [2023-11-19 07:37:43,486 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2023-11-19 07:37:43,487 INFO L895 garLoopResultBuilder]: At program point L638-2(lines 638 666) the Hoare annotation is: (let ((.cse10 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse3 (= 2 ~s_run_pc~0)) (.cse11 (= ~m_run_pc~0 6)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse8 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse9 (= ~req_tt_a~0 0)) (.cse2 (not (= ~c_empty_req~0 1))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (not .cse3) .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse11) (and .cse7 .cse0 .cse8 .cse9 .cse2 (<= 0 ~a_t~0) .cse4 .cse5 .cse6))) [2023-11-19 07:37:43,487 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 1351 1376) no Hoare annotation was computed. [2023-11-19 07:37:43,487 INFO L899 garLoopResultBuilder]: For program point L639(lines 638 666) no Hoare annotation was computed. [2023-11-19 07:37:43,487 INFO L899 garLoopResultBuilder]: For program point L573(lines 573 577) no Hoare annotation was computed. [2023-11-19 07:37:43,487 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 127) no Hoare annotation was computed. [2023-11-19 07:37:43,487 INFO L899 garLoopResultBuilder]: For program point L904(lines 878 905) no Hoare annotation was computed. [2023-11-19 07:37:43,488 INFO L899 garLoopResultBuilder]: For program point L640(lines 640 644) no Hoare annotation was computed. [2023-11-19 07:37:43,488 INFO L895 garLoopResultBuilder]: At program point L178-2(lines 178 206) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse5 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse3 .cse4 (= 2 ~s_run_pc~0) .cse5 (<= 0 ~a_t~0) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse4 .cse6 .cse7 .cse8 .cse9))) [2023-11-19 07:37:43,488 INFO L899 garLoopResultBuilder]: For program point L773(lines 773 777) no Hoare annotation was computed. [2023-11-19 07:37:43,488 INFO L899 garLoopResultBuilder]: For program point L707(lines 707 711) no Hoare annotation was computed. [2023-11-19 07:37:43,488 INFO L899 garLoopResultBuilder]: For program point L179(lines 178 206) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L1303(lines 1255 1344) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L1237(lines 1237 1241) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 126) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L973(lines 965 982) no Hoare annotation was computed. [2023-11-19 07:37:43,489 INFO L899 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L1304(lines 1304 1308) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L1172(lines 1172 1176) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L1172-2(lines 1170 1349) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L974(lines 974 978) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point L446(lines 134 480) no Hoare annotation was computed. [2023-11-19 07:37:43,490 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point L447(lines 447 451) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 125) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point L1042(lines 1042 1046) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_MUTEX2#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point L911(lines 911 964) no Hoare annotation was computed. [2023-11-19 07:37:43,491 INFO L899 garLoopResultBuilder]: For program point L581(lines 581 585) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L317(lines 287 318) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L912(lines 912 916) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L714(lines 485 837) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L1177-1(lines 1170 1349) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 124) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L781(lines 781 785) no Hoare annotation was computed. [2023-11-19 07:37:43,492 INFO L899 garLoopResultBuilder]: For program point L715(lines 715 719) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point L386(lines 378 395) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_GET2#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point L254(lines 134 480) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point L1245(lines 1245 1249) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2023-11-19 07:37:43,493 INFO L899 garLoopResultBuilder]: For program point $Ultimate##299(lines 572 616) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 259) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point s_memory_read_returnLabel#1(lines 62 72) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_GET#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point s_run_L_SLAVE_RUN_PUT#1(lines 860 1111) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point L1050(lines 1050 1054) no Hoare annotation was computed. [2023-11-19 07:37:43,494 INFO L899 garLoopResultBuilder]: For program point L324(lines 324 377) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point L1183(lines 1183 1187) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point L985(lines 985 999) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point L589(lines 589 593) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point $Ultimate##494(lines 935 961) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point $Ultimate##251(lines 446 454) no Hoare annotation was computed. [2023-11-19 07:37:43,495 INFO L899 garLoopResultBuilder]: For program point L325(lines 325 329) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point L920(lines 920 924) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point L524(lines 494 525) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point $Ultimate##263(lines 468 476) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point L789(lines 789 793) no Hoare annotation was computed. [2023-11-19 07:37:43,496 INFO L899 garLoopResultBuilder]: For program point L1318(lines 1318 1322) no Hoare annotation was computed. [2023-11-19 07:37:43,497 INFO L899 garLoopResultBuilder]: For program point L1120(lines 1119 1160) no Hoare annotation was computed. [2023-11-19 07:37:43,497 INFO L899 garLoopResultBuilder]: For program point L461(lines 461 465) no Hoare annotation was computed. [2023-11-19 07:37:43,497 INFO L899 garLoopResultBuilder]: For program point L131(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,497 INFO L899 garLoopResultBuilder]: For program point $Ultimate##212(lines 386 394) no Hoare annotation was computed. [2023-11-19 07:37:43,497 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:37:43,498 INFO L895 garLoopResultBuilder]: At program point L528-2(lines 528 556) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_empty_req~0 0))) (.cse5 (<= 0 ~a_t~0)) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= ~m_run_pc~0 3)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-19 07:37:43,498 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2023-11-19 07:37:43,498 INFO L899 garLoopResultBuilder]: For program point $Ultimate##227(lines 414 458) no Hoare annotation was computed. [2023-11-19 07:37:43,498 INFO L899 garLoopResultBuilder]: For program point L991(lines 991 998) no Hoare annotation was computed. [2023-11-19 07:37:43,498 INFO L899 garLoopResultBuilder]: For program point L529(lines 528 556) no Hoare annotation was computed. [2023-11-19 07:37:43,498 INFO L899 garLoopResultBuilder]: For program point L397(lines 397 403) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point L397-1(lines 397 403) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point L1256(line 1256) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point L1124(lines 1124 1128) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point L1124-1(lines 1119 1160) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point $Ultimate##233(lines 422 457) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point L1058(lines 1058 1062) no Hoare annotation was computed. [2023-11-19 07:37:43,499 INFO L899 garLoopResultBuilder]: For program point $Ultimate##239(lines 430 456) no Hoare annotation was computed. [2023-11-19 07:37:43,500 INFO L899 garLoopResultBuilder]: For program point L530(lines 530 534) no Hoare annotation was computed. [2023-11-19 07:37:43,500 INFO L899 garLoopResultBuilder]: For program point L1191(lines 1191 1195) no Hoare annotation was computed. [2023-11-19 07:37:43,500 INFO L899 garLoopResultBuilder]: For program point $Ultimate##482(lines 919 963) no Hoare annotation was computed. [2023-11-19 07:37:43,500 INFO L895 garLoopResultBuilder]: At program point L134-2(lines 134 480) the Hoare annotation is: (let ((.cse12 (= ~m_run_pc~0 3)) (.cse13 (<= 1 |ULTIMATE.start_m_run_~a~0#1|)) (.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse14 (= 2 ~s_run_pc~0)) (.cse11 (<= 0 ~a_t~0)) (.cse10 (not (= ~s_run_st~0 0))) (.cse2 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse9 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~a_t~0 0) .cse8 .cse9) (and .cse1 .cse10 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13) (and (not .cse14) .cse1 .cse3 .cse4 .cse5 .cse11 .cse6 .cse7 .cse12 .cse13) (and .cse0 .cse1 .cse10 .cse3 .cse4 .cse5 .cse14 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) [2023-11-19 07:37:43,500 INFO L899 garLoopResultBuilder]: For program point $Ultimate##488(lines 927 962) no Hoare annotation was computed. [2023-11-19 07:37:43,501 INFO L899 garLoopResultBuilder]: For program point $Ultimate##245(lines 438 455) no Hoare annotation was computed. [2023-11-19 07:37:43,501 INFO L899 garLoopResultBuilder]: For program point L861(lines 861 873) no Hoare annotation was computed. [2023-11-19 07:37:43,501 INFO L899 garLoopResultBuilder]: For program point L729(lines 729 733) no Hoare annotation was computed. [2023-11-19 07:37:43,501 INFO L899 garLoopResultBuilder]: For program point L597(lines 597 601) no Hoare annotation was computed. [2023-11-19 07:37:43,501 INFO L902 garLoopResultBuilder]: At program point L399(line 399) the Hoare annotation is: true [2023-11-19 07:37:43,501 INFO L899 garLoopResultBuilder]: For program point L333(lines 333 337) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_PUT2#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point L135(lines 134 480) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 66 69) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point L928(lines 928 932) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point L796(lines 485 837) no Hoare annotation was computed. [2023-11-19 07:37:43,502 INFO L899 garLoopResultBuilder]: For program point L1325(lines 1255 1344) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point $Ultimate##305(lines 580 615) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point L797(lines 797 801) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point L1326(lines 1326 1330) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 273) no Hoare annotation was computed. [2023-11-19 07:37:43,503 INFO L899 garLoopResultBuilder]: For program point $Ultimate##550(lines 1041 1085) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point $Ultimate##311(lines 588 614) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point $Ultimate##317(lines 596 613) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point L864(lines 864 872) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point $Ultimate##556(lines 1049 1084) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point L468(lines 460 477) no Hoare annotation was computed. [2023-11-19 07:37:43,504 INFO L899 garLoopResultBuilder]: For program point $Ultimate##562(lines 1057 1083) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point $Ultimate##323(lines 604 612) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point L667(lines 637 668) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point L469(lines 469 473) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point L1130(lines 1119 1160) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point L1263(lines 1263 1316) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point $Ultimate##500(lines 943 960) no Hoare annotation was computed. [2023-11-19 07:37:43,505 INFO L899 garLoopResultBuilder]: For program point L867(lines 867 871) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point $Ultimate##506(lines 951 959) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point L1264(lines 1264 1268) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point L207(lines 177 208) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point L1066(lines 1066 1070) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point L736(lines 728 745) no Hoare annotation was computed. [2023-11-19 07:37:43,506 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 479) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L899 garLoopResultBuilder]: For program point L604(lines 485 837) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L899 garLoopResultBuilder]: For program point $Ultimate##518(lines 973 981) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L899 garLoopResultBuilder]: For program point L406(lines 406 459) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L899 garLoopResultBuilder]: For program point L1199(lines 1199 1203) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 79) no Hoare annotation was computed. [2023-11-19 07:37:43,507 INFO L895 garLoopResultBuilder]: At program point L1001-1(lines 1001 1025) the Hoare annotation is: (let ((.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~c_req_type~0 0)) (.cse10 (= ~m_run_pc~0 6)) (.cse7 (not (= 2 ~s_run_pc~0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse1 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse3 (not (= ~c_empty_req~0 0))) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse4 .cse8 .cse5 .cse6) (and .cse9 .cse7 .cse0 .cse2 .cse4 .cse8 .cse10 .cse6) (and .cse9 .cse0 .cse2 .cse3 .cse4 .cse10 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse9 .cse7 .cse0 .cse2 .cse3 .cse4 .cse10 .cse6) (and .cse7 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L737(lines 737 741) no Hoare annotation was computed. [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 609) no Hoare annotation was computed. [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L341(lines 341 345) no Hoare annotation was computed. [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L143(line 143) no Hoare annotation was computed. [2023-11-19 07:37:43,508 INFO L899 garLoopResultBuilder]: For program point L1134(lines 1134 1141) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point L143-1(line 143) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point L1002(lines 1001 1025) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point L276(lines 268 285) no Hoare annotation was computed. [2023-11-19 07:37:43,509 INFO L899 garLoopResultBuilder]: For program point L1003(lines 1003 1007) no Hoare annotation was computed. [2023-11-19 07:37:43,510 INFO L899 garLoopResultBuilder]: For program point L277(lines 277 281) no Hoare annotation was computed. [2023-11-19 07:37:43,510 INFO L895 garLoopResultBuilder]: At program point L145-2(lines 145 173) the Hoare annotation is: (let ((.cse0 (= ~c_req_type~0 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse3 (= ~req_tt_a~0 0)) (.cse6 (= |ULTIMATE.start_m_run_~req_type~0#1| 1)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (= ~s_run_pc~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse10 (= ~m_run_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= 2 ~s_run_pc~0) .cse6 (<= 0 ~a_t~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0) .cse9 .cse10) (and .cse2 .cse11 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2023-11-19 07:37:43,510 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-19 07:37:43,510 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 74 82) no Hoare annotation was computed. [2023-11-19 07:37:43,510 INFO L899 garLoopResultBuilder]: For program point L674(lines 674 727) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L146(lines 145 173) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L675(lines 675 679) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 829) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L214(lines 214 267) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L1073(lines 876 1106) no Hoare annotation was computed. [2023-11-19 07:37:43,511 INFO L899 garLoopResultBuilder]: For program point L479(line 479) no Hoare annotation was computed. [2023-11-19 07:37:43,512 INFO L899 garLoopResultBuilder]: For program point L479-1(line 479) no Hoare annotation was computed. [2023-11-19 07:37:43,512 INFO L899 garLoopResultBuilder]: For program point L1338(lines 1338 1342) no Hoare annotation was computed. [2023-11-19 07:37:43,512 INFO L895 garLoopResultBuilder]: At program point L1338-1(lines 1255 1344) the Hoare annotation is: (let ((.cse14 (= 2 ~s_run_pc~0))) (let ((.cse1 (= ~s_run_pc~0 0)) (.cse13 (not (= ~c_m_lock~0 1))) (.cse2 (= ~c_empty_req~0 1)) (.cse15 (= ~m_run_pc~0 0)) (.cse7 (= ~c_req_type~0 0)) (.cse11 (= ~m_run_pc~0 6)) (.cse16 (not .cse14)) (.cse17 (= ~c_req_type~0 1)) (.cse9 (= ~req_tt_a~0 0)) (.cse10 (not (= ~c_empty_req~0 0))) (.cse12 (= ~a_t~0 0)) (.cse8 (<= 2 ~c_write_req_ev~0)) (.cse0 (not (= ~s_run_st~0 0))) (.cse3 (= ~m_run_st~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~c_empty_rsp~0 1)) (.cse6 (= ~m_run_pc~0 3))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse0 .cse9 .cse10 .cse3 .cse4 .cse11 .cse12) (and .cse7 .cse8 .cse0 .cse9 .cse13 .cse3 .cse14 .cse2 .cse4 .cse5 .cse12 .cse15) (and .cse16 .cse8 .cse17 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse16 .cse8 .cse9 .cse4 .cse5 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse4 .cse5 .cse15) (and .cse8 .cse0 .cse9 .cse10 .cse3 .cse14 .cse4 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse2 .cse4 .cse5 .cse12 .cse15) (and .cse7 .cse16 .cse8 .cse9 .cse10 .cse4 .cse11 .cse12) (and .cse8 .cse0 .cse3 .cse14 .cse4 .cse5 .cse11) (and .cse16 .cse8 .cse17 .cse9 .cse10 .cse4 .cse6 .cse12) (and .cse8 .cse0 .cse3 .cse14 .cse4 .cse5 .cse6)))) [2023-11-19 07:37:43,512 INFO L899 garLoopResultBuilder]: For program point L1272(lines 1272 1276) no Hoare annotation was computed. [2023-11-19 07:37:43,513 INFO L899 garLoopResultBuilder]: For program point L215(lines 215 219) no Hoare annotation was computed. [2023-11-19 07:37:43,513 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1078) no Hoare annotation was computed. [2023-11-19 07:37:43,513 INFO L895 garLoopResultBuilder]: At program point L876-1(lines 876 1106) the Hoare annotation is: (let ((.cse8 (= ~m_run_pc~0 6)) (.cse7 (= ~c_req_type~0 0)) (.cse0 (not (= 2 ~s_run_pc~0))) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (= 2 ~c_write_rsp_ev~0)) (.cse5 (= ~m_run_pc~0 3)) (.cse6 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse4 .cse8 .cse6 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse8 .cse6) (and .cse7 .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse3 (not (= ~c_m_lock~0 1)) (= ~c_empty_req~0 1) .cse4 (= ~c_empty_rsp~0 1) .cse6 (= ~m_run_pc~0 0)) (and .cse1 .cse2 (= |ULTIMATE.start_s_run_~req_type~1#1| 1) .cse3 .cse4 .cse5 .cse6))) [2023-11-19 07:37:43,513 INFO L899 garLoopResultBuilder]: For program point L1207(lines 1207 1211) no Hoare annotation was computed. [2023-11-19 07:37:43,513 INFO L899 garLoopResultBuilder]: For program point L811(lines 811 815) no Hoare annotation was computed. [2023-11-19 07:37:43,513 INFO L899 garLoopResultBuilder]: For program point L481(lines 133 482) no Hoare annotation was computed. [2023-11-19 07:37:43,514 INFO L899 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2023-11-19 07:37:43,514 INFO L899 garLoopResultBuilder]: For program point L349(lines 349 353) no Hoare annotation was computed. [2023-11-19 07:37:43,514 INFO L899 garLoopResultBuilder]: For program point L944(lines 944 948) no Hoare annotation was computed. [2023-11-19 07:37:43,514 INFO L899 garLoopResultBuilder]: For program point start_simulation_returnLabel#1(lines 1167 1350) no Hoare annotation was computed. [2023-11-19 07:37:43,514 INFO L895 garLoopResultBuilder]: At program point L879-1(lines 879 903) the Hoare annotation is: (let ((.cse8 (= ~m_run_pc~0 6)) (.cse4 (= ~c_req_type~0 0)) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse5 (not (= ~s_run_st~0 0))) (.cse1 (= ~req_tt_a~0 0)) (.cse6 (= ~c_empty_req~0 1)) (.cse2 (= 2 ~c_write_rsp_ev~0)) (.cse7 (= ~c_empty_rsp~0 1)) (.cse3 (= ~a_t~0 0))) (or (and .cse0 (= ~c_req_type~0 1) .cse1 .cse2 (= ~m_run_pc~0 3) .cse3) (and .cse4 .cse0 .cse5 .cse1 (not .cse6) .cse2 .cse7 .cse8 .cse3) (and .cse4 .cse0 .cse1 .cse2 .cse8 .cse3 (= |ULTIMATE.start_s_run_~req_type~1#1| 0)) (and .cse4 (not (= 2 ~s_run_pc~0)) .cse0 .cse1 .cse2 .cse8 .cse3) (and .cse4 .cse0 .cse5 .cse1 (not (= ~c_m_lock~0 1)) .cse6 .cse2 .cse7 .cse3 (= ~m_run_pc~0 0)))) [2023-11-19 07:37:43,515 INFO L899 garLoopResultBuilder]: For program point L747(lines 747 753) no Hoare annotation was computed. [2023-11-19 07:37:43,515 INFO L899 garLoopResultBuilder]: For program point L747-1(lines 747 753) no Hoare annotation was computed. [2023-11-19 07:37:43,515 INFO L899 garLoopResultBuilder]: For program point L880(lines 879 903) no Hoare annotation was computed. [2023-11-19 07:37:43,515 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1119 1160) the Hoare annotation is: (let ((.cse5 (= 2 ~s_run_pc~0)) (.cse6 (= ~c_empty_req~0 1))) (let ((.cse4 (not (= ~c_m_lock~0 1))) (.cse10 (= ~m_run_pc~0 0)) (.cse14 (= ~s_run_pc~0 0)) (.cse16 (not .cse6)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse0 (= ~c_req_type~0 0)) (.cse2 (not (= ~s_run_st~0 0))) (.cse11 (= ~m_run_pc~0 6)) (.cse15 (not .cse5)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse17 (= ~c_req_type~0 1)) (.cse3 (= ~req_tt_a~0 0)) (.cse12 (not (= ~c_empty_req~0 0))) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse13 (= ~m_run_pc~0 3)) (.cse9 (= ~a_t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse11) (and .cse1 .cse2 .cse3 .cse12 .cse5 .cse7 .cse13 .cse9) (and .cse2 .cse14 .cse4 .cse6 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse14 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse15 .cse1 .cse3 .cse12 .cse7 .cse11 .cse9) (and .cse1 .cse2 .cse5 .cse7 .cse8 .cse13) (and .cse2 .cse14 .cse16 .cse7 .cse8 .cse13) (and .cse1 .cse17 .cse3 .cse16 .cse7 .cse8 .cse13 .cse9) (and .cse0 .cse1 .cse3 .cse16 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse7 .cse11 .cse9) (and .cse15 .cse1 .cse17 .cse3 .cse12 .cse7 .cse13 .cse9)))) [2023-11-19 07:37:43,515 INFO L899 garLoopResultBuilder]: For program point L881(lines 881 885) no Hoare annotation was computed. [2023-11-19 07:37:43,516 INFO L902 garLoopResultBuilder]: At program point L749(line 749) the Hoare annotation is: true [2023-11-19 07:37:43,516 INFO L899 garLoopResultBuilder]: For program point L683(lines 683 687) no Hoare annotation was computed. [2023-11-19 07:37:43,516 INFO L895 garLoopResultBuilder]: At program point L485-2(lines 485 837) the Hoare annotation is: (let ((.cse13 (= 2 ~s_run_pc~0))) (let ((.cse0 (not .cse13)) (.cse2 (= ~req_tt_a~0 0)) (.cse10 (= ~m_run_pc~0 3)) (.cse11 (= |ULTIMATE.start_m_run_~a~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse12 (not (= ~s_run_st~0 0))) (.cse3 (not (= ~c_m_lock~0 1))) (.cse4 (not (= ~c_empty_req~0 0))) (.cse9 (<= 0 ~a_t~0)) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse6 (= ~c_empty_rsp~0 1)) (.cse7 (= ~m_run_pc~0 6)) (.cse8 (<= 1 |ULTIMATE.start_m_run_~a~0#1|))) (or (and (= ~c_req_type~0 0) .cse0 .cse1 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~a_t~0 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse10 .cse11) (and .cse1 .cse12 .cse3 .cse4 .cse13 .cse9 .cse5 .cse6 .cse7 .cse8)))) [2023-11-19 07:37:43,516 INFO L899 garLoopResultBuilder]: For program point $Ultimate##176(lines 332 376) no Hoare annotation was computed. [2023-11-19 07:37:43,516 INFO L899 garLoopResultBuilder]: For program point L486(lines 485 837) no Hoare annotation was computed. [2023-11-19 07:37:43,517 INFO L895 garLoopResultBuilder]: At program point L288-2(lines 288 316) the Hoare annotation is: (let ((.cse4 (= 2 ~s_run_pc~0))) (let ((.cse3 (not (= ~c_empty_req~0 0))) (.cse6 (= ~m_run_pc~0 3)) (.cse9 (not .cse4)) (.cse7 (= ~a_t~0 0)) (.cse1 (not (= ~s_run_st~0 0))) (.cse0 (<= 2 ~c_write_req_ev~0)) (.cse10 (= ~c_req_type~0 1)) (.cse2 (= ~req_tt_a~0 0)) (.cse12 (not (= ~c_empty_req~0 1))) (.cse5 (= 2 ~c_write_rsp_ev~0)) (.cse11 (= ~c_empty_rsp~0 1)) (.cse8 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse2 .cse5 .cse11 .cse7 .cse8) (and .cse0 .cse1 .cse4 .cse5 .cse11) (and .cse1 (= ~s_run_pc~0 0) .cse12 .cse5 .cse11) (and .cse0 .cse10 .cse2 .cse12 .cse4 (<= 0 ~a_t~0) .cse5 .cse11 .cse8)))) [2023-11-19 07:37:43,517 INFO L899 garLoopResultBuilder]: For program point $Ultimate##182(lines 340 375) no Hoare annotation was computed. [2023-11-19 07:37:43,517 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 623) no Hoare annotation was computed. [2023-11-19 07:37:43,517 INFO L899 garLoopResultBuilder]: For program point $Ultimate##188(lines 348 374) no Hoare annotation was computed. [2023-11-19 07:37:43,517 INFO L899 garLoopResultBuilder]: For program point L487(lines 487 491) no Hoare annotation was computed. [2023-11-19 07:37:43,517 INFO L899 garLoopResultBuilder]: For program point L289(lines 288 316) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point L1280(lines 1280 1284) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point L223(lines 223 227) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point $Ultimate##50(lines 1244 1252) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point s_run_L_SLAVE_RUN_GET#1(lines 860 1111) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point L818(lines 810 827) no Hoare annotation was computed. [2023-11-19 07:37:43,518 INFO L899 garLoopResultBuilder]: For program point $Ultimate##194(lines 356 373) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point L290(lines 290 294) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point L1215(lines 1215 1219) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point L1149(lines 1149 1156) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point L951(lines 876 1106) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point L819(lines 819 823) no Hoare annotation was computed. [2023-11-19 07:37:43,519 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 836) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point L357(lines 357 361) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point L952(lines 952 956) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point $Ultimate##38(lines 1222 1230) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point $Ultimate##32(lines 1214 1231) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point $Ultimate##132(lines 238 264) no Hoare annotation was computed. [2023-11-19 07:37:43,520 INFO L899 garLoopResultBuilder]: For program point $Ultimate##373(lines 706 723) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point $Ultimate##379(lines 714 722) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_PUT#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 143) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point $Ultimate##138(lines 246 263) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:37:43,521 INFO L899 garLoopResultBuilder]: For program point $Ultimate##26(lines 1206 1232) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point L557(lines 527 558) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point $Ultimate##144(lines 254 262) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point $Ultimate##20(lines 1198 1233) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point L756(lines 756 809) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point $Ultimate##391(lines 736 744) no Hoare annotation was computed. [2023-11-19 07:37:43,522 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point $Ultimate##14(lines 1190 1234) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point $Ultimate##156(lines 276 284) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point L757(lines 757 761) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1092) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point $Ultimate##568(lines 1065 1082) no Hoare annotation was computed. [2023-11-19 07:37:43,523 INFO L899 garLoopResultBuilder]: For program point eval_returnLabel#1(lines 1113 1166) no Hoare annotation was computed. [2023-11-19 07:37:43,524 INFO L899 garLoopResultBuilder]: For program point L626(lines 618 635) no Hoare annotation was computed. [2023-11-19 07:37:43,524 INFO L899 garLoopResultBuilder]: For program point $Ultimate##335(lines 626 634) no Hoare annotation was computed. [2023-11-19 07:37:43,524 INFO L899 garLoopResultBuilder]: For program point $Ultimate##574(lines 1073 1081) no Hoare annotation was computed. [2023-11-19 07:37:43,524 INFO L899 garLoopResultBuilder]: For program point L627(lines 627 631) no Hoare annotation was computed. [2023-11-19 07:37:43,524 INFO L895 garLoopResultBuilder]: At program point L495-2(lines 495 523) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_m_run_~req_type___0~0#1| 0)) (.cse1 (<= 2 ~c_write_req_ev~0)) (.cse2 (= |ULTIMATE.start_m_run_~req_a___0~0#1| 0)) (.cse3 (= ~req_tt_a~0 0)) (.cse4 (not (= ~c_m_lock~0 1))) (.cse5 (not (= ~c_empty_req~0 0))) (.cse6 (<= 0 ~a_t~0)) (.cse7 (= 2 ~c_write_rsp_ev~0)) (.cse8 (= ~c_empty_rsp~0 1)) (.cse9 (= ~m_run_pc~0 3)) (.cse10 (= |ULTIMATE.start_m_run_~a~0#1| 0))) (or (and .cse0 (not (= 2 ~s_run_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 (not (= ~s_run_st~0 0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point L1288(lines 1288 1292) no Hoare annotation was computed. [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point L231(lines 231 235) no Hoare annotation was computed. [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point L1222(lines 1170 1349) no Hoare annotation was computed. [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point $Ultimate##586(lines 1095 1103) no Hoare annotation was computed. [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point L496(lines 495 523) no Hoare annotation was computed. [2023-11-19 07:37:43,525 INFO L899 garLoopResultBuilder]: For program point L364(lines 134 480) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point L1223(lines 1223 1227) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point $Ultimate##355(lines 682 726) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point L497(lines 497 501) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point L431(lines 431 435) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point L365(lines 365 369) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point m_run_L_MASTER_RUN_MUTEX#1(lines 101 843) no Hoare annotation was computed. [2023-11-19 07:37:43,526 INFO L899 garLoopResultBuilder]: For program point $Ultimate##120(lines 222 266) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L899 garLoopResultBuilder]: For program point $Ultimate##361(lines 690 725) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L899 garLoopResultBuilder]: For program point $Ultimate##126(lines 230 265) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L899 garLoopResultBuilder]: For program point $Ultimate##367(lines 698 724) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L899 garLoopResultBuilder]: For program point L1026(lines 1000 1027) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 16 23) no Hoare annotation was computed. [2023-11-19 07:37:43,527 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 16 23) the Hoare annotation is: true [2023-11-19 07:37:43,528 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-11-19 07:37:43,528 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 16 23) no Hoare annotation was computed. [2023-11-19 07:37:43,531 INFO L445 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] [2023-11-19 07:37:43,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:37:43,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:37:43 BoogieIcfgContainer [2023-11-19 07:37:43,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:37:43,603 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:37:43,603 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:37:43,603 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:37:43,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:02" (3/4) ... [2023-11-19 07:37:43,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:37:43,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-19 07:37:43,648 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-19 07:37:43,650 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-19 07:37:43,651 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:37:43,653 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:37:43,927 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:37:43,932 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:37:43,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:37:43,933 INFO L158 Benchmark]: Toolchain (without parser) took 43136.45ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 110.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 418.7MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,933 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 157.3MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:37:43,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 479.69ms. Allocated memory is still 157.3MB. Free memory was 110.8MB in the beginning and 90.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.40ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,934 INFO L158 Benchmark]: Boogie Preprocessor took 60.82ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 83.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,935 INFO L158 Benchmark]: RCFGBuilder took 1213.48ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 92.8MB in the end (delta: -9.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,936 INFO L158 Benchmark]: TraceAbstraction took 40946.21ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 92.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-11-19 07:37:43,936 INFO L158 Benchmark]: Witness Printer took 329.00ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-19 07:37:43,938 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 157.3MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 479.69ms. Allocated memory is still 157.3MB. Free memory was 110.8MB in the beginning and 90.0MB in the end (delta: 20.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.40ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 86.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.82ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 83.2MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1213.48ms. Allocated memory is still 157.3MB. Free memory was 83.1MB in the beginning and 92.8MB in the end (delta: -9.7MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 40946.21ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 92.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 329.00ms. Allocated memory is still 1.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 40.8s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8416 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8416 mSDsluCounter, 21690 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11039 mSDsCounter, 419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2450 IncrementalHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 419 mSolverCounterUnsat, 10651 mSDtfsCounter, 2450 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 687 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=16, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 8654 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 33 PreInvPairs, 269 NumberOfFragments, 2038 HoareAnnotationTreeSize, 33 FomulaSimplifications, 363267 FormulaSimplificationTreeSizeReduction, 14.6s HoareSimplificationTime, 19 FomulaSimplificationsInter, 35743 FormulaSimplificationTreeSizeReductionInter, 5.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3034 ConstructedInterpolants, 0 QuantifiedInterpolants, 5552 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1874 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 639/655 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: (((((((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (a_t == 0)) || (((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a))) - InvariantResult [Line: 495]: Loop Invariant Derived loop invariant: (((((((((((((req_type___0 == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) || ((((((((((((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))) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) || ((((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0))) || ((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (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)) && !((c_empty_req == 1))) && (0 <= a_t)) && (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_pc == 0)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (req_type == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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: (((((((((((((((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (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_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((((((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))) || (((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (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)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 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))) || (((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 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))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 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 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 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 == 3))) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) || ((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0))) || (((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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))) || ((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 1))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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))) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (req_type == 1)) && (0 <= a_t)) && (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 == 0))) && (req_type == 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: ((((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (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_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 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: (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (s_run_pc == 0)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (1 <= a))) || (((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_m_lock == 1))) && !((c_empty_req == 0))) && (0 <= a_t)) && (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))) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (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]: Loop Invariant Derived loop invariant: ((((((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || (((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (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))) || (((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_type == 1)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 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)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) || (((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (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)) && (req_tt_a == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (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)) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) || (((((((((((req_type___0 == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_a___0 == 0)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0))) - InvariantResult [Line: 1119]: 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)) && (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))) || ((((((((2 <= c_write_req_ev) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 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))) || ((((((((((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))) || ((((((((c_req_type == 0) && !((2 == s_run_pc))) && (2 <= c_write_req_ev)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (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))) || (((((!((s_run_st == 0)) && (s_run_pc == 0)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((2 <= c_write_req_ev) && (c_req_type == 1)) && (req_tt_a == 0)) && !((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)) && !((c_empty_req == 1))) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0))) || ((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && !((s_run_st == 0))) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0))) || (((((((!((2 == s_run_pc)) && (2 <= c_write_req_ev)) && (c_req_type == 1)) && (req_tt_a == 0)) && !((c_empty_req == 0))) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0))) RESULT: Ultimate proved your program to be correct! [2023-11-19 07:37:43,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d03e31e7-e45c-4fb0-bfb4-1f482852e5fa/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE