./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:39:03,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:39:03,771 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 04:39:03,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:39:03,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:39:03,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:39:03,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:39:03,831 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:39:03,832 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:39:03,832 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:39:03,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:39:03,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:39:03,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:39:03,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:39:03,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:39:03,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:39:03,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:39:03,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:39:03,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:39:03,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:39:03,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:39:03,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:39:03,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:39:03,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:39:03,840 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 04:39:03,841 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:39:03,841 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:39:03,841 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:39:03,842 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:39:03,842 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:39:03,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:39:03,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:39:03,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:39:03,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:39:03,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:39:03,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:39:03,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:39:03,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:39:03,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:39:03,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:39:03,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:39:03,845 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:39:03,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:39:03,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:39:03,846 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_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/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_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac64f5b077f8251002b0bb05f1aba070a52d8bbef53fa94e35704949c96b0f7c [2023-11-29 04:39:04,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:39:04,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:39:04,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:39:04,098 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:39:04,099 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:39:04,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/byte_add-2.i [2023-11-29 04:39:06,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:39:07,020 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:39:07,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/sv-benchmarks/c/bitvector/byte_add-2.i [2023-11-29 04:39:07,028 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/data/2c840b04f/3c4705644d464651ad37e0b1df93f31c/FLAGd93827f45 [2023-11-29 04:39:07,040 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/data/2c840b04f/3c4705644d464651ad37e0b1df93f31c [2023-11-29 04:39:07,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:39:07,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:39:07,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:39:07,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:39:07,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:39:07,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f4a17c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07, skipping insertion in model container [2023-11-29 04:39:07,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,078 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:39:07,280 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:39:07,290 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:39:07,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:39:07,352 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:39:07,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07 WrapperNode [2023-11-29 04:39:07,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:39:07,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:39:07,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:39:07,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:39:07,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,413 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2023-11-29 04:39:07,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:39:07,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:39:07,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:39:07,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:39:07,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,449 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 04:39:07,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:39:07,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:39:07,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:39:07,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:39:07,481 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (1/1) ... [2023-11-29 04:39:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:39:07,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:07,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:39:07,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:39:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:39:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:39:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:39:07,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:39:07,610 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:39:07,612 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:39:08,027 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:39:08,062 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:39:08,062 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 04:39:08,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:39:08 BoogieIcfgContainer [2023-11-29 04:39:08,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:39:08,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:39:08,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:39:08,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:39:08,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:39:07" (1/3) ... [2023-11-29 04:39:08,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2d3f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:39:08, skipping insertion in model container [2023-11-29 04:39:08,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:39:07" (2/3) ... [2023-11-29 04:39:08,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2d3f58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:39:08, skipping insertion in model container [2023-11-29 04:39:08,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:39:08" (3/3) ... [2023-11-29 04:39:08,072 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add-2.i [2023-11-29 04:39:08,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:39:08,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-29 04:39:08,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:39:08,162 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@542fcc70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:39:08,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-29 04:39:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 82 states have (on average 1.951219512195122) internal successors, (160), 123 states have internal predecessors, (160), 0 states have call successors, (0), 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-29 04:39:08,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:39:08,173 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:08,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:39:08,174 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-29 04:39:08,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash 337472, now seen corresponding path program 1 times [2023-11-29 04:39:08,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:08,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032700741] [2023-11-29 04:39:08,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:08,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:08,329 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-29 04:39:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032700741] [2023-11-29 04:39:08,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032700741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:08,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:39:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906541881] [2023-11-29 04:39:08,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:08,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:39:08,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:39:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:39:08,371 INFO L87 Difference]: Start difference. First operand has 124 states, 82 states have (on average 1.951219512195122) internal successors, (160), 123 states have internal predecessors, (160), 0 states have call successors, (0), 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 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-29 04:39:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:08,405 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2023-11-29 04:39:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:39:08,407 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-11-29 04:39:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:08,417 INFO L225 Difference]: With dead ends: 152 [2023-11-29 04:39:08,417 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 04:39:08,421 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-29 04:39:08,424 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:08,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:39:08,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 04:39:08,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-29 04:39:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 0 states have call successors, (0), 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-29 04:39:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-29 04:39:08,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 3 [2023-11-29 04:39:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:08,460 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-29 04:39:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 3.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-29 04:39:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-29 04:39:08,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 04:39:08,462 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:08,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:39:08,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:39:08,463 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-29 04:39:08,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash 618880512, now seen corresponding path program 1 times [2023-11-29 04:39:08,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:08,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978821753] [2023-11-29 04:39:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:08,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:08,632 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-29 04:39:08,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:08,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978821753] [2023-11-29 04:39:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978821753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:08,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:39:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182946407] [2023-11-29 04:39:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:08,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:39:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:39:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:39:08,636 INFO L87 Difference]: Start difference. First operand 76 states and 106 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-29 04:39:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:08,779 INFO L93 Difference]: Finished difference Result 160 states and 235 transitions. [2023-11-29 04:39:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:39:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2023-11-29 04:39:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:08,781 INFO L225 Difference]: With dead ends: 160 [2023-11-29 04:39:08,782 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 04:39:08,782 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-29 04:39:08,784 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:08,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 04:39:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-29 04:39:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 0 states have call successors, (0), 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-29 04:39:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2023-11-29 04:39:08,800 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 18 [2023-11-29 04:39:08,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:08,800 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2023-11-29 04:39:08,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-29 04:39:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2023-11-29 04:39:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:39:08,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:08,803 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] [2023-11-29 04:39:08,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:39:08,803 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-29 04:39:08,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1543432602, now seen corresponding path program 1 times [2023-11-29 04:39:08,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:08,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367683473] [2023-11-29 04:39:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:08,954 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-29 04:39:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367683473] [2023-11-29 04:39:08,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367683473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:08,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:08,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:39:08,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090866196] [2023-11-29 04:39:08,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:08,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:08,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:08,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:39:08,957 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-29 04:39:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:09,206 INFO L93 Difference]: Finished difference Result 229 states and 340 transitions. [2023-11-29 04:39:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:39:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-29 04:39:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:09,209 INFO L225 Difference]: With dead ends: 229 [2023-11-29 04:39:09,209 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 04:39:09,210 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-29 04:39:09,211 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 114 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:09,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 195 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:09,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 04:39:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-11-29 04:39:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 0 states have call successors, (0), 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-29 04:39:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-29 04:39:09,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 25 [2023-11-29 04:39:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:09,227 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-29 04:39:09,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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-29 04:39:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-29 04:39:09,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 04:39:09,230 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:09,230 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] [2023-11-29 04:39:09,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:39:09,231 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-29 04:39:09,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:09,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1457126148, now seen corresponding path program 1 times [2023-11-29 04:39:09,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:09,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097043888] [2023-11-29 04:39:09,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:09,365 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-29 04:39:09,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:09,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097043888] [2023-11-29 04:39:09,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097043888] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:09,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:09,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:39:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679772626] [2023-11-29 04:39:09,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:09,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:09,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:09,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:09,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:39:09,368 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-29 04:39:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:09,539 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2023-11-29 04:39:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 32 [2023-11-29 04:39:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:09,542 INFO L225 Difference]: With dead ends: 361 [2023-11-29 04:39:09,542 INFO L226 Difference]: Without dead ends: 259 [2023-11-29 04:39:09,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:39:09,544 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 140 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:09,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 347 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:09,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-29 04:39:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 139. [2023-11-29 04:39:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 0 states have call successors, (0), 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-29 04:39:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-11-29 04:39:09,560 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 32 [2023-11-29 04:39:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:09,560 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-11-29 04:39:09,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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-29 04:39:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-11-29 04:39:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 04:39:09,562 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:09,563 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] [2023-11-29 04:39:09,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:39:09,563 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-29 04:39:09,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 531249808, now seen corresponding path program 1 times [2023-11-29 04:39:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:09,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297335525] [2023-11-29 04:39:09,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:09,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:09,677 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-29 04:39:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:09,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297335525] [2023-11-29 04:39:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297335525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:09,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:09,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:39:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619776583] [2023-11-29 04:39:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:09,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:39:09,680 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-29 04:39:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:09,844 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2023-11-29 04:39:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 35 [2023-11-29 04:39:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:09,847 INFO L225 Difference]: With dead ends: 367 [2023-11-29 04:39:09,847 INFO L226 Difference]: Without dead ends: 265 [2023-11-29 04:39:09,848 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-29 04:39:09,849 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:09,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 337 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-29 04:39:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 152. [2023-11-29 04:39:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 0 states have call successors, (0), 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-29 04:39:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2023-11-29 04:39:09,863 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 35 [2023-11-29 04:39:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:09,864 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2023-11-29 04:39:09,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-29 04:39:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2023-11-29 04:39:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 04:39:09,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:09,866 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] [2023-11-29 04:39:09,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:39:09,867 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-29 04:39:09,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1222917471, now seen corresponding path program 1 times [2023-11-29 04:39:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360221718] [2023-11-29 04:39:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:10,017 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-29 04:39:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:10,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360221718] [2023-11-29 04:39:10,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360221718] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249451821] [2023-11-29 04:39:10,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:10,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:10,022 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:10,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:39:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:10,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:39:10,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:10,176 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-29 04:39:10,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249451821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-29 04:39:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35122789] [2023-11-29 04:39:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:10,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:10,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:10,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:39:10,179 INFO L87 Difference]: Start difference. First operand 152 states and 202 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:10,403 INFO L93 Difference]: Finished difference Result 305 states and 434 transitions. [2023-11-29 04:39:10,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:10,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 38 [2023-11-29 04:39:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:10,405 INFO L225 Difference]: With dead ends: 305 [2023-11-29 04:39:10,405 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 04:39:10,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-29 04:39:10,407 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 48 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:10,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 237 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 04:39:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2023-11-29 04:39:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.3131868131868132) internal successors, (239), 182 states have internal predecessors, (239), 0 states have call successors, (0), 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-29 04:39:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2023-11-29 04:39:10,420 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 38 [2023-11-29 04:39:10,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:10,420 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2023-11-29 04:39:10,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:10,421 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2023-11-29 04:39:10,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 04:39:10,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:10,422 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] [2023-11-29 04:39:10,434 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:10,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 04:39:10,628 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-29 04:39:10,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:10,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1793803865, now seen corresponding path program 1 times [2023-11-29 04:39:10,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:10,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499392518] [2023-11-29 04:39:10,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:10,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:10,781 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-29 04:39:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:10,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499392518] [2023-11-29 04:39:10,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499392518] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:10,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557503683] [2023-11-29 04:39:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:10,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:10,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:10,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:10,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:39:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:10,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:39:10,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:10,890 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-29 04:39:10,890 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557503683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:10,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-29 04:39:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135855777] [2023-11-29 04:39:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:10,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:10,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:10,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:10,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:10,892 INFO L87 Difference]: Start difference. First operand 183 states and 239 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:11,076 INFO L93 Difference]: Finished difference Result 367 states and 502 transitions. [2023-11-29 04:39:11,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:11,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 45 [2023-11-29 04:39:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:11,078 INFO L225 Difference]: With dead ends: 367 [2023-11-29 04:39:11,078 INFO L226 Difference]: Without dead ends: 236 [2023-11-29 04:39:11,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 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-29 04:39:11,079 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:11,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 237 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-29 04:39:11,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 208. [2023-11-29 04:39:11,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 207 states have internal predecessors, (268), 0 states have call successors, (0), 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-29 04:39:11,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2023-11-29 04:39:11,090 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 45 [2023-11-29 04:39:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:11,090 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2023-11-29 04:39:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2023-11-29 04:39:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 04:39:11,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:11,092 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] [2023-11-29 04:39:11,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:11,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:11,297 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-29 04:39:11,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1820882211, now seen corresponding path program 1 times [2023-11-29 04:39:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025865553] [2023-11-29 04:39:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:11,366 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-29 04:39:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025865553] [2023-11-29 04:39:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025865553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:11,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:39:11,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373379791] [2023-11-29 04:39:11,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:11,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:39:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:11,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:39:11,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:39:11,368 INFO L87 Difference]: Start difference. First operand 208 states and 268 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:11,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:11,380 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2023-11-29 04:39:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:39:11,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 52 [2023-11-29 04:39:11,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:11,382 INFO L225 Difference]: With dead ends: 253 [2023-11-29 04:39:11,382 INFO L226 Difference]: Without dead ends: 182 [2023-11-29 04:39:11,383 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-29 04:39:11,384 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:11,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 218 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:39:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-29 04:39:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-11-29 04:39:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 1.281767955801105) internal successors, (232), 181 states have internal predecessors, (232), 0 states have call successors, (0), 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-29 04:39:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2023-11-29 04:39:11,391 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 52 [2023-11-29 04:39:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:11,392 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2023-11-29 04:39:11,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-29 04:39:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2023-11-29 04:39:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:39:11,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:11,393 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] [2023-11-29 04:39:11,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:39:11,393 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-29 04:39:11,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash 684955625, now seen corresponding path program 1 times [2023-11-29 04:39:11,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:11,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213573099] [2023-11-29 04:39:11,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:11,590 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-29 04:39:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213573099] [2023-11-29 04:39:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213573099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:39:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246396990] [2023-11-29 04:39:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:11,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:39:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:11,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:39:11,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:39:11,593 INFO L87 Difference]: Start difference. First operand 182 states and 232 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-29 04:39:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:11,798 INFO L93 Difference]: Finished difference Result 496 states and 632 transitions. [2023-11-29 04:39:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:39:11,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 64 [2023-11-29 04:39:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:11,801 INFO L225 Difference]: With dead ends: 496 [2023-11-29 04:39:11,801 INFO L226 Difference]: Without dead ends: 364 [2023-11-29 04:39:11,802 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-29 04:39:11,802 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 149 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:11,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 287 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-29 04:39:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 224. [2023-11-29 04:39:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.2780269058295963) internal successors, (285), 223 states have internal predecessors, (285), 0 states have call successors, (0), 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-29 04:39:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2023-11-29 04:39:11,814 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 64 [2023-11-29 04:39:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:11,815 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2023-11-29 04:39:11,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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-29 04:39:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2023-11-29 04:39:11,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 04:39:11,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:11,816 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] [2023-11-29 04:39:11,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:39:11,816 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-29 04:39:11,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:11,817 INFO L85 PathProgramCache]: Analyzing trace with hash -251432026, now seen corresponding path program 1 times [2023-11-29 04:39:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908663470] [2023-11-29 04:39:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:11,955 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-29 04:39:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908663470] [2023-11-29 04:39:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908663470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:39:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43946122] [2023-11-29 04:39:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:11,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:11,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:11,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:39:11,958 INFO L87 Difference]: Start difference. First operand 224 states and 285 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 04:39:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:12,018 INFO L93 Difference]: Finished difference Result 506 states and 644 transitions. [2023-11-29 04:39:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 67 [2023-11-29 04:39:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:12,021 INFO L225 Difference]: With dead ends: 506 [2023-11-29 04:39:12,021 INFO L226 Difference]: Without dead ends: 332 [2023-11-29 04:39:12,021 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-29 04:39:12,022 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 67 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:12,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 322 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:39:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-29 04:39:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 246. [2023-11-29 04:39:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.3020408163265307) internal successors, (319), 245 states have internal predecessors, (319), 0 states have call successors, (0), 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-29 04:39:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 319 transitions. [2023-11-29 04:39:12,034 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 319 transitions. Word has length 67 [2023-11-29 04:39:12,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:12,035 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 319 transitions. [2023-11-29 04:39:12,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 04:39:12,035 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 319 transitions. [2023-11-29 04:39:12,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 04:39:12,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:12,036 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] [2023-11-29 04:39:12,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:39:12,036 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-29 04:39:12,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -555578320, now seen corresponding path program 1 times [2023-11-29 04:39:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210986561] [2023-11-29 04:39:12,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:12,229 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-29 04:39:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210986561] [2023-11-29 04:39:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210986561] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:12,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:12,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:39:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051083792] [2023-11-29 04:39:12,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:12,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:39:12,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:12,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:39:12,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:39:12,231 INFO L87 Difference]: Start difference. First operand 246 states and 319 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:12,524 INFO L93 Difference]: Finished difference Result 724 states and 939 transitions. [2023-11-29 04:39:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:39:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 73 [2023-11-29 04:39:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:12,528 INFO L225 Difference]: With dead ends: 724 [2023-11-29 04:39:12,528 INFO L226 Difference]: Without dead ends: 523 [2023-11-29 04:39:12,529 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-29 04:39:12,529 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 267 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:12,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 233 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-29 04:39:12,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 404. [2023-11-29 04:39:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 1.2878411910669976) internal successors, (519), 403 states have internal predecessors, (519), 0 states have call successors, (0), 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-29 04:39:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2023-11-29 04:39:12,551 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 73 [2023-11-29 04:39:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:12,551 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2023-11-29 04:39:12,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2023-11-29 04:39:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 04:39:12,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:12,553 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] [2023-11-29 04:39:12,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:39:12,553 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-29 04:39:12,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:12,554 INFO L85 PathProgramCache]: Analyzing trace with hash -580403948, now seen corresponding path program 1 times [2023-11-29 04:39:12,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:12,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943532450] [2023-11-29 04:39:12,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:12,657 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-29 04:39:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943532450] [2023-11-29 04:39:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943532450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:12,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486991457] [2023-11-29 04:39:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:12,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:12,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:12,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:39:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:12,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:39:12,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:12,810 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-29 04:39:12,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:12,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486991457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:12,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:12,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-29 04:39:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520047864] [2023-11-29 04:39:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:12,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:12,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:12,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:12,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:39:12,812 INFO L87 Difference]: Start difference. First operand 404 states and 519 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-29 04:39:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:12,939 INFO L93 Difference]: Finished difference Result 1084 states and 1386 transitions. [2023-11-29 04:39:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:12,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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 73 [2023-11-29 04:39:12,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:12,944 INFO L225 Difference]: With dead ends: 1084 [2023-11-29 04:39:12,944 INFO L226 Difference]: Without dead ends: 688 [2023-11-29 04:39:12,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 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-29 04:39:12,946 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 100 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:12,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 206 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-11-29 04:39:12,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 552. [2023-11-29 04:39:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.2776769509981851) internal successors, (704), 551 states have internal predecessors, (704), 0 states have call successors, (0), 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-29 04:39:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 704 transitions. [2023-11-29 04:39:12,972 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 704 transitions. Word has length 73 [2023-11-29 04:39:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:12,973 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 704 transitions. [2023-11-29 04:39:12,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 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-29 04:39:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 704 transitions. [2023-11-29 04:39:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 04:39:12,975 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:12,975 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] [2023-11-29 04:39:12,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:13,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:13,181 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-29 04:39:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1721762467, now seen corresponding path program 1 times [2023-11-29 04:39:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587330029] [2023-11-29 04:39:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:13,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:13,373 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-29 04:39:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:13,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587330029] [2023-11-29 04:39:13,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587330029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:13,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:13,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:39:13,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267797332] [2023-11-29 04:39:13,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:13,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:39:13,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:13,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:39:13,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:39:13,375 INFO L87 Difference]: Start difference. First operand 552 states and 704 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:13,660 INFO L93 Difference]: Finished difference Result 1384 states and 1752 transitions. [2023-11-29 04:39:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:39:13,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 73 [2023-11-29 04:39:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:13,665 INFO L225 Difference]: With dead ends: 1384 [2023-11-29 04:39:13,665 INFO L226 Difference]: Without dead ends: 835 [2023-11-29 04:39:13,666 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-29 04:39:13,667 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 284 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:13,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 257 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-11-29 04:39:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 693. [2023-11-29 04:39:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.2630057803468209) internal successors, (874), 692 states have internal predecessors, (874), 0 states have call successors, (0), 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-29 04:39:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 874 transitions. [2023-11-29 04:39:13,703 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 874 transitions. Word has length 73 [2023-11-29 04:39:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:13,704 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 874 transitions. [2023-11-29 04:39:13,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:13,704 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 874 transitions. [2023-11-29 04:39:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:39:13,706 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:13,706 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] [2023-11-29 04:39:13,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:39:13,706 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-29 04:39:13,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 696274990, now seen corresponding path program 1 times [2023-11-29 04:39:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579925523] [2023-11-29 04:39:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:13,914 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-29 04:39:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579925523] [2023-11-29 04:39:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579925523] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:39:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237429816] [2023-11-29 04:39:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:13,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:39:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:39:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:13,916 INFO L87 Difference]: Start difference. First operand 693 states and 874 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:14,325 INFO L93 Difference]: Finished difference Result 1775 states and 2224 transitions. [2023-11-29 04:39:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:39:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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 79 [2023-11-29 04:39:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:14,331 INFO L225 Difference]: With dead ends: 1775 [2023-11-29 04:39:14,332 INFO L226 Difference]: Without dead ends: 1007 [2023-11-29 04:39:14,333 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-29 04:39:14,334 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 289 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:14,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 354 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:39:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-29 04:39:14,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 823. [2023-11-29 04:39:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 822 states have (on average 1.2652068126520681) internal successors, (1040), 822 states have internal predecessors, (1040), 0 states have call successors, (0), 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-29 04:39:14,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1040 transitions. [2023-11-29 04:39:14,398 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1040 transitions. Word has length 79 [2023-11-29 04:39:14,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:14,398 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1040 transitions. [2023-11-29 04:39:14,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 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-29 04:39:14,399 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1040 transitions. [2023-11-29 04:39:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:39:14,401 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:14,401 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] [2023-11-29 04:39:14,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:39:14,402 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-29 04:39:14,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:14,402 INFO L85 PathProgramCache]: Analyzing trace with hash -153420808, now seen corresponding path program 1 times [2023-11-29 04:39:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271391028] [2023-11-29 04:39:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:14,578 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-29 04:39:14,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271391028] [2023-11-29 04:39:14,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271391028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:14,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803371519] [2023-11-29 04:39:14,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:14,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:14,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:14,581 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:14,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:39:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:14,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:39:14,662 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:14,755 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-29 04:39:14,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:39:14,833 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-29 04:39:14,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803371519] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:39:14,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:39:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-29 04:39:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660937206] [2023-11-29 04:39:14,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:39:14,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:39:14,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:14,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:39:14,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:39:14,835 INFO L87 Difference]: Start difference. First operand 823 states and 1040 transitions. Second operand has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:39:16,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:16,394 INFO L93 Difference]: Finished difference Result 4951 states and 6119 transitions. [2023-11-29 04:39:16,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 04:39:16,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2023-11-29 04:39:16,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:16,412 INFO L225 Difference]: With dead ends: 4951 [2023-11-29 04:39:16,412 INFO L226 Difference]: Without dead ends: 4009 [2023-11-29 04:39:16,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=531, Invalid=2225, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 04:39:16,416 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 928 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:16,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1007 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:39:16,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2023-11-29 04:39:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 1076. [2023-11-29 04:39:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 1075 states have (on average 1.4074418604651162) internal successors, (1513), 1075 states have internal predecessors, (1513), 0 states have call successors, (0), 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-29 04:39:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1513 transitions. [2023-11-29 04:39:16,477 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1513 transitions. Word has length 79 [2023-11-29 04:39:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:16,477 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1513 transitions. [2023-11-29 04:39:16,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.333333333333334) internal successors, (111), 10 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:39:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1513 transitions. [2023-11-29 04:39:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:39:16,479 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:16,479 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] [2023-11-29 04:39:16,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 04:39:16,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 04:39:16,680 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-29 04:39:16,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash 98242463, now seen corresponding path program 1 times [2023-11-29 04:39:16,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:16,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229901454] [2023-11-29 04:39:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:16,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:16,879 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-29 04:39:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229901454] [2023-11-29 04:39:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229901454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:39:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088816525] [2023-11-29 04:39:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:16,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:39:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:39:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:16,881 INFO L87 Difference]: Start difference. First operand 1076 states and 1513 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-29 04:39:17,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:17,298 INFO L93 Difference]: Finished difference Result 2469 states and 3453 transitions. [2023-11-29 04:39:17,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:39:17,299 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 79 [2023-11-29 04:39:17,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:17,307 INFO L225 Difference]: With dead ends: 2469 [2023-11-29 04:39:17,308 INFO L226 Difference]: Without dead ends: 1377 [2023-11-29 04:39:17,309 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-29 04:39:17,310 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 369 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:17,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 304 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:39:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-11-29 04:39:17,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1236. [2023-11-29 04:39:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.411336032388664) internal successors, (1743), 1235 states have internal predecessors, (1743), 0 states have call successors, (0), 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-29 04:39:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 04:39:17,378 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 79 [2023-11-29 04:39:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:17,378 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 04:39:17,379 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-29 04:39:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 04:39:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:39:17,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:17,381 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] [2023-11-29 04:39:17,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:39:17,382 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-29 04:39:17,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -63426306, now seen corresponding path program 1 times [2023-11-29 04:39:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350316773] [2023-11-29 04:39:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:17,555 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-29 04:39:17,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:17,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350316773] [2023-11-29 04:39:17,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350316773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:17,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:17,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:39:17,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099651429] [2023-11-29 04:39:17,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:17,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:39:17,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:39:17,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:39:17,557 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 04:39:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:17,911 INFO L93 Difference]: Finished difference Result 3873 states and 5447 transitions. [2023-11-29 04:39:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:39:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 85 [2023-11-29 04:39:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:17,934 INFO L225 Difference]: With dead ends: 3873 [2023-11-29 04:39:17,934 INFO L226 Difference]: Without dead ends: 3688 [2023-11-29 04:39:17,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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-29 04:39:17,937 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 271 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:17,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 513 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2023-11-29 04:39:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 1236. [2023-11-29 04:39:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.411336032388664) internal successors, (1743), 1235 states have internal predecessors, (1743), 0 states have call successors, (0), 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-29 04:39:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 04:39:18,067 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-29 04:39:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:18,067 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 04:39:18,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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-29 04:39:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 04:39:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:39:18,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:18,070 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] [2023-11-29 04:39:18,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 04:39:18,071 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-29 04:39:18,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1996327789, now seen corresponding path program 1 times [2023-11-29 04:39:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483058435] [2023-11-29 04:39:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:18,241 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 04:39:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:18,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483058435] [2023-11-29 04:39:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483058435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:18,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:18,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:39:18,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964010807] [2023-11-29 04:39:18,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:18,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:39:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:39:18,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:39:18,244 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:39:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:18,607 INFO L93 Difference]: Finished difference Result 3865 states and 5435 transitions. [2023-11-29 04:39:18,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:39:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2023-11-29 04:39:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:18,628 INFO L225 Difference]: With dead ends: 3865 [2023-11-29 04:39:18,628 INFO L226 Difference]: Without dead ends: 3671 [2023-11-29 04:39:18,630 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-29 04:39:18,630 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 233 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:18,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 463 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:39:18,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2023-11-29 04:39:18,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1236. [2023-11-29 04:39:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.411336032388664) internal successors, (1743), 1235 states have internal predecessors, (1743), 0 states have call successors, (0), 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-29 04:39:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 04:39:18,748 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-29 04:39:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:18,748 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 04:39:18,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:39:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 04:39:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:39:18,752 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:18,752 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] [2023-11-29 04:39:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:39:18,752 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-29 04:39:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1662703805, now seen corresponding path program 1 times [2023-11-29 04:39:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32700163] [2023-11-29 04:39:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:18,936 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-29 04:39:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32700163] [2023-11-29 04:39:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32700163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:39:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455862773] [2023-11-29 04:39:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:39:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:18,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:39:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:39:18,938 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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-29 04:39:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:19,456 INFO L93 Difference]: Finished difference Result 5107 states and 7183 transitions. [2023-11-29 04:39:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:39:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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 88 [2023-11-29 04:39:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:19,476 INFO L225 Difference]: With dead ends: 5107 [2023-11-29 04:39:19,476 INFO L226 Difference]: Without dead ends: 4922 [2023-11-29 04:39:19,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:19,477 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 407 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:19,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 878 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:39:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4922 states. [2023-11-29 04:39:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4922 to 1236. [2023-11-29 04:39:19,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.411336032388664) internal successors, (1743), 1235 states have internal predecessors, (1743), 0 states have call successors, (0), 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-29 04:39:19,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 04:39:19,562 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 88 [2023-11-29 04:39:19,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:19,562 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 04:39:19,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 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-29 04:39:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 04:39:19,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:39:19,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:19,564 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] [2023-11-29 04:39:19,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 04:39:19,565 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-29 04:39:19,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1658301453, now seen corresponding path program 1 times [2023-11-29 04:39:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:19,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796985290] [2023-11-29 04:39:19,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 04:39:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796985290] [2023-11-29 04:39:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796985290] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:39:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219829617] [2023-11-29 04:39:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:19,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:39:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:39:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:39:19,728 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 04:39:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:20,277 INFO L93 Difference]: Finished difference Result 5089 states and 7158 transitions. [2023-11-29 04:39:20,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:39:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 88 [2023-11-29 04:39:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:20,301 INFO L225 Difference]: With dead ends: 5089 [2023-11-29 04:39:20,301 INFO L226 Difference]: Without dead ends: 4895 [2023-11-29 04:39:20,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:20,304 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 349 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:20,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 776 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:39:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2023-11-29 04:39:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 1236. [2023-11-29 04:39:20,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 1235 states have (on average 1.411336032388664) internal successors, (1743), 1235 states have internal predecessors, (1743), 0 states have call successors, (0), 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-29 04:39:20,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 04:39:20,397 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 88 [2023-11-29 04:39:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:20,397 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 04:39:20,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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-29 04:39:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 04:39:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:39:20,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:20,399 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] [2023-11-29 04:39:20,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 04:39:20,399 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-29 04:39:20,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash -697419044, now seen corresponding path program 1 times [2023-11-29 04:39:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889679342] [2023-11-29 04:39:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:20,545 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-29 04:39:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889679342] [2023-11-29 04:39:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889679342] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870826809] [2023-11-29 04:39:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:20,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:20,546 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:20,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:39:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:20,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:39:20,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:20,682 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-29 04:39:20,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:39:20,825 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-29 04:39:20,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870826809] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:39:20,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:39:20,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2023-11-29 04:39:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416975161] [2023-11-29 04:39:20,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:39:20,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:39:20,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:20,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:39:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:39:20,828 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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-29 04:39:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:21,805 INFO L93 Difference]: Finished difference Result 4765 states and 6973 transitions. [2023-11-29 04:39:21,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 04:39:21,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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 88 [2023-11-29 04:39:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:21,812 INFO L225 Difference]: With dead ends: 4765 [2023-11-29 04:39:21,812 INFO L226 Difference]: Without dead ends: 3545 [2023-11-29 04:39:21,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 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-29 04:39:21,815 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 643 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:21,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 537 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:39:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2023-11-29 04:39:22,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2694. [2023-11-29 04:39:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.317489788340141) internal successors, (3548), 2693 states have internal predecessors, (3548), 0 states have call successors, (0), 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-29 04:39:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3548 transitions. [2023-11-29 04:39:22,115 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3548 transitions. Word has length 88 [2023-11-29 04:39:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:22,116 INFO L495 AbstractCegarLoop]: Abstraction has 2694 states and 3548 transitions. [2023-11-29 04:39:22,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 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-29 04:39:22,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3548 transitions. [2023-11-29 04:39:22,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:39:22,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:22,119 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] [2023-11-29 04:39:22,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:39:22,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:22,320 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-29 04:39:22,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash 373515176, now seen corresponding path program 1 times [2023-11-29 04:39:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:22,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203101267] [2023-11-29 04:39:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:22,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:22,496 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-29 04:39:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203101267] [2023-11-29 04:39:22,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203101267] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210126757] [2023-11-29 04:39:22,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:22,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:22,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:22,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:22,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:39:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:22,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:39:22,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:22,644 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-29 04:39:22,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210126757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-29 04:39:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123840956] [2023-11-29 04:39:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:22,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:22,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:22,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:22,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:22,647 INFO L87 Difference]: Start difference. First operand 2694 states and 3548 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-29 04:39:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:23,019 INFO L93 Difference]: Finished difference Result 5710 states and 7502 transitions. [2023-11-29 04:39:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 88 [2023-11-29 04:39:23,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:23,027 INFO L225 Difference]: With dead ends: 5710 [2023-11-29 04:39:23,027 INFO L226 Difference]: Without dead ends: 5263 [2023-11-29 04:39:23,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-29 04:39:23,029 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 74 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:23,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 193 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:23,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2023-11-29 04:39:23,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4330. [2023-11-29 04:39:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4330 states, 4329 states have (on average 1.320859320859321) internal successors, (5718), 4329 states have internal predecessors, (5718), 0 states have call successors, (0), 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-29 04:39:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4330 states to 4330 states and 5718 transitions. [2023-11-29 04:39:23,340 INFO L78 Accepts]: Start accepts. Automaton has 4330 states and 5718 transitions. Word has length 88 [2023-11-29 04:39:23,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:23,340 INFO L495 AbstractCegarLoop]: Abstraction has 4330 states and 5718 transitions. [2023-11-29 04:39:23,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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-29 04:39:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4330 states and 5718 transitions. [2023-11-29 04:39:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:39:23,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:23,345 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, 1] [2023-11-29 04:39:23,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:39:23,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 04:39:23,545 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-29 04:39:23,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1260045287, now seen corresponding path program 1 times [2023-11-29 04:39:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285846911] [2023-11-29 04:39:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:23,705 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-29 04:39:23,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:23,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285846911] [2023-11-29 04:39:23,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285846911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:23,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:23,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:39:23,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243037083] [2023-11-29 04:39:23,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:23,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:39:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:39:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:23,707 INFO L87 Difference]: Start difference. First operand 4330 states and 5718 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 04:39:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:24,599 INFO L93 Difference]: Finished difference Result 9901 states and 13117 transitions. [2023-11-29 04:39:24,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:39:24,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 90 [2023-11-29 04:39:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:24,613 INFO L225 Difference]: With dead ends: 9901 [2023-11-29 04:39:24,613 INFO L226 Difference]: Without dead ends: 9661 [2023-11-29 04:39:24,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:39:24,616 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 513 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:24,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1249 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:39:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9661 states. [2023-11-29 04:39:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9661 to 4309. [2023-11-29 04:39:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4309 states, 4308 states have (on average 1.3210306406685237) internal successors, (5691), 4308 states have internal predecessors, (5691), 0 states have call successors, (0), 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-29 04:39:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 5691 transitions. [2023-11-29 04:39:24,985 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 5691 transitions. Word has length 90 [2023-11-29 04:39:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 4309 states and 5691 transitions. [2023-11-29 04:39:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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-29 04:39:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 5691 transitions. [2023-11-29 04:39:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:39:24,988 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:24,988 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, 1] [2023-11-29 04:39:24,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 04:39:24,988 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-29 04:39:24,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1756000503, now seen corresponding path program 1 times [2023-11-29 04:39:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:24,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972247753] [2023-11-29 04:39:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 04:39:25,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972247753] [2023-11-29 04:39:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972247753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:25,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:39:25,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:39:25,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683395110] [2023-11-29 04:39:25,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:25,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:39:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:39:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:39:25,152 INFO L87 Difference]: Start difference. First operand 4309 states and 5691 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-29 04:39:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:26,124 INFO L93 Difference]: Finished difference Result 11021 states and 14448 transitions. [2023-11-29 04:39:26,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:39:26,124 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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 90 [2023-11-29 04:39:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:26,143 INFO L225 Difference]: With dead ends: 11021 [2023-11-29 04:39:26,143 INFO L226 Difference]: Without dead ends: 10630 [2023-11-29 04:39:26,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:39:26,146 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 427 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:26,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1078 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:39:26,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10630 states. [2023-11-29 04:39:26,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10630 to 4297. [2023-11-29 04:39:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 4296 states have (on average 1.321927374301676) internal successors, (5679), 4296 states have internal predecessors, (5679), 0 states have call successors, (0), 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-29 04:39:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5679 transitions. [2023-11-29 04:39:26,526 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5679 transitions. Word has length 90 [2023-11-29 04:39:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:26,526 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5679 transitions. [2023-11-29 04:39:26,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-29 04:39:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5679 transitions. [2023-11-29 04:39:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-29 04:39:26,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:26,531 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] [2023-11-29 04:39:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 04:39:26,531 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-29 04:39:26,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1509929057, now seen corresponding path program 1 times [2023-11-29 04:39:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159308059] [2023-11-29 04:39:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:26,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:39:26,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159308059] [2023-11-29 04:39:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159308059] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:26,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220224096] [2023-11-29 04:39:26,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:26,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:26,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:26,715 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:26,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:39:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:26,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:39:26,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:26,997 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-29 04:39:26,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:26,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220224096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:26,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:26,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-11-29 04:39:26,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614295688] [2023-11-29 04:39:26,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:26,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:39:26,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:26,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:39:26,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:26,999 INFO L87 Difference]: Start difference. First operand 4297 states and 5679 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 04:39:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:27,518 INFO L93 Difference]: Finished difference Result 8219 states and 10792 transitions. [2023-11-29 04:39:27,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:39:27,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 04:39:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:27,528 INFO L225 Difference]: With dead ends: 8219 [2023-11-29 04:39:27,529 INFO L226 Difference]: Without dead ends: 7772 [2023-11-29 04:39:27,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:27,531 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:27,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 396 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7772 states. [2023-11-29 04:39:27,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7772 to 4297. [2023-11-29 04:39:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 4296 states have (on average 1.321927374301676) internal successors, (5679), 4296 states have internal predecessors, (5679), 0 states have call successors, (0), 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-29 04:39:27,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5679 transitions. [2023-11-29 04:39:27,801 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5679 transitions. Word has length 91 [2023-11-29 04:39:27,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:27,801 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5679 transitions. [2023-11-29 04:39:27,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 04:39:27,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5679 transitions. [2023-11-29 04:39:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 04:39:27,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:27,805 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] [2023-11-29 04:39:27,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:28,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 04:39:28,005 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-29 04:39:28,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 775176431, now seen corresponding path program 1 times [2023-11-29 04:39:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470911057] [2023-11-29 04:39:28,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:28,200 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-29 04:39:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:28,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470911057] [2023-11-29 04:39:28,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470911057] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280024400] [2023-11-29 04:39:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:28,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:28,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:28,202 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:28,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:39:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:28,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 04:39:28,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:28,477 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-29 04:39:28,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:39:28,603 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-29 04:39:28,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280024400] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:39:28,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:39:28,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-11-29 04:39:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937992439] [2023-11-29 04:39:28,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:39:28,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:39:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:39:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:39:28,606 INFO L87 Difference]: Start difference. First operand 4297 states and 5679 transitions. Second operand has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 12 states have internal predecessors, (144), 0 states have call successors, (0), 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-29 04:39:29,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:29,844 INFO L93 Difference]: Finished difference Result 12622 states and 16811 transitions. [2023-11-29 04:39:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:39:29,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 12 states have internal predecessors, (144), 0 states have call successors, (0), 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 94 [2023-11-29 04:39:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:29,853 INFO L225 Difference]: With dead ends: 12622 [2023-11-29 04:39:29,853 INFO L226 Difference]: Without dead ends: 8383 [2023-11-29 04:39:29,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2023-11-29 04:39:29,857 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 719 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 1399 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:29,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 1399 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:39:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2023-11-29 04:39:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 3663. [2023-11-29 04:39:30,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3663 states, 3662 states have (on average 1.2523211359912616) internal successors, (4586), 3662 states have internal predecessors, (4586), 0 states have call successors, (0), 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-29 04:39:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3663 states to 3663 states and 4586 transitions. [2023-11-29 04:39:30,243 INFO L78 Accepts]: Start accepts. Automaton has 3663 states and 4586 transitions. Word has length 94 [2023-11-29 04:39:30,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:30,243 INFO L495 AbstractCegarLoop]: Abstraction has 3663 states and 4586 transitions. [2023-11-29 04:39:30,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.076923076923077) internal successors, (144), 12 states have internal predecessors, (144), 0 states have call successors, (0), 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-29 04:39:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3663 states and 4586 transitions. [2023-11-29 04:39:30,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 04:39:30,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:30,246 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] [2023-11-29 04:39:30,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:30,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 04:39:30,447 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-29 04:39:30,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:30,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1820845147, now seen corresponding path program 1 times [2023-11-29 04:39:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:30,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343561662] [2023-11-29 04:39:30,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:30,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 04:39:30,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343561662] [2023-11-29 04:39:30,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343561662] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:30,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530981369] [2023-11-29 04:39:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:30,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:30,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:30,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 04:39:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:30,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:39:30,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:31,070 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-29 04:39:31,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530981369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2023-11-29 04:39:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363992928] [2023-11-29 04:39:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:31,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:39:31,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:31,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:39:31,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:39:31,072 INFO L87 Difference]: Start difference. First operand 3663 states and 4586 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-29 04:39:31,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:31,696 INFO L93 Difference]: Finished difference Result 9508 states and 11806 transitions. [2023-11-29 04:39:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:39:31,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 94 [2023-11-29 04:39:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:31,704 INFO L225 Difference]: With dead ends: 9508 [2023-11-29 04:39:31,705 INFO L226 Difference]: Without dead ends: 7087 [2023-11-29 04:39:31,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:39:31,709 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 206 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:31,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 644 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7087 states. [2023-11-29 04:39:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7087 to 3671. [2023-11-29 04:39:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3670 states have (on average 1.2517711171662125) internal successors, (4594), 3670 states have internal predecessors, (4594), 0 states have call successors, (0), 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-29 04:39:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 4594 transitions. [2023-11-29 04:39:32,045 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 4594 transitions. Word has length 94 [2023-11-29 04:39:32,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:32,045 INFO L495 AbstractCegarLoop]: Abstraction has 3671 states and 4594 transitions. [2023-11-29 04:39:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-29 04:39:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 4594 transitions. [2023-11-29 04:39:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 04:39:32,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:32,048 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] [2023-11-29 04:39:32,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 04:39:32,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 04:39:32,248 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-29 04:39:32,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1113190354, now seen corresponding path program 1 times [2023-11-29 04:39:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866011522] [2023-11-29 04:39:32,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:32,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:32,383 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-29 04:39:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:39:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866011522] [2023-11-29 04:39:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866011522] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:39:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082163701] [2023-11-29 04:39:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:32,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:39:32,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:39:32,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:39:32,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 04:39:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:32,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:39:32,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:39:32,532 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-29 04:39:32,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:39:32,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082163701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:39:32,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:39:32,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-29 04:39:32,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367180774] [2023-11-29 04:39:32,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:39:32,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:39:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:39:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:39:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:32,534 INFO L87 Difference]: Start difference. First operand 3671 states and 4594 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 04:39:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:39:32,999 INFO L93 Difference]: Finished difference Result 6150 states and 7662 transitions. [2023-11-29 04:39:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:39:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 94 [2023-11-29 04:39:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:39:33,003 INFO L225 Difference]: With dead ends: 6150 [2023-11-29 04:39:33,003 INFO L226 Difference]: Without dead ends: 5675 [2023-11-29 04:39:33,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:39:33,005 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:39:33,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 184 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:39:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5675 states. [2023-11-29 04:39:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5675 to 4764. [2023-11-29 04:39:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4764 states, 4763 states have (on average 1.2565609909720765) internal successors, (5985), 4763 states have internal predecessors, (5985), 0 states have call successors, (0), 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-29 04:39:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4764 states to 4764 states and 5985 transitions. [2023-11-29 04:39:33,345 INFO L78 Accepts]: Start accepts. Automaton has 4764 states and 5985 transitions. Word has length 94 [2023-11-29 04:39:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:39:33,345 INFO L495 AbstractCegarLoop]: Abstraction has 4764 states and 5985 transitions. [2023-11-29 04:39:33,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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-29 04:39:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 4764 states and 5985 transitions. [2023-11-29 04:39:33,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-29 04:39:33,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:39:33,349 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] [2023-11-29 04:39:33,354 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 04:39:33,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 04:39:33,550 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2023-11-29 04:39:33,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:39:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1943687349, now seen corresponding path program 1 times [2023-11-29 04:39:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:39:33,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395903754] [2023-11-29 04:39:33,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:39:33,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:39:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:39:33,600 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:39:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:39:33,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:39:33,668 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:39:33,669 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-29 04:39:33,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-29 04:39:33,671 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-29 04:39:33,672 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-29 04:39:33,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-29 04:39:33,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-29 04:39:33,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-29 04:39:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-29 04:39:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-29 04:39:33,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-29 04:39:33,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 04:39:33,679 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, 1] [2023-11-29 04:39:33,684 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:39:33,739 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 04:39:33,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,740 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 04:39:33,741 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:39:33 BoogieIcfgContainer [2023-11-29 04:39:33,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:39:33,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:39:33,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:39:33,761 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:39:33,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:39:08" (3/4) ... [2023-11-29 04:39:33,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 04:39:33,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,784 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 04:39:33,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 04:39:33,785 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 04:39:33,856 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:39:33,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:39:33,857 INFO L158 Benchmark]: Toolchain (without parser) took 26813.27ms. Allocated memory was 115.3MB in the beginning and 671.1MB in the end (delta: 555.7MB). Free memory was 49.9MB in the beginning and 495.2MB in the end (delta: -445.3MB). Peak memory consumption was 113.0MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,857 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 115.3MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:39:33,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.05ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 49.6MB in the beginning and 147.3MB in the end (delta: -97.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.35ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 144.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,858 INFO L158 Benchmark]: Boogie Preprocessor took 65.18ms. Allocated memory is still 178.3MB. Free memory was 143.1MB in the beginning and 140.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,859 INFO L158 Benchmark]: RCFGBuilder took 583.15ms. Allocated memory is still 178.3MB. Free memory was 140.1MB in the beginning and 128.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,859 INFO L158 Benchmark]: TraceAbstraction took 25695.40ms. Allocated memory was 178.3MB in the beginning and 671.1MB in the end (delta: 492.8MB). Free memory was 127.1MB in the beginning and 503.5MB in the end (delta: -376.4MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,859 INFO L158 Benchmark]: Witness Printer took 95.45ms. Allocated memory is still 671.1MB. Free memory was 503.5MB in the beginning and 495.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 04:39:33,861 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17ms. Allocated memory is still 115.3MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 308.05ms. Allocated memory was 115.3MB in the beginning and 178.3MB in the end (delta: 62.9MB). Free memory was 49.6MB in the beginning and 147.3MB in the end (delta: -97.7MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.35ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 144.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.18ms. Allocated memory is still 178.3MB. Free memory was 143.1MB in the beginning and 140.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 583.15ms. Allocated memory is still 178.3MB. Free memory was 140.1MB in the beginning and 128.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 25695.40ms. Allocated memory was 178.3MB in the beginning and 671.1MB in the end (delta: 492.8MB). Free memory was 127.1MB in the beginning and 503.5MB in the end (delta: -376.4MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * Witness Printer took 95.45ms. Allocated memory is still 671.1MB. Free memory was 503.5MB in the beginning and 495.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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; [L126] a = __VERIFIER_nondet_uint() [L127] b = __VERIFIER_nondet_uint() [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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=4] [L59] COND TRUE a3 == (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=4] [L60] EXPR na - 1 [L60] na = na - 1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=3] [L61] COND TRUE a2 == (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=3] [L62] EXPR na - 1 [L62] na = na - 1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=2] [L63] COND TRUE a1 == (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=2] [L64] EXPR na - 1 [L64] na = na - 1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=1] [L68] nb = (unsigned char)4 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=1, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, na=1, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L89] COND TRUE i < nb VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=1] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=0, na=1, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=0, na=1, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=0, na=1, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L83] COND FALSE !(i < na) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=1, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=1, na=1, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=1, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND FALSE !(i < na) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=1, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=2, na=1, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)254) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=2, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=1, i=3, na=1, 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)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND FALSE !(i < na) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)254)) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=3, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r1 << 8U VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] EXPR r2 << 16U VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] [L116] r3 << 24U VAL [\old(a)=1, \old(b)=2147483647, a0=4294967297, a1=0, a2=0, a3=0, a=1, b0=2147483647, b1=8388607, b2=32767, b3=127, b=2147483647, carry=0, i=4, na=1, nb=4, partial_sum=128, r0=0, r1=0, r2=0, r3=128] - 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, 124 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7015 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7015 mSDsluCounter, 13104 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9352 mSDsCounter, 444 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7147 IncrementalHoareTripleChecker+Invalid, 7591 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 444 mSolverCounterUnsat, 3752 mSDtfsCounter, 7147 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1374 GetRequests, 1137 SyntacticMatches, 7 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4764occurred in iteration=28, InterpolantAutomatonStates: 235, 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, 28 MinimizatonAttempts, 42439 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2790 NumberOfCodeBlocks, 2790 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 2914 ConstructedInterpolants, 0 QuantifiedInterpolants, 9135 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1776 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 41 InterpolantComputations, 25 PerfectInterpolantSequences, 2490/2671 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-29 04:39:33,885 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d032ff25-ae02-41fc-bd6d-8bf1190e40b0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)