./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b 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_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:59:59,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:59:59,376 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:59:59,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:59:59,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:59:59,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:59:59,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:59:59,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:59:59,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:59:59,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:59:59,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:59:59,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:59:59,433 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:59:59,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:59:59,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:59:59,436 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:59:59,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:59:59,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:59:59,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:59:59,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:59:59,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:59:59,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:59:59,439 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:59:59,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:59:59,440 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:59:59,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:59:59,440 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:59:59,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:59:59,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:59:59,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:59:59,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:59:59,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:59:59,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:59:59,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:59:59,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:59:59,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:59:59,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:59:59,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:59:59,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:59:59,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:59:59,465 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:59:59,465 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_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/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_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2023-11-06 22:59:59,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:59:59,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:59:59,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:59:59,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:59:59,790 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:59:59,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-06 23:00:02,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:00:03,056 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:00:03,057 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-06 23:00:03,072 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/data/e23fd7341/16518ddd57e34e9b82145e3405823bc5/FLAG8236cdd58 [2023-11-06 23:00:03,093 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/data/e23fd7341/16518ddd57e34e9b82145e3405823bc5 [2023-11-06 23:00:03,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:00:03,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:00:03,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:03,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:00:03,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:00:03,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62aea240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03, skipping insertion in model container [2023-11-06 23:00:03,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,157 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:00:03,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:03,420 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:00:03,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:00:03,479 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:00:03,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03 WrapperNode [2023-11-06 23:00:03,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:00:03,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:03,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:00:03,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:00:03,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,551 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2023-11-06 23:00:03,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:00:03,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:00:03,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:00:03,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:00:03,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,596 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,599 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:00:03,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:00:03,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:00:03,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:00:03,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (1/1) ... [2023-11-06 23:00:03,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:00:03,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:03,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:00:03,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:00:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:00:03,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:00:03,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:00:03,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:00:03,792 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:00:03,794 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:00:04,438 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:00:04,446 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:00:04,447 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 23:00:04,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:04 BoogieIcfgContainer [2023-11-06 23:00:04,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:00:04,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:00:04,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:00:04,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:00:04,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:00:03" (1/3) ... [2023-11-06 23:00:04,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:04, skipping insertion in model container [2023-11-06 23:00:04,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:00:03" (2/3) ... [2023-11-06 23:00:04,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418a954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:00:04, skipping insertion in model container [2023-11-06 23:00:04,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:04" (3/3) ... [2023-11-06 23:00:04,463 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2023-11-06 23:00:04,484 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:00:04,484 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-06 23:00:04,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:00:04,568 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=LoopsAndPotentialCycles, 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;@59a57994, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:00:04,568 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-06 23:00:04,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 87 states have (on average 1.896551724137931) internal successors, (165), 128 states have internal predecessors, (165), 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-06 23:00:04,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-06 23:00:04,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:04,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-06 23:00:04,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:04,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2023-11-06 23:00:04,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166755655] [2023-11-06 23:00:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:04,810 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-06 23:00:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166755655] [2023-11-06 23:00:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166755655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:04,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:00:04,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780018845] [2023-11-06 23:00:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:00:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:04,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:00:04,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:00:04,852 INFO L87 Difference]: Start difference. First operand has 129 states, 87 states have (on average 1.896551724137931) internal successors, (165), 128 states have internal predecessors, (165), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-06 23:00:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:04,889 INFO L93 Difference]: Finished difference Result 161 states and 220 transitions. [2023-11-06 23:00:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:00:04,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-11-06 23:00:04,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:04,907 INFO L225 Difference]: With dead ends: 161 [2023-11-06 23:00:04,907 INFO L226 Difference]: Without dead ends: 77 [2023-11-06 23:00:04,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:00:04,917 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:04,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:00:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-06 23:00:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-11-06 23:00:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 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-06 23:00:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2023-11-06 23:00:04,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 4 [2023-11-06 23:00:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:04,974 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2023-11-06 23:00:04,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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-06 23:00:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2023-11-06 23:00:04,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 23:00:04,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:04,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:04,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:00:04,980 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:04,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash 295956508, now seen corresponding path program 1 times [2023-11-06 23:00:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:04,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97135287] [2023-11-06 23:00:04,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:05,237 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-06 23:00:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97135287] [2023-11-06 23:00:05,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97135287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:05,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:05,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:00:05,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428826503] [2023-11-06 23:00:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:05,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:05,243 INFO L87 Difference]: Start difference. First operand 77 states and 107 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 23:00:05,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:05,398 INFO L93 Difference]: Finished difference Result 161 states and 236 transitions. [2023-11-06 23:00:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2023-11-06 23:00:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:05,401 INFO L225 Difference]: With dead ends: 161 [2023-11-06 23:00:05,402 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 23:00:05,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-06 23:00:05,405 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 30 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 145 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 23:00:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2023-11-06 23:00:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 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-06 23:00:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2023-11-06 23:00:05,420 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 19 [2023-11-06 23:00:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:05,420 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2023-11-06 23:00:05,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-06 23:00:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2023-11-06 23:00:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 23:00:05,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:05,423 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, 1, 1] [2023-11-06 23:00:05,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:00:05,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:05,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:05,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1601634302, now seen corresponding path program 1 times [2023-11-06 23:00:05,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:05,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639704568] [2023-11-06 23:00:05,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:05,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639704568] [2023-11-06 23:00:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639704568] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:05,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:05,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:05,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896734564] [2023-11-06 23:00:05,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:05,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:05,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:05,701 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-06 23:00:06,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:06,014 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2023-11-06 23:00:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:00:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-06 23:00:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:06,017 INFO L225 Difference]: With dead ends: 230 [2023-11-06 23:00:06,017 INFO L226 Difference]: Without dead ends: 175 [2023-11-06 23:00:06,018 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-06 23:00:06,020 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 114 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:06,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 199 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-11-06 23:00:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 127. [2023-11-06 23:00:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.373015873015873) internal successors, (173), 126 states have internal predecessors, (173), 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-06 23:00:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2023-11-06 23:00:06,050 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 26 [2023-11-06 23:00:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:06,050 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2023-11-06 23:00:06,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-06 23:00:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2023-11-06 23:00:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 23:00:06,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:06,053 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] [2023-11-06 23:00:06,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:00:06,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:06,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1014937112, now seen corresponding path program 1 times [2023-11-06 23:00:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:06,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029380132] [2023-11-06 23:00:06,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:06,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:00:06,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029380132] [2023-11-06 23:00:06,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029380132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:06,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:06,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:06,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395814278] [2023-11-06 23:00:06,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:06,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:06,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:06,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:06,214 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 23:00:06,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:06,414 INFO L93 Difference]: Finished difference Result 362 states and 491 transitions. [2023-11-06 23:00:06,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:06,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 33 [2023-11-06 23:00:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:06,416 INFO L225 Difference]: With dead ends: 362 [2023-11-06 23:00:06,417 INFO L226 Difference]: Without dead ends: 260 [2023-11-06 23:00:06,418 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-06 23:00:06,419 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 140 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:06,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 351 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:06,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-11-06 23:00:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 140. [2023-11-06 23:00:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3597122302158273) internal successors, (189), 139 states have internal predecessors, (189), 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-06 23:00:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2023-11-06 23:00:06,435 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 33 [2023-11-06 23:00:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:06,435 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2023-11-06 23:00:06,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-06 23:00:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2023-11-06 23:00:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 23:00:06,438 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:06,438 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] [2023-11-06 23:00:06,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:00:06,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:06,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash -36396044, now seen corresponding path program 1 times [2023-11-06 23:00:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097484888] [2023-11-06 23:00:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-06 23:00:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097484888] [2023-11-06 23:00:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097484888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580532819] [2023-11-06 23:00:06,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:06,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:06,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:06,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:06,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:06,575 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-06 23:00:06,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:06,778 INFO L93 Difference]: Finished difference Result 368 states and 497 transitions. [2023-11-06 23:00:06,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:06,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 36 [2023-11-06 23:00:06,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:06,780 INFO L225 Difference]: With dead ends: 368 [2023-11-06 23:00:06,780 INFO L226 Difference]: Without dead ends: 266 [2023-11-06 23:00:06,784 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-06 23:00:06,788 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 129 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:06,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 341 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-06 23:00:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 153. [2023-11-06 23:00:06,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.3355263157894737) internal successors, (203), 152 states have internal predecessors, (203), 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-06 23:00:06,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 203 transitions. [2023-11-06 23:00:06,814 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 203 transitions. Word has length 36 [2023-11-06 23:00:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:06,814 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 203 transitions. [2023-11-06 23:00:06,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-06 23:00:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 203 transitions. [2023-11-06 23:00:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-06 23:00:06,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:06,824 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] [2023-11-06 23:00:06,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:00:06,826 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:06,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:06,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1620717245, now seen corresponding path program 1 times [2023-11-06 23:00:06,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:06,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809292297] [2023-11-06 23:00:06,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:06,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809292297] [2023-11-06 23:00:07,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809292297] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:07,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431578040] [2023-11-06 23:00:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:07,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:07,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:07,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:00:07,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:07,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:00:07,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 23:00:07,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:07,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431578040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-06 23:00:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325796246] [2023-11-06 23:00:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:07,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:07,214 INFO L87 Difference]: Start difference. First operand 153 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06 23:00:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:07,450 INFO L93 Difference]: Finished difference Result 306 states and 435 transitions. [2023-11-06 23:00:07,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:07,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 39 [2023-11-06 23:00:07,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:07,452 INFO L225 Difference]: With dead ends: 306 [2023-11-06 23:00:07,452 INFO L226 Difference]: Without dead ends: 206 [2023-11-06 23:00:07,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:07,453 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:07,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2023-11-06 23:00:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 184. [2023-11-06 23:00:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 183 states have internal predecessors, (240), 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-06 23:00:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 240 transitions. [2023-11-06 23:00:07,464 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 240 transitions. Word has length 39 [2023-11-06 23:00:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:07,464 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 240 transitions. [2023-11-06 23:00:07,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06 23:00:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 240 transitions. [2023-11-06 23:00:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 23:00:07,465 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:07,466 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2023-11-06 23:00:07,479 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:07,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:07,672 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:07,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 322716349, now seen corresponding path program 1 times [2023-11-06 23:00:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:07,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711276353] [2023-11-06 23:00:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:07,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:07,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711276353] [2023-11-06 23:00:07,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711276353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:07,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191199592] [2023-11-06 23:00:07,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:07,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:07,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:07,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:07,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:00:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:07,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:00:07,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-06 23:00:08,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191199592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:08,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-06 23:00:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361421863] [2023-11-06 23:00:08,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:08,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:08,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:08,034 INFO L87 Difference]: Start difference. First operand 184 states and 240 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06 23:00:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:08,238 INFO L93 Difference]: Finished difference Result 368 states and 503 transitions. [2023-11-06 23:00:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 46 [2023-11-06 23:00:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:08,242 INFO L225 Difference]: With dead ends: 368 [2023-11-06 23:00:08,242 INFO L226 Difference]: Without dead ends: 237 [2023-11-06 23:00:08,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:08,245 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 47 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:08,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 241 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:08,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-11-06 23:00:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2023-11-06 23:00:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 208 states have internal predecessors, (269), 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-06 23:00:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2023-11-06 23:00:08,261 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 46 [2023-11-06 23:00:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:08,262 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2023-11-06 23:00:08,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-06 23:00:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2023-11-06 23:00:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 23:00:08,263 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:08,264 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-06 23:00:08,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-06 23:00:08,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:08,470 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:08,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 759731705, now seen corresponding path program 1 times [2023-11-06 23:00:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192395040] [2023-11-06 23:00:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 23:00:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192395040] [2023-11-06 23:00:08,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192395040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:08,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:08,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:00:08,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104940626] [2023-11-06 23:00:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:08,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:08,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:08,610 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-06 23:00:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:08,626 INFO L93 Difference]: Finished difference Result 254 states and 324 transitions. [2023-11-06 23:00:08,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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 53 [2023-11-06 23:00:08,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:08,629 INFO L225 Difference]: With dead ends: 254 [2023-11-06 23:00:08,629 INFO L226 Difference]: Without dead ends: 183 [2023-11-06 23:00:08,629 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-06 23:00:08,633 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 14 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:08,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 221 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:00:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-06 23:00:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2023-11-06 23:00:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.2802197802197801) internal successors, (233), 182 states have internal predecessors, (233), 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-06 23:00:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 233 transitions. [2023-11-06 23:00:08,643 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 233 transitions. Word has length 53 [2023-11-06 23:00:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:08,643 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 233 transitions. [2023-11-06 23:00:08,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 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-06 23:00:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2023-11-06 23:00:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-06 23:00:08,645 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:08,645 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-06 23:00:08,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:00:08,646 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:08,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1220598021, now seen corresponding path program 1 times [2023-11-06 23:00:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:08,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892984369] [2023-11-06 23:00:08,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:08,875 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-06 23:00:08,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:08,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892984369] [2023-11-06 23:00:08,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892984369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:00:08,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757507415] [2023-11-06 23:00:08,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:08,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:08,879 INFO L87 Difference]: Start difference. First operand 183 states and 233 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-06 23:00:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:09,120 INFO L93 Difference]: Finished difference Result 497 states and 633 transitions. [2023-11-06 23:00:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:00:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 65 [2023-11-06 23:00:09,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:09,123 INFO L225 Difference]: With dead ends: 497 [2023-11-06 23:00:09,123 INFO L226 Difference]: Without dead ends: 365 [2023-11-06 23:00:09,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:09,124 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 149 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:09,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 292 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-11-06 23:00:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 225. [2023-11-06 23:00:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.2767857142857142) internal successors, (286), 224 states have internal predecessors, (286), 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-06 23:00:09,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2023-11-06 23:00:09,146 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 65 [2023-11-06 23:00:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:09,146 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2023-11-06 23:00:09,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-06 23:00:09,147 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2023-11-06 23:00:09,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-06 23:00:09,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:09,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:09,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:00:09,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:09,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:09,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1267682570, now seen corresponding path program 1 times [2023-11-06 23:00:09,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:09,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016873729] [2023-11-06 23:00:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:09,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 23:00:09,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:09,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016873729] [2023-11-06 23:00:09,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016873729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:09,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:00:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435577919] [2023-11-06 23:00:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:09,296 INFO L87 Difference]: Start difference. First operand 225 states and 286 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-06 23:00:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:09,370 INFO L93 Difference]: Finished difference Result 507 states and 645 transitions. [2023-11-06 23:00:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:09,371 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 68 [2023-11-06 23:00:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:09,373 INFO L225 Difference]: With dead ends: 507 [2023-11-06 23:00:09,373 INFO L226 Difference]: Without dead ends: 333 [2023-11-06 23:00:09,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:09,375 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 67 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:09,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 326 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-06 23:00:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 247. [2023-11-06 23:00:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 1.3008130081300813) internal successors, (320), 246 states have internal predecessors, (320), 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-06 23:00:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 320 transitions. [2023-11-06 23:00:09,386 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 320 transitions. Word has length 68 [2023-11-06 23:00:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:09,387 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 320 transitions. [2023-11-06 23:00:09,387 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-06 23:00:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 320 transitions. [2023-11-06 23:00:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:00:09,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:09,389 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-11-06 23:00:09,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:00:09,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:09,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:09,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1219048812, now seen corresponding path program 1 times [2023-11-06 23:00:09,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:09,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909698873] [2023-11-06 23:00:09,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:09,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:09,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:00:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909698873] [2023-11-06 23:00:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909698873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:00:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897048513] [2023-11-06 23:00:09,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:09,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:00:09,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:00:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:09,588 INFO L87 Difference]: Start difference. First operand 247 states and 320 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-06 23:00:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:09,913 INFO L93 Difference]: Finished difference Result 725 states and 940 transitions. [2023-11-06 23:00:09,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:00:09,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2023-11-06 23:00:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:09,920 INFO L225 Difference]: With dead ends: 725 [2023-11-06 23:00:09,920 INFO L226 Difference]: Without dead ends: 524 [2023-11-06 23:00:09,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:00:09,921 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 267 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:09,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 237 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2023-11-06 23:00:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 405. [2023-11-06 23:00:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 404 states have internal predecessors, (520), 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-06 23:00:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 520 transitions. [2023-11-06 23:00:09,945 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 520 transitions. Word has length 74 [2023-11-06 23:00:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:09,946 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 520 transitions. [2023-11-06 23:00:09,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-06 23:00:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 520 transitions. [2023-11-06 23:00:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:00:09,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:09,950 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:00:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:00:09,951 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:09,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1243874440, now seen corresponding path program 1 times [2023-11-06 23:00:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259941988] [2023-11-06 23:00:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-06 23:00:10,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259941988] [2023-11-06 23:00:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259941988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990059129] [2023-11-06 23:00:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:10,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:10,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:00:10,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:10,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:00:10,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:10,313 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:10,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990059129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:10,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:10,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-06 23:00:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439316961] [2023-11-06 23:00:10,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:10,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:10,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:10,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:10,316 INFO L87 Difference]: Start difference. First operand 405 states and 520 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-06 23:00:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:10,463 INFO L93 Difference]: Finished difference Result 1085 states and 1387 transitions. [2023-11-06 23:00:10,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:10,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 74 [2023-11-06 23:00:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:10,469 INFO L225 Difference]: With dead ends: 1085 [2023-11-06 23:00:10,469 INFO L226 Difference]: Without dead ends: 689 [2023-11-06 23:00:10,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:00:10,470 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 100 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:10,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 209 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2023-11-06 23:00:10,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 553. [2023-11-06 23:00:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 1.2771739130434783) internal successors, (705), 552 states have internal predecessors, (705), 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-06 23:00:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 705 transitions. [2023-11-06 23:00:10,501 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 705 transitions. Word has length 74 [2023-11-06 23:00:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:10,501 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 705 transitions. [2023-11-06 23:00:10,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-06 23:00:10,501 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 705 transitions. [2023-11-06 23:00:10,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-06 23:00:10,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:10,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2023-11-06 23:00:10,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:10,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 23:00:10,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:10,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:10,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1909734337, now seen corresponding path program 1 times [2023-11-06 23:00:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:10,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969600129] [2023-11-06 23:00:10,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:10,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 23:00:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:10,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969600129] [2023-11-06 23:00:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969600129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:00:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554051427] [2023-11-06 23:00:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:10,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:00:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:10,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:00:10,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:10,913 INFO L87 Difference]: Start difference. First operand 553 states and 705 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-06 23:00:11,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:11,286 INFO L93 Difference]: Finished difference Result 1385 states and 1753 transitions. [2023-11-06 23:00:11,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:00:11,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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 74 [2023-11-06 23:00:11,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:11,291 INFO L225 Difference]: With dead ends: 1385 [2023-11-06 23:00:11,291 INFO L226 Difference]: Without dead ends: 836 [2023-11-06 23:00:11,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:00:11,293 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 233 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:11,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 325 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2023-11-06 23:00:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 694. [2023-11-06 23:00:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.2626262626262625) internal successors, (875), 693 states have internal predecessors, (875), 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-06 23:00:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 875 transitions. [2023-11-06 23:00:11,328 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 875 transitions. Word has length 74 [2023-11-06 23:00:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:11,328 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 875 transitions. [2023-11-06 23:00:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 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-06 23:00:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 875 transitions. [2023-11-06 23:00:11,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-06 23:00:11,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:11,331 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:00:11,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:00:11,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:11,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:11,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1195193234, now seen corresponding path program 1 times [2023-11-06 23:00:11,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:11,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031283671] [2023-11-06 23:00:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:11,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 23:00:11,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:11,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031283671] [2023-11-06 23:00:11,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031283671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:11,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:11,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:00:11,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047108664] [2023-11-06 23:00:11,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:11,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:00:11,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:11,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:00:11,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:11,556 INFO L87 Difference]: Start difference. First operand 694 states and 875 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 23:00:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:12,062 INFO L93 Difference]: Finished difference Result 1776 states and 2225 transitions. [2023-11-06 23:00:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:00:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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 80 [2023-11-06 23:00:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:12,069 INFO L225 Difference]: With dead ends: 1776 [2023-11-06 23:00:12,069 INFO L226 Difference]: Without dead ends: 1008 [2023-11-06 23:00:12,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:00:12,071 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 209 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:12,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 468 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:00:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2023-11-06 23:00:12,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 824. [2023-11-06 23:00:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 1.2648845686512757) internal successors, (1041), 823 states have internal predecessors, (1041), 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-06 23:00:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1041 transitions. [2023-11-06 23:00:12,116 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1041 transitions. Word has length 80 [2023-11-06 23:00:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:12,117 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 1041 transitions. [2023-11-06 23:00:12,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-06 23:00:12,117 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1041 transitions. [2023-11-06 23:00:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-06 23:00:12,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:12,119 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-06 23:00:12,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:00:12,120 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:12,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash 345497436, now seen corresponding path program 1 times [2023-11-06 23:00:12,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:12,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571325975] [2023-11-06 23:00:12,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 23:00:12,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571325975] [2023-11-06 23:00:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571325975] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211022411] [2023-11-06 23:00:12,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:12,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:12,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:12,312 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:12,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:00:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:12,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 23:00:12,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-06 23:00:12,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 23:00:12,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211022411] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:12,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:12,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-06 23:00:12,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962557934] [2023-11-06 23:00:12,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:12,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:00:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:12,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:00:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:00:12,590 INFO L87 Difference]: Start difference. First operand 824 states and 1041 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 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-06 23:00:14,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:14,358 INFO L93 Difference]: Finished difference Result 4952 states and 6120 transitions. [2023-11-06 23:00:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-06 23:00:14,359 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 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 80 [2023-11-06 23:00:14,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:14,380 INFO L225 Difference]: With dead ends: 4952 [2023-11-06 23:00:14,380 INFO L226 Difference]: Without dead ends: 4010 [2023-11-06 23:00:14,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=531, Invalid=2225, Unknown=0, NotChecked=0, Total=2756 [2023-11-06 23:00:14,388 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 1001 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:14,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 986 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 23:00:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4010 states. [2023-11-06 23:00:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4010 to 1077. [2023-11-06 23:00:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.4070631970260223) internal successors, (1514), 1076 states have internal predecessors, (1514), 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-06 23:00:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1514 transitions. [2023-11-06 23:00:14,515 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1514 transitions. Word has length 80 [2023-11-06 23:00:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:14,515 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1514 transitions. [2023-11-06 23:00:14,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 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-06 23:00:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1514 transitions. [2023-11-06 23:00:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-06 23:00:14,518 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:14,518 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:00:14,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:14,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 23:00:14,724 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:14,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash 597160707, now seen corresponding path program 1 times [2023-11-06 23:00:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358075582] [2023-11-06 23:00:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358075582] [2023-11-06 23:00:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358075582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:00:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824426873] [2023-11-06 23:00:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:14,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:00:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:00:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:14,950 INFO L87 Difference]: Start difference. First operand 1077 states and 1514 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-06 23:00:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:15,404 INFO L93 Difference]: Finished difference Result 2470 states and 3454 transitions. [2023-11-06 23:00:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:00:15,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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 80 [2023-11-06 23:00:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:15,412 INFO L225 Difference]: With dead ends: 2470 [2023-11-06 23:00:15,412 INFO L226 Difference]: Without dead ends: 1378 [2023-11-06 23:00:15,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:00:15,415 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 345 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:15,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 288 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:00:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-06 23:00:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1237. [2023-11-06 23:00:15,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-06 23:00:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-06 23:00:15,517 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 80 [2023-11-06 23:00:15,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:15,518 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-06 23:00:15,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-06 23:00:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-06 23:00:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 23:00:15,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:15,521 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:15,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:00:15,522 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:15,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:15,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1385301662, now seen corresponding path program 1 times [2023-11-06 23:00:15,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:15,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290796761] [2023-11-06 23:00:15,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:15,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 23:00:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290796761] [2023-11-06 23:00:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290796761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:15,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:00:15,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964397180] [2023-11-06 23:00:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:15,802 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-06 23:00:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:16,201 INFO L93 Difference]: Finished difference Result 3874 states and 5448 transitions. [2023-11-06 23:00:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:00:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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 86 [2023-11-06 23:00:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:16,222 INFO L225 Difference]: With dead ends: 3874 [2023-11-06 23:00:16,222 INFO L226 Difference]: Without dead ends: 3689 [2023-11-06 23:00:16,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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-06 23:00:16,224 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 271 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:16,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 518 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:00:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2023-11-06 23:00:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 1237. [2023-11-06 23:00:16,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.4110032362459546) internal successors, (1744), 1236 states have internal predecessors, (1744), 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-06 23:00:16,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1744 transitions. [2023-11-06 23:00:16,363 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1744 transitions. Word has length 86 [2023-11-06 23:00:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:16,364 INFO L495 AbstractCegarLoop]: Abstraction has 1237 states and 1744 transitions. [2023-11-06 23:00:16,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 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-06 23:00:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1744 transitions. [2023-11-06 23:00:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-06 23:00:16,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:16,367 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:16,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:00:16,368 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:16,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 976764151, now seen corresponding path program 1 times [2023-11-06 23:00:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:16,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589590495] [2023-11-06 23:00:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-06 23:00:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589590495] [2023-11-06 23:00:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589590495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:00:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821239776] [2023-11-06 23:00:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:16,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:00:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:16,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:00:16,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:00:16,592 INFO L87 Difference]: Start difference. First operand 1237 states and 1744 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 23:00:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:16,658 INFO L93 Difference]: Finished difference Result 2423 states and 3426 transitions. [2023-11-06 23:00:16,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:00:16,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 86 [2023-11-06 23:00:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:16,665 INFO L225 Difference]: With dead ends: 2423 [2023-11-06 23:00:16,666 INFO L226 Difference]: Without dead ends: 1214 [2023-11-06 23:00:16,668 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-06 23:00:16,669 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 88 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:16,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:00:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2023-11-06 23:00:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1214. [2023-11-06 23:00:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 1.4130255564715581) internal successors, (1714), 1213 states have internal predecessors, (1714), 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-06 23:00:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1714 transitions. [2023-11-06 23:00:16,751 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1714 transitions. Word has length 86 [2023-11-06 23:00:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 1214 states and 1714 transitions. [2023-11-06 23:00:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-06 23:00:16,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1714 transitions. [2023-11-06 23:00:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 23:00:16,755 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:16,755 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:16,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:00:16,757 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:16,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2065857063, now seen corresponding path program 1 times [2023-11-06 23:00:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039334104] [2023-11-06 23:00:16,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:16,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:17,057 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-06 23:00:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:17,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039334104] [2023-11-06 23:00:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039334104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:17,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:00:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199017795] [2023-11-06 23:00:17,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:17,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:00:17,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:17,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:00:17,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:00:17,062 INFO L87 Difference]: Start difference. First operand 1214 states and 1714 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-06 23:00:17,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:17,286 INFO L93 Difference]: Finished difference Result 3024 states and 4066 transitions. [2023-11-06 23:00:17,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:00:17,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 89 [2023-11-06 23:00:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:17,296 INFO L225 Difference]: With dead ends: 3024 [2023-11-06 23:00:17,296 INFO L226 Difference]: Without dead ends: 1840 [2023-11-06 23:00:17,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:17,299 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 277 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:17,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 271 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2023-11-06 23:00:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1380. [2023-11-06 23:00:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.2849891225525742) internal successors, (1772), 1379 states have internal predecessors, (1772), 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-06 23:00:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1772 transitions. [2023-11-06 23:00:17,411 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1772 transitions. Word has length 89 [2023-11-06 23:00:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:17,411 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1772 transitions. [2023-11-06 23:00:17,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-06 23:00:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1772 transitions. [2023-11-06 23:00:17,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 23:00:17,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:17,414 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:17,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 23:00:17,415 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:17,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 32056339, now seen corresponding path program 1 times [2023-11-06 23:00:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490675557] [2023-11-06 23:00:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:17,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-06 23:00:17,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:17,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490675557] [2023-11-06 23:00:17,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490675557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:17,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:00:17,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:00:17,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047940125] [2023-11-06 23:00:17,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:17,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:00:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:00:17,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:00:17,700 INFO L87 Difference]: Start difference. First operand 1380 states and 1772 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-06 23:00:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:18,459 INFO L93 Difference]: Finished difference Result 5641 states and 7230 transitions. [2023-11-06 23:00:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:00:18,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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 89 [2023-11-06 23:00:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:18,488 INFO L225 Difference]: With dead ends: 5641 [2023-11-06 23:00:18,489 INFO L226 Difference]: Without dead ends: 5518 [2023-11-06 23:00:18,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:00:18,491 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 368 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:18,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 759 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:00:18,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5518 states. [2023-11-06 23:00:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5518 to 1380. [2023-11-06 23:00:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.2849891225525742) internal successors, (1772), 1379 states have internal predecessors, (1772), 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-06 23:00:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1772 transitions. [2023-11-06 23:00:18,662 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1772 transitions. Word has length 89 [2023-11-06 23:00:18,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:18,663 INFO L495 AbstractCegarLoop]: Abstraction has 1380 states and 1772 transitions. [2023-11-06 23:00:18,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-06 23:00:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1772 transitions. [2023-11-06 23:00:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 23:00:18,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:18,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:18,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 23:00:18,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:18,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:18,667 INFO L85 PathProgramCache]: Analyzing trace with hash -131012616, now seen corresponding path program 1 times [2023-11-06 23:00:18,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:18,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977464257] [2023-11-06 23:00:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:18,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-06 23:00:18,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977464257] [2023-11-06 23:00:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977464257] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:18,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087861091] [2023-11-06 23:00:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:18,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:18,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:18,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:18,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:00:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:18,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:00:18,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 23:00:19,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:19,171 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 23:00:19,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087861091] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:19,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:19,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11 [2023-11-06 23:00:19,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361895277] [2023-11-06 23:00:19,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:19,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:00:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:19,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:00:19,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:00:19,175 INFO L87 Difference]: Start difference. First operand 1380 states and 1772 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-06 23:00:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:20,369 INFO L93 Difference]: Finished difference Result 4594 states and 6126 transitions. [2023-11-06 23:00:20,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 23:00:20,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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 89 [2023-11-06 23:00:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:20,391 INFO L225 Difference]: With dead ends: 4594 [2023-11-06 23:00:20,391 INFO L226 Difference]: Without dead ends: 3199 [2023-11-06 23:00:20,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:00:20,395 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 583 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:20,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 455 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:00:20,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2023-11-06 23:00:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 2552. [2023-11-06 23:00:20,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2551 states have (on average 1.2140337122696983) internal successors, (3097), 2551 states have internal predecessors, (3097), 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-06 23:00:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3097 transitions. [2023-11-06 23:00:20,680 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3097 transitions. Word has length 89 [2023-11-06 23:00:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:20,681 INFO L495 AbstractCegarLoop]: Abstraction has 2552 states and 3097 transitions. [2023-11-06 23:00:20,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-06 23:00:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3097 transitions. [2023-11-06 23:00:20,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-06 23:00:20,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:20,685 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:20,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-06 23:00:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:20,890 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:20,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash 939921604, now seen corresponding path program 1 times [2023-11-06 23:00:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321688754] [2023-11-06 23:00:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:20,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-06 23:00:21,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321688754] [2023-11-06 23:00:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321688754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765006300] [2023-11-06 23:00:21,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:21,106 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:21,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:00:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:21,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:00:21,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:21,278 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 23:00:21,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765006300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:21,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:21,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-06 23:00:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166942906] [2023-11-06 23:00:21,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:21,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:21,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:21,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:21,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:21,283 INFO L87 Difference]: Start difference. First operand 2552 states and 3097 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-06 23:00:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:21,566 INFO L93 Difference]: Finished difference Result 2782 states and 3363 transitions. [2023-11-06 23:00:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 89 [2023-11-06 23:00:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:21,590 INFO L225 Difference]: With dead ends: 2782 [2023-11-06 23:00:21,590 INFO L226 Difference]: Without dead ends: 2303 [2023-11-06 23:00:21,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:00:21,593 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:21,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 119 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2023-11-06 23:00:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2218. [2023-11-06 23:00:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.2174109156517816) internal successors, (2699), 2217 states have internal predecessors, (2699), 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-06 23:00:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 2699 transitions. [2023-11-06 23:00:21,783 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 2699 transitions. Word has length 89 [2023-11-06 23:00:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:21,784 INFO L495 AbstractCegarLoop]: Abstraction has 2218 states and 2699 transitions. [2023-11-06 23:00:21,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-06 23:00:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2699 transitions. [2023-11-06 23:00:21,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 23:00:21,787 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:21,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:21,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:21,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 23:00:21,993 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:21,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash -306401169, now seen corresponding path program 1 times [2023-11-06 23:00:21,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:21,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517850385] [2023-11-06 23:00:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:21,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 23:00:22,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:22,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517850385] [2023-11-06 23:00:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517850385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:22,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737492122] [2023-11-06 23:00:22,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:22,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:22,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:22,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:22,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:00:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:22,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 23:00:22,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:22,898 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:00:22,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 23:00:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737492122] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:23,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:23,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2023-11-06 23:00:23,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754882901] [2023-11-06 23:00:23,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:23,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 23:00:23,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:23,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 23:00:23,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:00:23,248 INFO L87 Difference]: Start difference. First operand 2218 states and 2699 transitions. Second operand has 19 states, 19 states have (on average 11.789473684210526) internal successors, (224), 19 states have internal predecessors, (224), 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-06 23:00:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:25,725 INFO L93 Difference]: Finished difference Result 8272 states and 9886 transitions. [2023-11-06 23:00:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 23:00:25,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.789473684210526) internal successors, (224), 19 states have internal predecessors, (224), 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 91 [2023-11-06 23:00:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:25,741 INFO L225 Difference]: With dead ends: 8272 [2023-11-06 23:00:25,741 INFO L226 Difference]: Without dead ends: 7787 [2023-11-06 23:00:25,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=669, Invalid=1881, Unknown=0, NotChecked=0, Total=2550 [2023-11-06 23:00:25,746 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 1149 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:25,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2305 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:00:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7787 states. [2023-11-06 23:00:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7787 to 3783. [2023-11-06 23:00:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3783 states, 3782 states have (on average 1.222897937599154) internal successors, (4625), 3782 states have internal predecessors, (4625), 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-06 23:00:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3783 states to 3783 states and 4625 transitions. [2023-11-06 23:00:26,252 INFO L78 Accepts]: Start accepts. Automaton has 3783 states and 4625 transitions. Word has length 91 [2023-11-06 23:00:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:26,252 INFO L495 AbstractCegarLoop]: Abstraction has 3783 states and 4625 transitions. [2023-11-06 23:00:26,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.789473684210526) internal successors, (224), 19 states have internal predecessors, (224), 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-06 23:00:26,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3783 states and 4625 transitions. [2023-11-06 23:00:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 23:00:26,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:26,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:26,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:26,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-06 23:00:26,464 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:26,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash -709908213, now seen corresponding path program 1 times [2023-11-06 23:00:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119853057] [2023-11-06 23:00:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:26,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 23:00:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:26,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119853057] [2023-11-06 23:00:26,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119853057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:26,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379671609] [2023-11-06 23:00:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:26,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:26,752 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:26,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:00:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:27,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 23:00:27,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 23:00:27,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 23:00:27,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379671609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:27,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:27,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 15 [2023-11-06 23:00:27,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873137983] [2023-11-06 23:00:27,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:27,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 23:00:27,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:27,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 23:00:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:00:27,525 INFO L87 Difference]: Start difference. First operand 3783 states and 4625 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 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-06 23:00:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:30,381 INFO L93 Difference]: Finished difference Result 8917 states and 10973 transitions. [2023-11-06 23:00:30,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-06 23:00:30,381 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 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 95 [2023-11-06 23:00:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:30,392 INFO L225 Difference]: With dead ends: 8917 [2023-11-06 23:00:30,392 INFO L226 Difference]: Without dead ends: 5643 [2023-11-06 23:00:30,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 182 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=401, Invalid=1579, Unknown=0, NotChecked=0, Total=1980 [2023-11-06 23:00:30,398 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 1668 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:30,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 860 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 23:00:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2023-11-06 23:00:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 4635. [2023-11-06 23:00:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4634 states have (on average 1.213422529132499) internal successors, (5623), 4634 states have internal predecessors, (5623), 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-06 23:00:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 5623 transitions. [2023-11-06 23:00:30,935 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 5623 transitions. Word has length 95 [2023-11-06 23:00:30,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:30,935 INFO L495 AbstractCegarLoop]: Abstraction has 4635 states and 5623 transitions. [2023-11-06 23:00:30,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 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-06 23:00:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 5623 transitions. [2023-11-06 23:00:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-11-06 23:00:30,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:30,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:00:30,949 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:31,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-06 23:00:31,150 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:31,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1696692298, now seen corresponding path program 1 times [2023-11-06 23:00:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113347938] [2023-11-06 23:00:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:31,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:00:31,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113347938] [2023-11-06 23:00:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113347938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309593281] [2023-11-06 23:00:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:31,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:31,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:31,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:31,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:00:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:31,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:00:31,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 23:00:31,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309593281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-06 23:00:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631804089] [2023-11-06 23:00:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:31,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:00:31,576 INFO L87 Difference]: Start difference. First operand 4635 states and 5623 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-06 23:00:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:32,069 INFO L93 Difference]: Finished difference Result 5505 states and 6624 transitions. [2023-11-06 23:00:32,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:32,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 95 [2023-11-06 23:00:32,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:32,078 INFO L225 Difference]: With dead ends: 5505 [2023-11-06 23:00:32,078 INFO L226 Difference]: Without dead ends: 4191 [2023-11-06 23:00:32,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:00:32,082 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 61 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:32,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 113 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2023-11-06 23:00:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 3985. [2023-11-06 23:00:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3985 states, 3984 states have (on average 1.2166164658634537) internal successors, (4847), 3984 states have internal predecessors, (4847), 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-06 23:00:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3985 states to 3985 states and 4847 transitions. [2023-11-06 23:00:32,595 INFO L78 Accepts]: Start accepts. Automaton has 3985 states and 4847 transitions. Word has length 95 [2023-11-06 23:00:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:32,595 INFO L495 AbstractCegarLoop]: Abstraction has 3985 states and 4847 transitions. [2023-11-06 23:00:32,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-06 23:00:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3985 states and 4847 transitions. [2023-11-06 23:00:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-06 23:00:32,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:32,604 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:32,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:32,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-06 23:00:32,814 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:32,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1114079335, now seen corresponding path program 1 times [2023-11-06 23:00:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913261032] [2023-11-06 23:00:32,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-06 23:00:33,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913261032] [2023-11-06 23:00:33,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913261032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:33,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047284811] [2023-11-06 23:00:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:33,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:33,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:33,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:33,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:00:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:33,586 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-06 23:00:33,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 27 proven. 32 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-06 23:00:33,824 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:00:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 23:00:34,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047284811] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:00:34,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:00:34,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-11-06 23:00:34,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742111796] [2023-11-06 23:00:34,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:00:34,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 23:00:34,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:34,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 23:00:34,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-11-06 23:00:34,073 INFO L87 Difference]: Start difference. First operand 3985 states and 4847 transitions. Second operand has 16 states, 16 states have (on average 15.375) internal successors, (246), 16 states have internal predecessors, (246), 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-06 23:00:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:36,626 INFO L93 Difference]: Finished difference Result 12933 states and 15238 transitions. [2023-11-06 23:00:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 23:00:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.375) internal successors, (246), 16 states have internal predecessors, (246), 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 97 [2023-11-06 23:00:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:36,637 INFO L225 Difference]: With dead ends: 12933 [2023-11-06 23:00:36,637 INFO L226 Difference]: Without dead ends: 4864 [2023-11-06 23:00:36,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=372, Invalid=1034, Unknown=0, NotChecked=0, Total=1406 [2023-11-06 23:00:36,647 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 754 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:36,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 2229 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 23:00:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4864 states. [2023-11-06 23:00:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4864 to 1880. [2023-11-06 23:00:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1879 states have (on average 1.2267163384779138) internal successors, (2305), 1879 states have internal predecessors, (2305), 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-06 23:00:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2305 transitions. [2023-11-06 23:00:36,914 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2305 transitions. Word has length 97 [2023-11-06 23:00:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:36,914 INFO L495 AbstractCegarLoop]: Abstraction has 1880 states and 2305 transitions. [2023-11-06 23:00:36,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.375) internal successors, (246), 16 states have internal predecessors, (246), 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-06 23:00:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2305 transitions. [2023-11-06 23:00:36,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 23:00:36,917 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:36,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-06 23:00:36,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:37,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-06 23:00:37,124 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:37,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash 964748632, now seen corresponding path program 1 times [2023-11-06 23:00:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:37,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553043107] [2023-11-06 23:00:37,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:00:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:00:37,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553043107] [2023-11-06 23:00:37,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553043107] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:00:37,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351693641] [2023-11-06 23:00:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:37,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:00:37,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:00:37,553 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:00:37,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:00:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:00:37,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 23:00:37,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:00:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-06 23:00:37,770 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:00:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351693641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:00:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:00:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2023-11-06 23:00:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597597012] [2023-11-06 23:00:37,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:00:37,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:00:37,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:00:37,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:00:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:00:37,772 INFO L87 Difference]: Start difference. First operand 1880 states and 2305 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-06 23:00:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:00:37,930 INFO L93 Difference]: Finished difference Result 3247 states and 4004 transitions. [2023-11-06 23:00:37,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:00:37,931 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 101 [2023-11-06 23:00:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:00:37,934 INFO L225 Difference]: With dead ends: 3247 [2023-11-06 23:00:37,934 INFO L226 Difference]: Without dead ends: 1334 [2023-11-06 23:00:37,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:00:37,938 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 40 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:00:37,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 125 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:00:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2023-11-06 23:00:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1092. [2023-11-06 23:00:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.225481209899175) internal successors, (1337), 1091 states have internal predecessors, (1337), 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-06 23:00:38,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1337 transitions. [2023-11-06 23:00:38,083 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1337 transitions. Word has length 101 [2023-11-06 23:00:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:00:38,083 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1337 transitions. [2023-11-06 23:00:38,084 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-06 23:00:38,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1337 transitions. [2023-11-06 23:00:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-06 23:00:38,086 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:00:38,086 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 23:00:38,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:00:38,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 23:00:38,292 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-06 23:00:38,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:00:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1365348958, now seen corresponding path program 1 times [2023-11-06 23:00:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:00:38,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749174723] [2023-11-06 23:00:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:00:38,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:00:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:00:38,394 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:00:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:00:38,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:00:38,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:00:38,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-06 23:00:38,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-06 23:00:38,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-06 23:00:38,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-06 23:00:38,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-06 23:00:38,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-06 23:00:38,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-06 23:00:38,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-06 23:00:38,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-06 23:00:38,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-06 23:00:38,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-06 23:00:38,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-06 23:00:38,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-06 23:00:38,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-06 23:00:38,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-06 23:00:38,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-06 23:00:38,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-06 23:00:38,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-06 23:00:38,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-06 23:00:38,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-06 23:00:38,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-06 23:00:38,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-06 23:00:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-06 23:00:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-06 23:00:38,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-06 23:00:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-06 23:00:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-06 23:00:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-06 23:00:38,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-06 23:00:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-06 23:00:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-06 23:00:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-06 23:00:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-06 23:00:38,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-06 23:00:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-06 23:00:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-06 23:00:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-06 23:00:38,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-06 23:00:38,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-06 23:00:38,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-06 23:00:38,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-06 23:00:38,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-06 23:00:38,547 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:00:38,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:00:38,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:00:38 BoogieIcfgContainer [2023-11-06 23:00:38,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:00:38,683 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:00:38,683 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:00:38,683 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:00:38,684 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:00:04" (3/4) ... [2023-11-06 23:00:38,685 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:00:38,798 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:00:38,799 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:00:38,800 INFO L158 Benchmark]: Toolchain (without parser) took 35698.30ms. Allocated memory was 138.4MB in the beginning and 604.0MB in the end (delta: 465.6MB). Free memory was 93.6MB in the beginning and 501.3MB in the end (delta: -407.7MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,800 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:00:38,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.67ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 80.5MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.86ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 76.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,802 INFO L158 Benchmark]: Boogie Preprocessor took 54.33ms. Allocated memory is still 138.4MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,804 INFO L158 Benchmark]: RCFGBuilder took 824.94ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 74.2MB in the beginning and 162.2MB in the end (delta: -88.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,805 INFO L158 Benchmark]: TraceAbstraction took 34229.87ms. Allocated memory was 192.9MB in the beginning and 604.0MB in the end (delta: 411.0MB). Free memory was 161.3MB in the beginning and 508.7MB in the end (delta: -347.4MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,806 INFO L158 Benchmark]: Witness Printer took 115.75ms. Allocated memory is still 604.0MB. Free memory was 508.7MB in the beginning and 501.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:00:38,816 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.25ms. Allocated memory is still 138.4MB. Free memory was 108.0MB in the beginning and 107.8MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.67ms. Allocated memory is still 138.4MB. Free memory was 93.6MB in the beginning and 80.5MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.86ms. Allocated memory is still 138.4MB. Free memory was 80.5MB in the beginning and 76.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.33ms. Allocated memory is still 138.4MB. Free memory was 76.3MB in the beginning and 74.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 824.94ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 74.2MB in the beginning and 162.2MB in the end (delta: -88.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34229.87ms. Allocated memory was 192.9MB in the beginning and 604.0MB in the end (delta: 411.0MB). Free memory was 161.3MB in the beginning and 508.7MB in the end (delta: -347.4MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. * Witness Printer took 115.75ms. Allocated memory is still 604.0MB. Free memory was 508.7MB in the beginning and 501.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0 | (r1 << 8U)=0, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0 | (r1 << 8U)=0, r0=0, r1=0, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0 | (r1 << 8U) | (r2 << 16U)=0, r0 | (r1 << 8U)=0, r0=0, r1=0, r2=0, r3=255] [L116] r3 << 24U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0 | (r1 << 8U) | (r2 << 16U)=0, r0 | (r1 << 8U)=0, r0=0, r1=0, r2=0, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 129 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 34.0s, OverallIterations: 28, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8216 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8216 mSDsluCounter, 12835 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9502 mSDsCounter, 566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7027 IncrementalHoareTripleChecker+Invalid, 7593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 566 mSolverCounterUnsat, 3333 mSDtfsCounter, 7027 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1718 GetRequests, 1404 SyntacticMatches, 8 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4635occurred in iteration=24, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 20442 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2861 NumberOfCodeBlocks, 2861 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3163 ConstructedInterpolants, 0 QuantifiedInterpolants, 12407 SizeOfPredicates, 27 NumberOfNonLiveVariables, 2002 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 43 InterpolantComputations, 22 PerfectInterpolantSequences, 2390/2871 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-06 23:00:38,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_046e51cc-029e-4e7c-bcbf-ba4a10b9d63b/bin/uautomizer-verify-WvqO1wxjHP/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)