./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 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_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/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_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/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_04a3bee6-476b-4c01-9528-93876b10ecf8/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 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:33:58,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:33:58,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 00:33:58,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:33:58,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:33:58,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:33:58,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:33:58,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:33:58,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:33:58,888 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:33:58,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:33:58,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:33:58,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:33:58,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:33:58,890 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:33:58,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:33:58,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:33:58,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:33:58,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:33:58,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:33:58,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:33:58,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:33:58,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:33:58,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:33:58,897 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 00:33:58,897 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 00:33:58,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:33:58,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:33:58,898 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:33:58,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:33:58,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:33:58,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:33:58,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:33:58,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:33:58,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:33:58,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:33:58,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:33:58,901 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:33:58,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:33:58,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:33:58,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:33:58,902 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:33:58,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:33:58,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:33:58,902 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_04a3bee6-476b-4c01-9528-93876b10ecf8/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_04a3bee6-476b-4c01-9528-93876b10ecf8/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 -> 8b7afe619831a9e012e7620d6e0b03d3495f1fd3efb2bdea6bfa4bb1568774e6 [2023-11-29 00:33:59,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:33:59,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:33:59,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:33:59,167 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:33:59,167 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:33:59,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-29 00:34:01,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:34:02,109 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:34:02,110 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/sv-benchmarks/c/bitvector/byte_add_2-1.i [2023-11-29 00:34:02,118 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/data/0cf9cbb69/21a20b1daa654382a957b695d8c60620/FLAGd2d4cd9a0 [2023-11-29 00:34:02,132 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/data/0cf9cbb69/21a20b1daa654382a957b695d8c60620 [2023-11-29 00:34:02,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:34:02,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:34:02,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:34:02,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:34:02,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:34:02,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae44608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02, skipping insertion in model container [2023-11-29 00:34:02,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,170 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:34:02,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:34:02,357 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:34:02,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:34:02,408 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:34:02,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02 WrapperNode [2023-11-29 00:34:02,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:34:02,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:34:02,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:34:02,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:34:02,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,466 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2023-11-29 00:34:02,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:34:02,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:34:02,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:34:02,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:34:02,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,500 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 00:34:02,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:34:02,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:34:02,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:34:02,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:34:02,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (1/1) ... [2023-11-29 00:34:02,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:34:02,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:02,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:34:02,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:34:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:34:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:34:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:34:02,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:34:02,666 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:34:02,668 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:34:03,045 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:34:03,076 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:34:03,076 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:34:03,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:03 BoogieIcfgContainer [2023-11-29 00:34:03,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:34:03,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:34:03,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:34:03,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:34:03,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:34:02" (1/3) ... [2023-11-29 00:34:03,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b307a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:34:03, skipping insertion in model container [2023-11-29 00:34:03,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:34:02" (2/3) ... [2023-11-29 00:34:03,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b307a49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:34:03, skipping insertion in model container [2023-11-29 00:34:03,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:03" (3/3) ... [2023-11-29 00:34:03,086 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_2-1.i [2023-11-29 00:34:03,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:34:03,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-29 00:34:03,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:34:03,157 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;@229e2cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:34:03,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-29 00:34:03,162 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 00:34:03,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 00:34:03,168 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:03,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 00:34:03,169 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 00:34:03,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:03,175 INFO L85 PathProgramCache]: Analyzing trace with hash 337472, now seen corresponding path program 1 times [2023-11-29 00:34:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511945333] [2023-11-29 00:34:03,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:03,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:03,330 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 00:34:03,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511945333] [2023-11-29 00:34:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511945333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 00:34:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751247425] [2023-11-29 00:34:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:03,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:34:03,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:03,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:34:03,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:34:03,383 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 00:34:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:03,416 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2023-11-29 00:34:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:34:03,419 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 00:34:03,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:03,426 INFO L225 Difference]: With dead ends: 152 [2023-11-29 00:34:03,426 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 00:34:03,429 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 00:34:03,433 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 00:34:03,434 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 00:34:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 00:34:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-29 00:34:03,462 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 00:34:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-29 00:34:03,465 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 3 [2023-11-29 00:34:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:03,466 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-29 00:34:03,466 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 00:34:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-29 00:34:03,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 00:34:03,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:03,468 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 00:34:03,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:34:03,469 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 00:34:03,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 618880512, now seen corresponding path program 1 times [2023-11-29 00:34:03,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:03,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859437118] [2023-11-29 00:34:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:03,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:03,635 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 00:34:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859437118] [2023-11-29 00:34:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859437118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:03,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:03,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:34:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895448483] [2023-11-29 00:34:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:34:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:34:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:34:03,639 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 00:34:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:03,784 INFO L93 Difference]: Finished difference Result 160 states and 235 transitions. [2023-11-29 00:34:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:34:03,785 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 00:34:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:03,787 INFO L225 Difference]: With dead ends: 160 [2023-11-29 00:34:03,787 INFO L226 Difference]: Without dead ends: 105 [2023-11-29 00:34:03,788 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 00:34:03,789 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 00:34:03,790 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 00:34:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-29 00:34:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-29 00:34:03,800 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 00:34:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2023-11-29 00:34:03,802 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 18 [2023-11-29 00:34:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:03,803 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2023-11-29 00:34:03,803 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 00:34:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2023-11-29 00:34:03,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 00:34:03,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:03,805 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 00:34:03,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:34:03,805 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 00:34:03,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:03,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1543432602, now seen corresponding path program 1 times [2023-11-29 00:34:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509763071] [2023-11-29 00:34:03,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:03,959 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 00:34:03,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509763071] [2023-11-29 00:34:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509763071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:34:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839981133] [2023-11-29 00:34:03,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:03,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:03,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:34:03,963 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 00:34:04,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:04,218 INFO L93 Difference]: Finished difference Result 229 states and 340 transitions. [2023-11-29 00:34:04,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:34:04,218 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 00:34:04,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:04,220 INFO L225 Difference]: With dead ends: 229 [2023-11-29 00:34:04,221 INFO L226 Difference]: Without dead ends: 174 [2023-11-29 00:34:04,221 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 00:34:04,223 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 00:34:04,224 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 00:34:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-29 00:34:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-11-29 00:34:04,237 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 00:34:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-29 00:34:04,239 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 25 [2023-11-29 00:34:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:04,240 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-29 00:34:04,240 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 00:34:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-29 00:34:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 00:34:04,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:04,242 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 00:34:04,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:34:04,243 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 00:34:04,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1457126148, now seen corresponding path program 1 times [2023-11-29 00:34:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540687119] [2023-11-29 00:34:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:04,386 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 00:34:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540687119] [2023-11-29 00:34:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540687119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:34:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236195782] [2023-11-29 00:34:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:04,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:04,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:04,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:34:04,389 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 00:34:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:04,558 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2023-11-29 00:34:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:04,559 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 00:34:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:04,561 INFO L225 Difference]: With dead ends: 361 [2023-11-29 00:34:04,561 INFO L226 Difference]: Without dead ends: 259 [2023-11-29 00:34:04,562 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 00:34:04,564 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 00:34:04,564 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 00:34:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-29 00:34:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 139. [2023-11-29 00:34:04,580 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 00:34:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-11-29 00:34:04,582 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 32 [2023-11-29 00:34:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:04,582 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-11-29 00:34:04,582 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 00:34:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-11-29 00:34:04,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-29 00:34:04,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:04,585 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 00:34:04,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:34:04,585 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 00:34:04,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash 531249808, now seen corresponding path program 1 times [2023-11-29 00:34:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677888051] [2023-11-29 00:34:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:04,698 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 00:34:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677888051] [2023-11-29 00:34:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677888051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:34:04,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875227128] [2023-11-29 00:34:04,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:04,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:04,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:34:04,702 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 00:34:04,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:04,863 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2023-11-29 00:34:04,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:04,865 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 00:34:04,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:04,866 INFO L225 Difference]: With dead ends: 367 [2023-11-29 00:34:04,866 INFO L226 Difference]: Without dead ends: 265 [2023-11-29 00:34:04,867 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 00:34:04,868 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 00:34:04,869 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 00:34:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-29 00:34:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 152. [2023-11-29 00:34:04,881 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 00:34:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2023-11-29 00:34:04,882 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 35 [2023-11-29 00:34:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:04,882 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2023-11-29 00:34:04,882 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 00:34:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2023-11-29 00:34:04,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 00:34:04,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:04,885 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 00:34:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:34:04,885 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 00:34:04,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1222917471, now seen corresponding path program 1 times [2023-11-29 00:34:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:04,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386490119] [2023-11-29 00:34:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:05,002 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 00:34:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386490119] [2023-11-29 00:34:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386490119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:05,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568739877] [2023-11-29 00:34:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:05,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:05,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:05,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:34:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:05,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:34:05,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:05,146 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 00:34:05,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568739877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:05,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-29 00:34:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714438631] [2023-11-29 00:34:05,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:34:05,149 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 00:34:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:05,348 INFO L93 Difference]: Finished difference Result 305 states and 434 transitions. [2023-11-29 00:34:05,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:05,349 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 00:34:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:05,350 INFO L225 Difference]: With dead ends: 305 [2023-11-29 00:34:05,350 INFO L226 Difference]: Without dead ends: 205 [2023-11-29 00:34:05,351 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 00:34:05,352 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 00:34:05,352 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 00:34:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-29 00:34:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2023-11-29 00:34:05,362 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 00:34:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2023-11-29 00:34:05,363 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 38 [2023-11-29 00:34:05,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:05,364 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2023-11-29 00:34:05,364 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 00:34:05,364 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2023-11-29 00:34:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 00:34:05,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:05,366 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 00:34:05,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:05,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:05,571 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 00:34:05,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1793803865, now seen corresponding path program 1 times [2023-11-29 00:34:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957678288] [2023-11-29 00:34:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:05,698 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 00:34:05,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957678288] [2023-11-29 00:34:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957678288] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588148123] [2023-11-29 00:34:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:05,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:05,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:05,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:05,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:34:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:05,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 00:34:05,771 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:05,805 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 00:34:05,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588148123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:05,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:05,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-29 00:34:05,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901301156] [2023-11-29 00:34:05,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:05,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:05,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:05,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:05,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:05,808 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 00:34:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:05,986 INFO L93 Difference]: Finished difference Result 367 states and 502 transitions. [2023-11-29 00:34:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:05,987 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 00:34:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:05,988 INFO L225 Difference]: With dead ends: 367 [2023-11-29 00:34:05,989 INFO L226 Difference]: Without dead ends: 236 [2023-11-29 00:34:05,989 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 00:34:05,990 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 00:34:05,990 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 00:34:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-29 00:34:05,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 208. [2023-11-29 00:34:06,000 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 00:34:06,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2023-11-29 00:34:06,001 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 45 [2023-11-29 00:34:06,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:06,001 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2023-11-29 00:34:06,002 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 00:34:06,002 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2023-11-29 00:34:06,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 00:34:06,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:06,004 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 00:34:06,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 00:34:06,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:06,209 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 00:34:06,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:06,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1820882211, now seen corresponding path program 1 times [2023-11-29 00:34:06,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:06,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017940332] [2023-11-29 00:34:06,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:06,287 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 00:34:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:06,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017940332] [2023-11-29 00:34:06,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017940332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:06,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:34:06,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125784733] [2023-11-29 00:34:06,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:06,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:34:06,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:34:06,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:34:06,290 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 00:34:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:06,304 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2023-11-29 00:34:06,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:34:06,304 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 00:34:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:06,306 INFO L225 Difference]: With dead ends: 253 [2023-11-29 00:34:06,306 INFO L226 Difference]: Without dead ends: 182 [2023-11-29 00:34:06,306 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 00:34:06,307 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 00:34:06,308 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 00:34:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-29 00:34:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-11-29 00:34:06,314 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 00:34:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2023-11-29 00:34:06,315 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 52 [2023-11-29 00:34:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:06,316 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2023-11-29 00:34:06,316 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 00:34:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2023-11-29 00:34:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 00:34:06,318 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:06,318 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 00:34:06,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:34:06,318 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 00:34:06,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash 684955625, now seen corresponding path program 1 times [2023-11-29 00:34:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686192601] [2023-11-29 00:34:06,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:06,492 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 00:34:06,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:06,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686192601] [2023-11-29 00:34:06,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686192601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:06,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:06,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:34:06,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694936004] [2023-11-29 00:34:06,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:06,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:34:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:06,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:34:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:34:06,494 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 00:34:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:06,694 INFO L93 Difference]: Finished difference Result 496 states and 632 transitions. [2023-11-29 00:34:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 00:34:06,695 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 00:34:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:06,697 INFO L225 Difference]: With dead ends: 496 [2023-11-29 00:34:06,697 INFO L226 Difference]: Without dead ends: 364 [2023-11-29 00:34:06,698 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 00:34:06,699 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 00:34:06,699 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 00:34:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-29 00:34:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 224. [2023-11-29 00:34:06,711 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 00:34:06,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2023-11-29 00:34:06,712 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 64 [2023-11-29 00:34:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:06,712 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2023-11-29 00:34:06,712 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 00:34:06,712 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2023-11-29 00:34:06,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-29 00:34:06,713 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:06,713 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 00:34:06,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:34:06,714 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 00:34:06,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:06,714 INFO L85 PathProgramCache]: Analyzing trace with hash -251432026, now seen corresponding path program 1 times [2023-11-29 00:34:06,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:06,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636615220] [2023-11-29 00:34:06,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:06,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:06,844 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 00:34:06,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:06,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636615220] [2023-11-29 00:34:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636615220] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:06,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:34:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787476890] [2023-11-29 00:34:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:06,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:34:06,846 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 00:34:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:06,908 INFO L93 Difference]: Finished difference Result 506 states and 644 transitions. [2023-11-29 00:34:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:06,908 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 00:34:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:06,910 INFO L225 Difference]: With dead ends: 506 [2023-11-29 00:34:06,910 INFO L226 Difference]: Without dead ends: 332 [2023-11-29 00:34:06,911 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 00:34:06,912 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 00:34:06,912 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 00:34:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-29 00:34:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 246. [2023-11-29 00:34:06,922 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 00:34:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 319 transitions. [2023-11-29 00:34:06,923 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 319 transitions. Word has length 67 [2023-11-29 00:34:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:06,923 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 319 transitions. [2023-11-29 00:34:06,923 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 00:34:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 319 transitions. [2023-11-29 00:34:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 00:34:06,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:06,925 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 00:34:06,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:34:06,925 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 00:34:06,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash -555578320, now seen corresponding path program 1 times [2023-11-29 00:34:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:06,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037861854] [2023-11-29 00:34:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:06,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:07,104 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 00:34:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037861854] [2023-11-29 00:34:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037861854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:07,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:34:07,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469477302] [2023-11-29 00:34:07,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:07,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:34:07,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:07,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:34:07,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:34:07,106 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 00:34:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:07,382 INFO L93 Difference]: Finished difference Result 724 states and 939 transitions. [2023-11-29 00:34:07,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:34:07,383 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 00:34:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:07,386 INFO L225 Difference]: With dead ends: 724 [2023-11-29 00:34:07,386 INFO L226 Difference]: Without dead ends: 523 [2023-11-29 00:34:07,387 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 00:34:07,388 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 00:34:07,388 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 00:34:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-29 00:34:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 404. [2023-11-29 00:34:07,407 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 00:34:07,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2023-11-29 00:34:07,409 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 73 [2023-11-29 00:34:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:07,409 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2023-11-29 00:34:07,409 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 00:34:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2023-11-29 00:34:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 00:34:07,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:07,411 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 00:34:07,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 00:34:07,411 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 00:34:07,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:07,412 INFO L85 PathProgramCache]: Analyzing trace with hash -580403948, now seen corresponding path program 1 times [2023-11-29 00:34:07,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:07,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613817616] [2023-11-29 00:34:07,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:07,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:07,523 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 00:34:07,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:07,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613817616] [2023-11-29 00:34:07,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613817616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:07,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835417417] [2023-11-29 00:34:07,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:07,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:07,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:07,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:07,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 00:34:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:07,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:34:07,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:07,661 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 00:34:07,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835417417] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:07,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-29 00:34:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035291419] [2023-11-29 00:34:07,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:07,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:07,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:34:07,664 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 00:34:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:07,774 INFO L93 Difference]: Finished difference Result 1084 states and 1386 transitions. [2023-11-29 00:34:07,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:07,775 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 00:34:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:07,779 INFO L225 Difference]: With dead ends: 1084 [2023-11-29 00:34:07,779 INFO L226 Difference]: Without dead ends: 688 [2023-11-29 00:34:07,779 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 00:34:07,780 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 00:34:07,780 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 00:34:07,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-11-29 00:34:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 552. [2023-11-29 00:34:07,796 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 00:34:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 704 transitions. [2023-11-29 00:34:07,797 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 704 transitions. Word has length 73 [2023-11-29 00:34:07,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:07,798 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 704 transitions. [2023-11-29 00:34:07,798 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 00:34:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 704 transitions. [2023-11-29 00:34:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 00:34:07,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:07,799 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 00:34:07,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 00:34:07,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 00:34:08,000 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 00:34:08,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1721762467, now seen corresponding path program 1 times [2023-11-29 00:34:08,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:08,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504487041] [2023-11-29 00:34:08,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:08,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:08,124 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 00:34:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504487041] [2023-11-29 00:34:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504487041] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:08,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:08,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:34:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100146337] [2023-11-29 00:34:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:34:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:34:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:34:08,126 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 00:34:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:08,384 INFO L93 Difference]: Finished difference Result 1384 states and 1752 transitions. [2023-11-29 00:34:08,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:34:08,384 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 00:34:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:08,388 INFO L225 Difference]: With dead ends: 1384 [2023-11-29 00:34:08,388 INFO L226 Difference]: Without dead ends: 835 [2023-11-29 00:34:08,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:34:08,390 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 00:34:08,390 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 00:34:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-11-29 00:34:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 693. [2023-11-29 00:34:08,410 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 00:34:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 874 transitions. [2023-11-29 00:34:08,412 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 874 transitions. Word has length 73 [2023-11-29 00:34:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:08,413 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 874 transitions. [2023-11-29 00:34:08,413 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 00:34:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 874 transitions. [2023-11-29 00:34:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 00:34:08,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:08,414 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 00:34:08,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 00:34:08,414 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 00:34:08,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 696274990, now seen corresponding path program 1 times [2023-11-29 00:34:08,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:08,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060536321] [2023-11-29 00:34:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:08,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:08,565 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 00:34:08,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:08,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060536321] [2023-11-29 00:34:08,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060536321] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:08,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:08,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:34:08,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851372982] [2023-11-29 00:34:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:08,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:34:08,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:08,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:34:08,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:08,567 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 00:34:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:08,941 INFO L93 Difference]: Finished difference Result 1775 states and 2224 transitions. [2023-11-29 00:34:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:34:08,942 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 00:34:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:08,946 INFO L225 Difference]: With dead ends: 1775 [2023-11-29 00:34:08,946 INFO L226 Difference]: Without dead ends: 1007 [2023-11-29 00:34:08,947 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 00:34:08,948 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 289 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 00:34:08,948 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 00:34:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-29 00:34:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 823. [2023-11-29 00:34:08,972 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 00:34:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1040 transitions. [2023-11-29 00:34:08,975 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1040 transitions. Word has length 79 [2023-11-29 00:34:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:08,975 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1040 transitions. [2023-11-29 00:34:08,975 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 00:34:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1040 transitions. [2023-11-29 00:34:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 00:34:08,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:08,977 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 00:34:08,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 00:34:08,977 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 00:34:08,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:08,978 INFO L85 PathProgramCache]: Analyzing trace with hash -153420808, now seen corresponding path program 1 times [2023-11-29 00:34:08,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:08,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654873836] [2023-11-29 00:34:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:08,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:09,086 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 00:34:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654873836] [2023-11-29 00:34:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654873836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239870390] [2023-11-29 00:34:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:09,088 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:09,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 00:34:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:09,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:34:09,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:09,239 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 00:34:09,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:09,308 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 00:34:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239870390] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:09,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-29 00:34:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111945459] [2023-11-29 00:34:09,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:34:09,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:34:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:34:09,311 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 00:34:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:10,778 INFO L93 Difference]: Finished difference Result 4951 states and 6119 transitions. [2023-11-29 00:34:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-29 00:34:10,779 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 00:34:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:10,800 INFO L225 Difference]: With dead ends: 4951 [2023-11-29 00:34:10,800 INFO L226 Difference]: Without dead ends: 4009 [2023-11-29 00:34:10,803 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 00:34:10,804 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 928 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:10,804 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.8s Time] [2023-11-29 00:34:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2023-11-29 00:34:10,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 1076. [2023-11-29 00:34:10,884 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 00:34:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1513 transitions. [2023-11-29 00:34:10,888 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1513 transitions. Word has length 79 [2023-11-29 00:34:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:10,889 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1513 transitions. [2023-11-29 00:34:10,889 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 00:34:10,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1513 transitions. [2023-11-29 00:34:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 00:34:10,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:10,891 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 00:34:10,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 00:34:11,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 00:34:11,091 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 00:34:11,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:11,092 INFO L85 PathProgramCache]: Analyzing trace with hash 98242463, now seen corresponding path program 1 times [2023-11-29 00:34:11,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:11,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270628296] [2023-11-29 00:34:11,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:11,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:11,277 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 00:34:11,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:11,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270628296] [2023-11-29 00:34:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270628296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 00:34:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473877698] [2023-11-29 00:34:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:11,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 00:34:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:11,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 00:34:11,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:11,279 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 00:34:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:11,671 INFO L93 Difference]: Finished difference Result 2469 states and 3453 transitions. [2023-11-29 00:34:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 00:34:11,672 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 00:34:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:11,679 INFO L225 Difference]: With dead ends: 2469 [2023-11-29 00:34:11,679 INFO L226 Difference]: Without dead ends: 1377 [2023-11-29 00:34:11,681 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 00:34:11,682 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 00:34:11,682 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 00:34:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-11-29 00:34:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1236. [2023-11-29 00:34:11,739 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 00:34:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 00:34:11,744 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 79 [2023-11-29 00:34:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:11,745 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 00:34:11,745 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 00:34:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 00:34:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:34:11,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:11,747 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 00:34:11,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 00:34:11,748 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 00:34:11,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash -63426306, now seen corresponding path program 1 times [2023-11-29 00:34:11,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:11,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305331721] [2023-11-29 00:34:11,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:11,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:11,921 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 00:34:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:11,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305331721] [2023-11-29 00:34:11,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305331721] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:11,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:11,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:34:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357700398] [2023-11-29 00:34:11,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:11,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:34:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:11,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:34:11,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:34:11,923 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 00:34:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:12,265 INFO L93 Difference]: Finished difference Result 3873 states and 5447 transitions. [2023-11-29 00:34:12,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:34:12,266 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 00:34:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:12,286 INFO L225 Difference]: With dead ends: 3873 [2023-11-29 00:34:12,286 INFO L226 Difference]: Without dead ends: 3688 [2023-11-29 00:34:12,287 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 00:34:12,288 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 00:34:12,288 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 00:34:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2023-11-29 00:34:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 1236. [2023-11-29 00:34:12,383 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 00:34:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 00:34:12,387 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-29 00:34:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:12,387 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 00:34:12,387 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 00:34:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 00:34:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:34:12,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:12,389 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 00:34:12,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 00:34:12,390 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 00:34:12,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1996327789, now seen corresponding path program 1 times [2023-11-29 00:34:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236308842] [2023-11-29 00:34:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:12,551 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 00:34:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236308842] [2023-11-29 00:34:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236308842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:34:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461271660] [2023-11-29 00:34:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:12,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:34:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:34:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:34:12,554 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 00:34:12,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:12,903 INFO L93 Difference]: Finished difference Result 3865 states and 5435 transitions. [2023-11-29 00:34:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:34:12,903 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 00:34:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:12,922 INFO L225 Difference]: With dead ends: 3865 [2023-11-29 00:34:12,922 INFO L226 Difference]: Without dead ends: 3671 [2023-11-29 00:34:12,923 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 00:34:12,924 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 00:34:12,924 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 00:34:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2023-11-29 00:34:13,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1236. [2023-11-29 00:34:13,024 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 00:34:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-29 00:34:13,027 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-29 00:34:13,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:13,028 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-29 00:34:13,028 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 00:34:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-29 00:34:13,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 00:34:13,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:13,030 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 00:34:13,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 00:34:13,031 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 00:34:13,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1662703805, now seen corresponding path program 1 times [2023-11-29 00:34:13,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:13,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081771388] [2023-11-29 00:34:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-11-29 00:34:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:13,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081771388] [2023-11-29 00:34:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081771388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:13,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:13,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:34:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697087505] [2023-11-29 00:34:13,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:13,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:34:13,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:34:13,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:34:13,240 INFO L87 Difference]: Start difference. First operand 1236 states and 1743 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 00:34:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:13,444 INFO L93 Difference]: Finished difference Result 3046 states and 4095 transitions. [2023-11-29 00:34:13,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:34:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 00:34:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:13,453 INFO L225 Difference]: With dead ends: 3046 [2023-11-29 00:34:13,453 INFO L226 Difference]: Without dead ends: 1862 [2023-11-29 00:34:13,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:13,456 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 288 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:13,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 289 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:34:13,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2023-11-29 00:34:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1402. [2023-11-29 00:34:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.2855103497501785) internal successors, (1801), 1401 states have internal predecessors, (1801), 0 states have call successors, (0), 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 00:34:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-29 00:34:13,549 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-29 00:34:13,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:13,549 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-29 00:34:13,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 00:34:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-29 00:34:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 00:34:13,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:13,552 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:13,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 00:34:13,552 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 00:34:13,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -534350089, now seen corresponding path program 1 times [2023-11-29 00:34:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:13,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381832361] [2023-11-29 00:34:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:13,727 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 00:34:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:13,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381832361] [2023-11-29 00:34:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381832361] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 00:34:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202139464] [2023-11-29 00:34:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:13,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:34:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:34:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:34:13,730 INFO L87 Difference]: Start difference. First operand 1402 states and 1801 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 00:34:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:14,357 INFO L93 Difference]: Finished difference Result 5727 states and 7333 transitions. [2023-11-29 00:34:14,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:34:14,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 00:34:14,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:14,383 INFO L225 Difference]: With dead ends: 5727 [2023-11-29 00:34:14,383 INFO L226 Difference]: Without dead ends: 5604 [2023-11-29 00:34:14,385 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 00:34:14,386 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 407 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 876 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 00:34:14,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 876 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:34:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2023-11-29 00:34:14,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 1402. [2023-11-29 00:34:14,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.2855103497501785) internal successors, (1801), 1401 states have internal predecessors, (1801), 0 states have call successors, (0), 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 00:34:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-29 00:34:14,539 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-29 00:34:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:14,540 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-29 00:34:14,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 00:34:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-29 00:34:14,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 00:34:14,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:14,542 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:14,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 00:34:14,543 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 00:34:14,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -538752441, now seen corresponding path program 1 times [2023-11-29 00:34:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476756269] [2023-11-29 00:34:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:14,718 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 00:34:14,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476756269] [2023-11-29 00:34:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476756269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:14,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:34:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:34:14,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980133759] [2023-11-29 00:34:14,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:14,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:34:14,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:34:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:34:14,720 INFO L87 Difference]: Start difference. First operand 1402 states and 1801 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 00:34:15,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:15,367 INFO L93 Difference]: Finished difference Result 5793 states and 7408 transitions. [2023-11-29 00:34:15,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:34:15,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 00:34:15,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:15,390 INFO L225 Difference]: With dead ends: 5793 [2023-11-29 00:34:15,390 INFO L226 Difference]: Without dead ends: 5577 [2023-11-29 00:34:15,392 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 00:34:15,393 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 349 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 774 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 00:34:15,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 774 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:34:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-11-29 00:34:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 1402. [2023-11-29 00:34:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.2855103497501785) internal successors, (1801), 1401 states have internal predecessors, (1801), 0 states have call successors, (0), 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 00:34:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-29 00:34:15,525 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-29 00:34:15,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:15,525 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-29 00:34:15,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 00:34:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-29 00:34:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 00:34:15,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:15,528 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 00:34:15,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 00:34:15,529 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 00:34:15,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:15,529 INFO L85 PathProgramCache]: Analyzing trace with hash -697419044, now seen corresponding path program 1 times [2023-11-29 00:34:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066692033] [2023-11-29 00:34:15,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:15,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:15,702 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 00:34:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066692033] [2023-11-29 00:34:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066692033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839452253] [2023-11-29 00:34:15,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:15,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:15,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 00:34:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:15,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:34:15,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:15,835 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 00:34:15,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:15,944 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 00:34:15,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839452253] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:15,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:15,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2023-11-29 00:34:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375948919] [2023-11-29 00:34:15,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:15,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:34:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:15,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:34:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:34:15,947 INFO L87 Difference]: Start difference. First operand 1402 states and 1801 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 00:34:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:16,907 INFO L93 Difference]: Finished difference Result 4640 states and 6185 transitions. [2023-11-29 00:34:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 00:34:16,910 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 00:34:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:16,916 INFO L225 Difference]: With dead ends: 4640 [2023-11-29 00:34:16,917 INFO L226 Difference]: Without dead ends: 3245 [2023-11-29 00:34:16,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-11-29 00:34:16,920 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 707 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:16,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 503 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:34:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2023-11-29 00:34:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2598. [2023-11-29 00:34:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2597 states have (on average 1.215248363496342) internal successors, (3156), 2597 states have internal predecessors, (3156), 0 states have call successors, (0), 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 00:34:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3156 transitions. [2023-11-29 00:34:17,133 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3156 transitions. Word has length 88 [2023-11-29 00:34:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:17,133 INFO L495 AbstractCegarLoop]: Abstraction has 2598 states and 3156 transitions. [2023-11-29 00:34:17,134 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 00:34:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3156 transitions. [2023-11-29 00:34:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 00:34:17,137 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:17,137 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 00:34:17,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 00:34:17,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 00:34:17,338 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 00:34:17,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash 373515176, now seen corresponding path program 1 times [2023-11-29 00:34:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:17,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576012132] [2023-11-29 00:34:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:17,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:17,540 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 00:34:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576012132] [2023-11-29 00:34:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576012132] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:17,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848254923] [2023-11-29 00:34:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:17,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:17,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:17,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 00:34:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:17,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:34:17,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:17,685 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 00:34:17,686 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:17,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848254923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:17,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:17,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-29 00:34:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431569830] [2023-11-29 00:34:17,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:17,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 00:34:17,688 INFO L87 Difference]: Start difference. First operand 2598 states and 3156 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 00:34:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:18,121 INFO L93 Difference]: Finished difference Result 5361 states and 6497 transitions. [2023-11-29 00:34:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:18,122 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 00:34:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:18,130 INFO L225 Difference]: With dead ends: 5361 [2023-11-29 00:34:18,130 INFO L226 Difference]: Without dead ends: 4882 [2023-11-29 00:34:18,132 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 00:34:18,133 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 00:34:18,133 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 00:34:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2023-11-29 00:34:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3946. [2023-11-29 00:34:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 3945 states have (on average 1.223574144486692) internal successors, (4827), 3945 states have internal predecessors, (4827), 0 states have call successors, (0), 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 00:34:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4827 transitions. [2023-11-29 00:34:18,441 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4827 transitions. Word has length 88 [2023-11-29 00:34:18,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:18,442 INFO L495 AbstractCegarLoop]: Abstraction has 3946 states and 4827 transitions. [2023-11-29 00:34:18,442 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 00:34:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4827 transitions. [2023-11-29 00:34:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 00:34:18,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:18,447 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:18,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 00:34:18,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 00:34:18,647 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 00:34:18,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 837868115, now seen corresponding path program 1 times [2023-11-29 00:34:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38499733] [2023-11-29 00:34:18,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:18,966 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 41 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 00:34:18,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:18,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38499733] [2023-11-29 00:34:18,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38499733] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:18,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711974053] [2023-11-29 00:34:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:18,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:18,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:18,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:18,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 00:34:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:19,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-29 00:34:19,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 34 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 00:34:19,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-29 00:34:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711974053] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:19,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 18 [2023-11-29 00:34:19,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000666721] [2023-11-29 00:34:19,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:19,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 00:34:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 00:34:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2023-11-29 00:34:19,621 INFO L87 Difference]: Start difference. First operand 3946 states and 4827 transitions. Second operand has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 18 states have internal predecessors, (223), 0 states have call successors, (0), 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 00:34:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:21,527 INFO L93 Difference]: Finished difference Result 10842 states and 13010 transitions. [2023-11-29 00:34:21,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-29 00:34:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 18 states have internal predecessors, (223), 0 states have call successors, (0), 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 00:34:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:21,537 INFO L225 Difference]: With dead ends: 10842 [2023-11-29 00:34:21,537 INFO L226 Difference]: Without dead ends: 7786 [2023-11-29 00:34:21,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=669, Invalid=1881, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 00:34:21,541 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 1070 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:21,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 1942 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 00:34:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2023-11-29 00:34:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 3782. [2023-11-29 00:34:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 1.2229568897117165) internal successors, (4624), 3781 states have internal predecessors, (4624), 0 states have call successors, (0), 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 00:34:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 4624 transitions. [2023-11-29 00:34:21,867 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 4624 transitions. Word has length 90 [2023-11-29 00:34:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:21,867 INFO L495 AbstractCegarLoop]: Abstraction has 3782 states and 4624 transitions. [2023-11-29 00:34:21,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.736842105263158) internal successors, (223), 18 states have internal predecessors, (223), 0 states have call successors, (0), 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 00:34:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 4624 transitions. [2023-11-29 00:34:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 00:34:21,871 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:21,871 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 00:34:21,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 00:34:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 00:34:22,072 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 00:34:22,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash 775176431, now seen corresponding path program 1 times [2023-11-29 00:34:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:22,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379841948] [2023-11-29 00:34:22,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:22,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:22,271 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 00:34:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379841948] [2023-11-29 00:34:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379841948] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018020047] [2023-11-29 00:34:22,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:22,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:22,273 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:22,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 00:34:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:22,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:34:22,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:22,635 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 00:34:22,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:22,749 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 00:34:22,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018020047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:22,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-11-29 00:34:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148220494] [2023-11-29 00:34:22,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:22,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 00:34:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:22,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 00:34:22,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-11-29 00:34:22,752 INFO L87 Difference]: Start difference. First operand 3782 states and 4624 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 00:34:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:23,705 INFO L93 Difference]: Finished difference Result 7882 states and 9656 transitions. [2023-11-29 00:34:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 00:34:23,706 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 00:34:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:23,713 INFO L225 Difference]: With dead ends: 7882 [2023-11-29 00:34:23,713 INFO L226 Difference]: Without dead ends: 4109 [2023-11-29 00:34:23,717 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 00:34:23,717 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 791 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:23,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 886 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:34:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2023-11-29 00:34:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 1850. [2023-11-29 00:34:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1849 states have (on average 1.1887506760411033) internal successors, (2198), 1849 states have internal predecessors, (2198), 0 states have call successors, (0), 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 00:34:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2198 transitions. [2023-11-29 00:34:23,895 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2198 transitions. Word has length 94 [2023-11-29 00:34:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:23,895 INFO L495 AbstractCegarLoop]: Abstraction has 1850 states and 2198 transitions. [2023-11-29 00:34:23,895 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 00:34:23,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2198 transitions. [2023-11-29 00:34:23,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-29 00:34:23,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:23,898 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 00:34:23,902 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 00:34:24,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 00:34:24,098 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 00:34:24,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:24,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1113190354, now seen corresponding path program 1 times [2023-11-29 00:34:24,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:24,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2526914] [2023-11-29 00:34:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:24,320 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 00:34:24,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:24,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2526914] [2023-11-29 00:34:24,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2526914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:24,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967060338] [2023-11-29 00:34:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:24,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:24,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 00:34:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:24,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 00:34:24,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:24,464 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 00:34:24,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967060338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:24,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:24,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2023-11-29 00:34:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113416409] [2023-11-29 00:34:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:24,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:24,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:24,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:24,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:34:24,466 INFO L87 Difference]: Start difference. First operand 1850 states and 2198 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 00:34:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:24,658 INFO L93 Difference]: Finished difference Result 2270 states and 2674 transitions. [2023-11-29 00:34:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:24,659 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 00:34:24,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:24,661 INFO L225 Difference]: With dead ends: 2270 [2023-11-29 00:34:24,662 INFO L226 Difference]: Without dead ends: 1754 [2023-11-29 00:34:24,662 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 00:34:24,663 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 67 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:24,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 97 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:34:24,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2023-11-29 00:34:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1677. [2023-11-29 00:34:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.1951073985680192) internal successors, (2003), 1676 states have internal predecessors, (2003), 0 states have call successors, (0), 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 00:34:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2003 transitions. [2023-11-29 00:34:24,798 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2003 transitions. Word has length 94 [2023-11-29 00:34:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:24,798 INFO L495 AbstractCegarLoop]: Abstraction has 1677 states and 2003 transitions. [2023-11-29 00:34:24,798 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 00:34:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2003 transitions. [2023-11-29 00:34:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-29 00:34:24,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:24,800 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 00:34:24,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 00:34:25,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 00:34:25,001 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 00:34:25,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1943687349, now seen corresponding path program 1 times [2023-11-29 00:34:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855875052] [2023-11-29 00:34:25,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:25,211 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-29 00:34:25,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855875052] [2023-11-29 00:34:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855875052] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367357533] [2023-11-29 00:34:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:25,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:25,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:25,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:25,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 00:34:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:25,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 00:34:25,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 00:34:25,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:34:25,646 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 52 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-29 00:34:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367357533] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:34:25,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:34:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-11-29 00:34:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413784488] [2023-11-29 00:34:25,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:34:25,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 00:34:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 00:34:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-29 00:34:25,648 INFO L87 Difference]: Start difference. First operand 1677 states and 2003 transitions. Second operand has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 14 states have internal predecessors, (208), 0 states have call successors, (0), 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 00:34:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:26,612 INFO L93 Difference]: Finished difference Result 4307 states and 5072 transitions. [2023-11-29 00:34:26,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 00:34:26,613 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 14 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2023-11-29 00:34:26,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:26,616 INFO L225 Difference]: With dead ends: 4307 [2023-11-29 00:34:26,616 INFO L226 Difference]: Without dead ends: 1986 [2023-11-29 00:34:26,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=729, Unknown=0, NotChecked=0, Total=992 [2023-11-29 00:34:26,618 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 806 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:26,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1344 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 00:34:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2023-11-29 00:34:26,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 746. [2023-11-29 00:34:26,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 745 states have (on average 1.1946308724832215) internal successors, (890), 745 states have internal predecessors, (890), 0 states have call successors, (0), 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 00:34:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 890 transitions. [2023-11-29 00:34:26,671 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 890 transitions. Word has length 96 [2023-11-29 00:34:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:26,671 INFO L495 AbstractCegarLoop]: Abstraction has 746 states and 890 transitions. [2023-11-29 00:34:26,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.866666666666667) internal successors, (208), 14 states have internal predecessors, (208), 0 states have call successors, (0), 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 00:34:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 890 transitions. [2023-11-29 00:34:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-29 00:34:26,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:26,673 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:26,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 00:34:26,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 00:34:26,873 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 00:34:26,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 151323196, now seen corresponding path program 1 times [2023-11-29 00:34:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137607329] [2023-11-29 00:34:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:34:27,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:34:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137607329] [2023-11-29 00:34:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137607329] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:34:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890530012] [2023-11-29 00:34:27,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:34:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:34:27,194 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:34:27,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 00:34:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:34:27,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:34:27,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:34:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-11-29 00:34:27,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:34:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890530012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:34:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 00:34:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 12 [2023-11-29 00:34:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013001847] [2023-11-29 00:34:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:34:27,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:34:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:34:27,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:34:27,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:34:27,362 INFO L87 Difference]: Start difference. First operand 746 states and 890 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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 00:34:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:34:27,455 INFO L93 Difference]: Finished difference Result 1225 states and 1462 transitions. [2023-11-29 00:34:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:34:27,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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 100 [2023-11-29 00:34:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:34:27,457 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 00:34:27,457 INFO L226 Difference]: Without dead ends: 473 [2023-11-29 00:34:27,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-29 00:34:27,458 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:34:27,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:34:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2023-11-29 00:34:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 374. [2023-11-29 00:34:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.1715817694369972) internal successors, (437), 373 states have internal predecessors, (437), 0 states have call successors, (0), 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 00:34:27,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 437 transitions. [2023-11-29 00:34:27,484 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 437 transitions. Word has length 100 [2023-11-29 00:34:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:34:27,485 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 437 transitions. [2023-11-29 00:34:27,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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 00:34:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 437 transitions. [2023-11-29 00:34:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 00:34:27,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:34:27,486 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:34:27,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 00:34:27,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-29 00:34:27,691 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 00:34:27,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:34:27,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1184009150, now seen corresponding path program 1 times [2023-11-29 00:34:27,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:34:27,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770292800] [2023-11-29 00:34:27,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:34:27,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:34:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:27,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:34:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:34:27,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:34:27,798 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:34:27,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-29 00:34:27,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-29 00:34:27,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-29 00:34:27,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-29 00:34:27,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-29 00:34:27,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-29 00:34:27,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-29 00:34:27,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-29 00:34:27,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-29 00:34:27,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-29 00:34:27,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-29 00:34:27,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 00:34:27,808 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 00:34:27,811 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:34:27,863 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:34:27,864 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:34:27,865 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:34:27 BoogieIcfgContainer [2023-11-29 00:34:27,884 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:34:27,885 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:34:27,885 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:34:27,885 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:34:27,885 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:34:03" (3/4) ... [2023-11-29 00:34:27,886 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 00:34:27,906 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:34:27,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,907 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-29 00:34:27,908 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-29 00:34:27,970 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 00:34:27,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:34:27,971 INFO L158 Benchmark]: Toolchain (without parser) took 25835.64ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 120.1MB in the beginning and 266.4MB in the end (delta: -146.3MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,971 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:34:27,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.61ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 107.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.36ms. Allocated memory is still 159.4MB. Free memory was 107.0MB in the beginning and 102.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,973 INFO L158 Benchmark]: Boogie Preprocessor took 59.25ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 99.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,973 INFO L158 Benchmark]: RCFGBuilder took 550.26ms. Allocated memory is still 159.4MB. Free memory was 99.7MB in the beginning and 71.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,973 INFO L158 Benchmark]: TraceAbstraction took 24804.72ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 71.3MB in the beginning and 276.8MB in the end (delta: -205.5MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,974 INFO L158 Benchmark]: Witness Printer took 85.89ms. Allocated memory is still 448.8MB. Free memory was 276.8MB in the beginning and 266.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 00:34:27,975 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.61ms. Allocated memory is still 159.4MB. Free memory was 120.1MB in the beginning and 107.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.36ms. Allocated memory is still 159.4MB. Free memory was 107.0MB in the beginning and 102.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.25ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 99.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 550.26ms. Allocated memory is still 159.4MB. Free memory was 99.7MB in the beginning and 71.9MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24804.72ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 71.3MB in the beginning and 276.8MB in the end (delta: -205.5MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. * Witness Printer took 85.89ms. Allocated memory is still 448.8MB. Free memory was 276.8MB in the beginning and 266.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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~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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L125] a = __VERIFIER_nondet_uint() [L127] b = 234770789 [L129] CALL mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] EXPR partial_sum + a0 [L84] partial_sum = partial_sum + a0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=155] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=0, na=4, nb=4, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] EXPR partial_sum + a1 [L85] partial_sum = partial_sum + a1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=175, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L86] EXPR partial_sum + a2 [L86] partial_sum = partial_sum + a2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=2, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L83] COND TRUE i < na VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0] [L87] EXPR partial_sum + a3 [L87] partial_sum = partial_sum + a3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=242, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L104] EXPR i + (unsigned char)1 [L104] i = i + (unsigned char)1 VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L107] COND FALSE !(i < (unsigned char)4) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r1 << 8U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r0 | (r1 << 8U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] EXPR r2 << 16U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] r0 | (r1 << 8U) | (r2 << 16U) VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] [L116] r3 << 24U VAL [\old(a)=4043419291, \old(b)=234770789, a0=4043419291, a1=15794606, a2=61697, a3=241, a=4043419291, b0=234770789, b1=917073, b2=3582, b3=13, b=234770789, carry=0, i=4, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0, r3=255] - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 24.7s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8072 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8072 mSDsluCounter, 12813 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9307 mSDsCounter, 491 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6917 IncrementalHoareTripleChecker+Invalid, 7408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 491 mSolverCounterUnsat, 3506 mSDtfsCounter, 6917 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 1393 SyntacticMatches, 7 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1753 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3946occurred in iteration=23, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 28 MinimizatonAttempts, 27202 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 2910 NumberOfCodeBlocks, 2910 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3207 ConstructedInterpolants, 0 QuantifiedInterpolants, 12880 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2002 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 44 InterpolantComputations, 23 PerfectInterpolantSequences, 2560/2959 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 00:34:27,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_04a3bee6-476b-4c01-9528-93876b10ecf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)