./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme --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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:44:46,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:44:46,937 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-26 10:44:46,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:44:46,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:44:46,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:44:46,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:44:47,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:44:47,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:44:47,010 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:44:47,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:44:47,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:44:47,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:44:47,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:44:47,012 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:44:47,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:44:47,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:44:47,014 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:44:47,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:44:47,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:44:47,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:44:47,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:44:47,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:44:47,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:44:47,017 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-26 10:44:47,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:44:47,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:44:47,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:44:47,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:44:47,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:44:47,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:44:47,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:44:47,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:44:47,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:44:47,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:44:47,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:44:47,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:44:47,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:44:47,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:44:47,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:44:47,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:44:47,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:44:47,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:44:47,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:44:47,026 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_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/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_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c [2023-11-26 10:44:47,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:44:47,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:44:47,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:44:47,353 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:44:47,354 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:44:47,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-11-26 10:44:50,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:44:50,864 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:44:50,865 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/sv-benchmarks/c/bitvector/byte_add_1-2.i [2023-11-26 10:44:50,875 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/data/e61178d05/131d43af410440ceba70de7758e02228/FLAG99d15074c [2023-11-26 10:44:50,890 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/data/e61178d05/131d43af410440ceba70de7758e02228 [2023-11-26 10:44:50,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:44:50,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:44:50,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:44:50,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:44:50,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:44:50,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:44:50" (1/1) ... [2023-11-26 10:44:50,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9ee4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:50, skipping insertion in model container [2023-11-26 10:44:50,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:44:50" (1/1) ... [2023-11-26 10:44:50,937 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:44:51,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:44:51,178 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:44:51,222 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:44:51,237 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:44:51,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51 WrapperNode [2023-11-26 10:44:51,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:44:51,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:44:51,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:44:51,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:44:51,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,309 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 197 [2023-11-26 10:44:51,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:44:51,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:44:51,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:44:51,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:44:51,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,347 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-26 10:44:51,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:44:51,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:44:51,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:44:51,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:44:51,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (1/1) ... [2023-11-26 10:44:51,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:44:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:44:51,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:44:51,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:44:51,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:44:51,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:44:51,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:44:51,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:44:51,630 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:44:51,633 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:44:52,183 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:44:52,244 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:44:52,246 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 10:44:52,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:44:52 BoogieIcfgContainer [2023-11-26 10:44:52,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:44:52,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:44:52,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:44:52,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:44:52,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:44:50" (1/3) ... [2023-11-26 10:44:52,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da9b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:44:52, skipping insertion in model container [2023-11-26 10:44:52,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:44:51" (2/3) ... [2023-11-26 10:44:52,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15da9b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:44:52, skipping insertion in model container [2023-11-26 10:44:52,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:44:52" (3/3) ... [2023-11-26 10:44:52,256 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i [2023-11-26 10:44:52,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:44:52,293 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2023-11-26 10:44:52,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:44:52,371 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;@7a1dfc10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:44:52,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2023-11-26 10:44:52,376 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-26 10:44:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-26 10:44:52,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:52,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-26 10:44:52,384 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-26 10:44:52,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash 337472, now seen corresponding path program 1 times [2023-11-26 10:44:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:52,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959123074] [2023-11-26 10:44:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:52,553 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-26 10:44:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959123074] [2023-11-26 10:44:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959123074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:44:52,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301218954] [2023-11-26 10:44:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:52,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 10:44:52,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:52,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 10:44:52,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 10:44:52,603 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-26 10:44:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:52,649 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2023-11-26 10:44:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 10:44:52,651 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-26 10:44:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:52,661 INFO L225 Difference]: With dead ends: 152 [2023-11-26 10:44:52,661 INFO L226 Difference]: Without dead ends: 76 [2023-11-26 10:44:52,664 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-26 10:44:52,669 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-26 10:44:52,670 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-26 10:44:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-26 10:44:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-11-26 10:44:52,710 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-26 10:44:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 106 transitions. [2023-11-26 10:44:52,715 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 106 transitions. Word has length 3 [2023-11-26 10:44:52,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:52,715 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 106 transitions. [2023-11-26 10:44:52,716 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-26 10:44:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 106 transitions. [2023-11-26 10:44:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-26 10:44:52,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:52,718 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-26 10:44:52,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:44:52,719 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-26 10:44:52,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 618880512, now seen corresponding path program 1 times [2023-11-26 10:44:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143853144] [2023-11-26 10:44:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:52,966 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-26 10:44:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:52,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143853144] [2023-11-26 10:44:52,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143853144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:52,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:52,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:44:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892323677] [2023-11-26 10:44:52,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:52,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:52,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:52,977 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-26 10:44:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:53,202 INFO L93 Difference]: Finished difference Result 160 states and 235 transitions. [2023-11-26 10:44:53,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:44:53,203 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-26 10:44:53,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:53,205 INFO L225 Difference]: With dead ends: 160 [2023-11-26 10:44:53,205 INFO L226 Difference]: Without dead ends: 105 [2023-11-26 10:44:53,206 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-26 10:44:53,207 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.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:53,208 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.2s Time] [2023-11-26 10:44:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-26 10:44:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2023-11-26 10:44:53,220 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-26 10:44:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2023-11-26 10:44:53,222 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 18 [2023-11-26 10:44:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:53,223 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2023-11-26 10:44:53,223 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-26 10:44:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2023-11-26 10:44:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-26 10:44:53,225 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:53,225 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-26 10:44:53,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:44:53,226 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-26 10:44:53,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:53,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1543432602, now seen corresponding path program 1 times [2023-11-26 10:44:53,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:53,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551174475] [2023-11-26 10:44:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:53,387 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-26 10:44:53,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:53,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551174475] [2023-11-26 10:44:53,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551174475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:53,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:53,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:44:53,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382836225] [2023-11-26 10:44:53,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:53,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:53,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:53,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:53,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:44:53,391 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-26 10:44:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:53,664 INFO L93 Difference]: Finished difference Result 229 states and 340 transitions. [2023-11-26 10:44:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:44:53,665 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-26 10:44:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:53,667 INFO L225 Difference]: With dead ends: 229 [2023-11-26 10:44:53,667 INFO L226 Difference]: Without dead ends: 174 [2023-11-26 10:44:53,668 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-26 10:44:53,670 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-26 10:44:53,670 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-26 10:44:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-26 10:44:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2023-11-26 10:44:53,684 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-26 10:44:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2023-11-26 10:44:53,686 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 25 [2023-11-26 10:44:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:53,687 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2023-11-26 10:44:53,687 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-26 10:44:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2023-11-26 10:44:53,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-26 10:44:53,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:53,690 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-26 10:44:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:44:53,690 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-26 10:44:53,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1457126148, now seen corresponding path program 1 times [2023-11-26 10:44:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164720489] [2023-11-26 10:44:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:53,866 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-26 10:44:53,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164720489] [2023-11-26 10:44:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164720489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:53,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:44:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892138397] [2023-11-26 10:44:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:53,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:44:53,883 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-26 10:44:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:54,124 INFO L93 Difference]: Finished difference Result 361 states and 490 transitions. [2023-11-26 10:44:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:54,125 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-26 10:44:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:54,127 INFO L225 Difference]: With dead ends: 361 [2023-11-26 10:44:54,129 INFO L226 Difference]: Without dead ends: 259 [2023-11-26 10:44:54,130 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-26 10:44:54,134 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 140 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:54,140 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.2s Time] [2023-11-26 10:44:54,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-11-26 10:44:54,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 139. [2023-11-26 10:44:54,163 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-26 10:44:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-11-26 10:44:54,168 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 32 [2023-11-26 10:44:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:54,169 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-11-26 10:44:54,169 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-26 10:44:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-11-26 10:44:54,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-26 10:44:54,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:54,175 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-26 10:44:54,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:44:54,176 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-26 10:44:54,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:54,178 INFO L85 PathProgramCache]: Analyzing trace with hash 531249808, now seen corresponding path program 1 times [2023-11-26 10:44:54,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:54,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720756883] [2023-11-26 10:44:54,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:54,426 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-26 10:44:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720756883] [2023-11-26 10:44:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720756883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:44:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034188018] [2023-11-26 10:44:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:54,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:54,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:54,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:44:54,431 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-26 10:44:54,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:54,658 INFO L93 Difference]: Finished difference Result 367 states and 496 transitions. [2023-11-26 10:44:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:54,659 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-26 10:44:54,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:54,661 INFO L225 Difference]: With dead ends: 367 [2023-11-26 10:44:54,661 INFO L226 Difference]: Without dead ends: 265 [2023-11-26 10:44:54,664 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-26 10:44:54,666 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 129 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:54,667 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.2s Time] [2023-11-26 10:44:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-26 10:44:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 152. [2023-11-26 10:44:54,689 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-26 10:44:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 202 transitions. [2023-11-26 10:44:54,700 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 202 transitions. Word has length 35 [2023-11-26 10:44:54,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:54,701 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 202 transitions. [2023-11-26 10:44:54,701 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-26 10:44:54,701 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 202 transitions. [2023-11-26 10:44:54,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-26 10:44:54,707 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:54,708 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-26 10:44:54,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:44:54,708 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-26 10:44:54,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:54,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1222917471, now seen corresponding path program 1 times [2023-11-26 10:44:54,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:54,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278736421] [2023-11-26 10:44:54,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:54,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:54,923 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-26 10:44:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278736421] [2023-11-26 10:44:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278736421] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:44:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165531296] [2023-11-26 10:44:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:44:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:44:54,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:44:54,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 10:44:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:55,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 10:44:55,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:44:55,134 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-26 10:44:55,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:44:55,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165531296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:55,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:44:55,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-11-26 10:44:55,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802529279] [2023-11-26 10:44:55,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:55,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:55,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:55,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:55,138 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-26 10:44:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:55,407 INFO L93 Difference]: Finished difference Result 305 states and 434 transitions. [2023-11-26 10:44:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:55,408 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-26 10:44:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:55,409 INFO L225 Difference]: With dead ends: 305 [2023-11-26 10:44:55,410 INFO L226 Difference]: Without dead ends: 205 [2023-11-26 10:44:55,410 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-26 10:44:55,411 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-26 10:44:55,412 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-26 10:44:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-11-26 10:44:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2023-11-26 10:44:55,424 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-26 10:44:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 239 transitions. [2023-11-26 10:44:55,426 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 239 transitions. Word has length 38 [2023-11-26 10:44:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:55,427 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 239 transitions. [2023-11-26 10:44:55,427 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-26 10:44:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 239 transitions. [2023-11-26 10:44:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-26 10:44:55,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:55,429 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-26 10:44:55,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 10:44:55,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-26 10:44:55,647 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-26 10:44:55,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:55,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1793803865, now seen corresponding path program 1 times [2023-11-26 10:44:55,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:55,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870638437] [2023-11-26 10:44:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:55,821 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-26 10:44:55,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:55,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870638437] [2023-11-26 10:44:55,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870638437] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:44:55,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249592522] [2023-11-26 10:44:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:55,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:44:55,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:44:55,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:44:55,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 10:44:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:55,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 10:44:55,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:44:55,946 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-26 10:44:55,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:44:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249592522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:55,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:44:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2023-11-26 10:44:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139108273] [2023-11-26 10:44:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:55,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:44:55,949 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-26 10:44:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:56,193 INFO L93 Difference]: Finished difference Result 367 states and 502 transitions. [2023-11-26 10:44:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:56,194 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-26 10:44:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:56,196 INFO L225 Difference]: With dead ends: 367 [2023-11-26 10:44:56,196 INFO L226 Difference]: Without dead ends: 236 [2023-11-26 10:44:56,197 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-26 10:44:56,198 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 47 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-26 10:44:56,198 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-26 10:44:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-11-26 10:44:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 208. [2023-11-26 10:44:56,211 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-26 10:44:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 268 transitions. [2023-11-26 10:44:56,213 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 268 transitions. Word has length 45 [2023-11-26 10:44:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:56,214 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 268 transitions. [2023-11-26 10:44:56,214 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-26 10:44:56,214 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 268 transitions. [2023-11-26 10:44:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-26 10:44:56,216 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:56,216 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-26 10:44:56,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:44:56,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-26 10:44:56,422 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-26 10:44:56,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:56,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1820882211, now seen corresponding path program 1 times [2023-11-26 10:44:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:56,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612781397] [2023-11-26 10:44:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:56,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:56,562 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-26 10:44:56,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:56,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612781397] [2023-11-26 10:44:56,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612781397] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:56,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:56,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:44:56,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676446691] [2023-11-26 10:44:56,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:56,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:44:56,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:44:56,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:44:56,566 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-26 10:44:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:56,587 INFO L93 Difference]: Finished difference Result 253 states and 323 transitions. [2023-11-26 10:44:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:44:56,588 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-26 10:44:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:56,589 INFO L225 Difference]: With dead ends: 253 [2023-11-26 10:44:56,590 INFO L226 Difference]: Without dead ends: 182 [2023-11-26 10:44:56,590 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-26 10:44:56,593 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-26 10:44:56,594 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-26 10:44:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-26 10:44:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-11-26 10:44:56,601 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-26 10:44:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 232 transitions. [2023-11-26 10:44:56,602 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 232 transitions. Word has length 52 [2023-11-26 10:44:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:56,603 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 232 transitions. [2023-11-26 10:44:56,603 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-26 10:44:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 232 transitions. [2023-11-26 10:44:56,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-26 10:44:56,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:56,605 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-26 10:44:56,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:44:56,605 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-26 10:44:56,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 684955625, now seen corresponding path program 1 times [2023-11-26 10:44:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331945677] [2023-11-26 10:44:56,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:56,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:56,771 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-26 10:44:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:56,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331945677] [2023-11-26 10:44:56,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331945677] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:56,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:56,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:44:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846000285] [2023-11-26 10:44:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:56,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:44:56,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:56,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:44:56,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:44:56,774 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-26 10:44:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:57,031 INFO L93 Difference]: Finished difference Result 496 states and 632 transitions. [2023-11-26 10:44:57,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:44:57,031 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-26 10:44:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:57,034 INFO L225 Difference]: With dead ends: 496 [2023-11-26 10:44:57,034 INFO L226 Difference]: Without dead ends: 364 [2023-11-26 10:44:57,034 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-26 10:44:57,035 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 149 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-26 10:44:57,035 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-26 10:44:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2023-11-26 10:44:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 224. [2023-11-26 10:44:57,047 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-26 10:44:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 285 transitions. [2023-11-26 10:44:57,049 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 285 transitions. Word has length 64 [2023-11-26 10:44:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:57,049 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 285 transitions. [2023-11-26 10:44:57,049 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-26 10:44:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 285 transitions. [2023-11-26 10:44:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-26 10:44:57,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:57,051 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-26 10:44:57,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:44:57,051 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-26 10:44:57,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash -251432026, now seen corresponding path program 1 times [2023-11-26 10:44:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630914527] [2023-11-26 10:44:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:57,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:57,209 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-26 10:44:57,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:57,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630914527] [2023-11-26 10:44:57,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630914527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:57,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:57,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:44:57,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058123800] [2023-11-26 10:44:57,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:57,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:57,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:44:57,212 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-26 10:44:57,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:57,283 INFO L93 Difference]: Finished difference Result 506 states and 644 transitions. [2023-11-26 10:44:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:57,284 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-26 10:44:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:57,288 INFO L225 Difference]: With dead ends: 506 [2023-11-26 10:44:57,288 INFO L226 Difference]: Without dead ends: 332 [2023-11-26 10:44:57,289 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-26 10:44:57,289 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.1s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:57,291 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.1s Time] [2023-11-26 10:44:57,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-26 10:44:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 246. [2023-11-26 10:44:57,301 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-26 10:44:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 319 transitions. [2023-11-26 10:44:57,302 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 319 transitions. Word has length 67 [2023-11-26 10:44:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:57,303 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 319 transitions. [2023-11-26 10:44:57,303 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-26 10:44:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 319 transitions. [2023-11-26 10:44:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-26 10:44:57,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:57,305 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-26 10:44:57,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:44:57,306 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-26 10:44:57,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:57,307 INFO L85 PathProgramCache]: Analyzing trace with hash -555578320, now seen corresponding path program 1 times [2023-11-26 10:44:57,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:57,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556872005] [2023-11-26 10:44:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:57,555 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-26 10:44:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:57,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556872005] [2023-11-26 10:44:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556872005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:57,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:44:57,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455059255] [2023-11-26 10:44:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:57,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:57,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:57,559 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-26 10:44:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:57,943 INFO L93 Difference]: Finished difference Result 724 states and 939 transitions. [2023-11-26 10:44:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:44:57,944 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-26 10:44:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:57,948 INFO L225 Difference]: With dead ends: 724 [2023-11-26 10:44:57,948 INFO L226 Difference]: Without dead ends: 523 [2023-11-26 10:44:57,949 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-26 10:44:57,949 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 267 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:57,950 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.3s Time] [2023-11-26 10:44:57,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2023-11-26 10:44:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 404. [2023-11-26 10:44:57,971 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-26 10:44:57,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 519 transitions. [2023-11-26 10:44:57,974 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 519 transitions. Word has length 73 [2023-11-26 10:44:57,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:57,974 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 519 transitions. [2023-11-26 10:44:57,974 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-26 10:44:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 519 transitions. [2023-11-26 10:44:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-26 10:44:57,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:57,977 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-26 10:44:57,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:44:57,977 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-26 10:44:57,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:57,979 INFO L85 PathProgramCache]: Analyzing trace with hash -580403948, now seen corresponding path program 1 times [2023-11-26 10:44:57,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:57,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66640884] [2023-11-26 10:44:57,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:57,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:58,121 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-26 10:44:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66640884] [2023-11-26 10:44:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66640884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:44:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261350843] [2023-11-26 10:44:58,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:58,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:44:58,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:44:58,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:44:58,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 10:44:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:58,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:44:58,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:44:58,331 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-26 10:44:58,331 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:44:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261350843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:44:58,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-26 10:44:58,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798051011] [2023-11-26 10:44:58,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:58,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:44:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:58,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:44:58,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:44:58,334 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-26 10:44:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:58,481 INFO L93 Difference]: Finished difference Result 1084 states and 1386 transitions. [2023-11-26 10:44:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:44:58,482 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-26 10:44:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:58,486 INFO L225 Difference]: With dead ends: 1084 [2023-11-26 10:44:58,487 INFO L226 Difference]: Without dead ends: 688 [2023-11-26 10:44:58,488 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-26 10:44:58,488 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-26 10:44:58,489 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-26 10:44:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2023-11-26 10:44:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 552. [2023-11-26 10:44:58,514 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-26 10:44:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 704 transitions. [2023-11-26 10:44:58,517 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 704 transitions. Word has length 73 [2023-11-26 10:44:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:58,517 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 704 transitions. [2023-11-26 10:44:58,517 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-26 10:44:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 704 transitions. [2023-11-26 10:44:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-26 10:44:58,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:58,519 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-26 10:44:58,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:44:58,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-26 10:44:58,727 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-26 10:44:58,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1721762467, now seen corresponding path program 1 times [2023-11-26 10:44:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333182396] [2023-11-26 10:44:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:58,911 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-26 10:44:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333182396] [2023-11-26 10:44:58,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333182396] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:58,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:58,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:44:58,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392767507] [2023-11-26 10:44:58,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:58,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:44:58,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:44:58,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:44:58,914 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-26 10:44:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:44:59,305 INFO L93 Difference]: Finished difference Result 1384 states and 1752 transitions. [2023-11-26 10:44:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:44:59,306 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-26 10:44:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:44:59,311 INFO L225 Difference]: With dead ends: 1384 [2023-11-26 10:44:59,311 INFO L226 Difference]: Without dead ends: 835 [2023-11-26 10:44:59,313 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-26 10:44:59,313 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.3s IncrementalHoareTripleChecker+Time [2023-11-26 10:44:59,314 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.3s Time] [2023-11-26 10:44:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2023-11-26 10:44:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 693. [2023-11-26 10:44:59,352 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-26 10:44:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 874 transitions. [2023-11-26 10:44:59,356 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 874 transitions. Word has length 73 [2023-11-26 10:44:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:44:59,357 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 874 transitions. [2023-11-26 10:44:59,357 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-26 10:44:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 874 transitions. [2023-11-26 10:44:59,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-26 10:44:59,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:44:59,360 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-26 10:44:59,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:44:59,360 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-26 10:44:59,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:44:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 696274990, now seen corresponding path program 1 times [2023-11-26 10:44:59,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:44:59,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481045512] [2023-11-26 10:44:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:44:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:44:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:44:59,573 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-26 10:44:59,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:44:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481045512] [2023-11-26 10:44:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481045512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:44:59,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:44:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:44:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338005521] [2023-11-26 10:44:59,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:44:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:44:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:44:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:44:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:44:59,576 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-26 10:45:00,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:00,140 INFO L93 Difference]: Finished difference Result 1775 states and 2224 transitions. [2023-11-26 10:45:00,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:45:00,141 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-26 10:45:00,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:00,148 INFO L225 Difference]: With dead ends: 1775 [2023-11-26 10:45:00,148 INFO L226 Difference]: Without dead ends: 1007 [2023-11-26 10:45:00,150 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-26 10:45:00,151 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 289 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:00,152 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.4s Time] [2023-11-26 10:45:00,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-26 10:45:00,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 823. [2023-11-26 10:45:00,215 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-26 10:45:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1040 transitions. [2023-11-26 10:45:00,219 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1040 transitions. Word has length 79 [2023-11-26 10:45:00,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:00,221 INFO L495 AbstractCegarLoop]: Abstraction has 823 states and 1040 transitions. [2023-11-26 10:45:00,221 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-26 10:45:00,221 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1040 transitions. [2023-11-26 10:45:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-26 10:45:00,223 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:00,223 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-26 10:45:00,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:45:00,224 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-26 10:45:00,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -153420808, now seen corresponding path program 1 times [2023-11-26 10:45:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347454528] [2023-11-26 10:45:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:00,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:00,408 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-26 10:45:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347454528] [2023-11-26 10:45:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347454528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269262069] [2023-11-26 10:45:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:00,411 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:00,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 10:45:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:00,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-26 10:45:00,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:00,621 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-26 10:45:00,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:00,714 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-26 10:45:00,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269262069] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:45:00,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:45:00,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2023-11-26 10:45:00,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144159354] [2023-11-26 10:45:00,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:45:00,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-26 10:45:00,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-26 10:45:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-26 10:45:00,717 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-26 10:45:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:02,657 INFO L93 Difference]: Finished difference Result 4951 states and 6119 transitions. [2023-11-26 10:45:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-26 10:45:02,658 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-26 10:45:02,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:02,683 INFO L225 Difference]: With dead ends: 4951 [2023-11-26 10:45:02,683 INFO L226 Difference]: Without dead ends: 4009 [2023-11-26 10:45:02,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=531, Invalid=2225, Unknown=0, NotChecked=0, Total=2756 [2023-11-26 10:45:02,688 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 928 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:02,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 1007 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-26 10:45:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2023-11-26 10:45:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 1076. [2023-11-26 10:45:02,789 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-26 10:45:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1513 transitions. [2023-11-26 10:45:02,795 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1513 transitions. Word has length 79 [2023-11-26 10:45:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:02,795 INFO L495 AbstractCegarLoop]: Abstraction has 1076 states and 1513 transitions. [2023-11-26 10:45:02,795 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-26 10:45:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1513 transitions. [2023-11-26 10:45:02,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-26 10:45:02,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:02,798 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-26 10:45:02,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:03,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-26 10:45:03,005 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-26 10:45:03,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash 98242463, now seen corresponding path program 1 times [2023-11-26 10:45:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:03,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400919420] [2023-11-26 10:45:03,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:03,234 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-26 10:45:03,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:03,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400919420] [2023-11-26 10:45:03,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400919420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:03,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:03,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 10:45:03,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52652377] [2023-11-26 10:45:03,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:03,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 10:45:03,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:03,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 10:45:03,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:45:03,237 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-26 10:45:03,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:03,703 INFO L93 Difference]: Finished difference Result 2469 states and 3453 transitions. [2023-11-26 10:45:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 10:45:03,704 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-26 10:45:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:03,713 INFO L225 Difference]: With dead ends: 2469 [2023-11-26 10:45:03,713 INFO L226 Difference]: Without dead ends: 1377 [2023-11-26 10:45:03,715 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-26 10:45:03,715 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 369 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-26 10:45:03,716 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-26 10:45:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2023-11-26 10:45:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1236. [2023-11-26 10:45:03,787 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-26 10:45:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-26 10:45:03,793 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 79 [2023-11-26 10:45:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:03,793 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-26 10:45:03,793 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-26 10:45:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-26 10:45:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-26 10:45:03,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:03,796 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-26 10:45:03,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:45:03,797 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-26 10:45:03,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash -63426306, now seen corresponding path program 1 times [2023-11-26 10:45:03,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500267180] [2023-11-26 10:45:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:04,025 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-26 10:45:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500267180] [2023-11-26 10:45:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500267180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:45:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633513900] [2023-11-26 10:45:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:04,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:04,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:04,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:04,028 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-26 10:45:04,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:04,422 INFO L93 Difference]: Finished difference Result 3873 states and 5447 transitions. [2023-11-26 10:45:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:04,423 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-26 10:45:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:04,444 INFO L225 Difference]: With dead ends: 3873 [2023-11-26 10:45:04,444 INFO L226 Difference]: Without dead ends: 3688 [2023-11-26 10:45:04,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:45:04,446 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-26 10:45:04,447 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-26 10:45:04,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2023-11-26 10:45:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 1236. [2023-11-26 10:45:04,558 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-26 10:45:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-26 10:45:04,564 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-26 10:45:04,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:04,564 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-26 10:45:04,564 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-26 10:45:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-26 10:45:04,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-26 10:45:04,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:04,569 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-26 10:45:04,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:45:04,570 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-26 10:45:04,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1996327789, now seen corresponding path program 1 times [2023-11-26 10:45:04,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:04,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134803777] [2023-11-26 10:45:04,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:04,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:04,818 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-26 10:45:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134803777] [2023-11-26 10:45:04,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134803777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:04,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:04,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126464481] [2023-11-26 10:45:04,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:04,822 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-26 10:45:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:05,299 INFO L93 Difference]: Finished difference Result 3865 states and 5435 transitions. [2023-11-26 10:45:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:05,300 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-26 10:45:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:05,321 INFO L225 Difference]: With dead ends: 3865 [2023-11-26 10:45:05,322 INFO L226 Difference]: Without dead ends: 3671 [2023-11-26 10:45:05,323 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-26 10:45:05,324 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-26 10:45:05,325 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-26 10:45:05,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2023-11-26 10:45:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 1236. [2023-11-26 10:45:05,457 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-26 10:45:05,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1743 transitions. [2023-11-26 10:45:05,464 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1743 transitions. Word has length 85 [2023-11-26 10:45:05,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:05,465 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1743 transitions. [2023-11-26 10:45:05,465 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-26 10:45:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1743 transitions. [2023-11-26 10:45:05,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 10:45:05,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:05,468 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-26 10:45:05,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:45:05,471 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-26 10:45:05,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:05,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1662703805, now seen corresponding path program 1 times [2023-11-26 10:45:05,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:05,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748955282] [2023-11-26 10:45:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:05,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:05,754 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-26 10:45:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748955282] [2023-11-26 10:45:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748955282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924824337] [2023-11-26 10:45:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:05,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:05,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:45:05,758 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-26 10:45:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:06,038 INFO L93 Difference]: Finished difference Result 3046 states and 4095 transitions. [2023-11-26 10:45:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:06,039 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-26 10:45:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:06,050 INFO L225 Difference]: With dead ends: 3046 [2023-11-26 10:45:06,050 INFO L226 Difference]: Without dead ends: 1862 [2023-11-26 10:45:06,052 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-26 10:45:06,053 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-26 10:45:06,053 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-26 10:45:06,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2023-11-26 10:45:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1402. [2023-11-26 10:45:06,171 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-26 10:45:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-26 10:45:06,177 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-26 10:45:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:06,177 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-26 10:45:06,178 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-26 10:45:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-26 10:45:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 10:45:06,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:06,181 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-26 10:45:06,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:45:06,181 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-26 10:45:06,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:06,181 INFO L85 PathProgramCache]: Analyzing trace with hash -534350089, now seen corresponding path program 1 times [2023-11-26 10:45:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:06,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213477385] [2023-11-26 10:45:06,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:06,429 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-26 10:45:06,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213477385] [2023-11-26 10:45:06,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213477385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:06,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:06,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:06,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670535874] [2023-11-26 10:45:06,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:45:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:45:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:06,432 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-26 10:45:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:07,218 INFO L93 Difference]: Finished difference Result 5727 states and 7333 transitions. [2023-11-26 10:45:07,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:45:07,218 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-26 10:45:07,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:07,249 INFO L225 Difference]: With dead ends: 5727 [2023-11-26 10:45:07,250 INFO L226 Difference]: Without dead ends: 5604 [2023-11-26 10:45:07,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:07,253 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.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:07,253 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.4s Time] [2023-11-26 10:45:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5604 states. [2023-11-26 10:45:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5604 to 1402. [2023-11-26 10:45:07,480 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-26 10:45:07,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-26 10:45:07,486 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-26 10:45:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:07,487 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-26 10:45:07,487 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-26 10:45:07,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-26 10:45:07,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 10:45:07,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:07,490 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-26 10:45:07,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:45:07,491 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-26 10:45:07,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:07,491 INFO L85 PathProgramCache]: Analyzing trace with hash -538752441, now seen corresponding path program 1 times [2023-11-26 10:45:07,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:07,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887695078] [2023-11-26 10:45:07,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:07,754 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-26 10:45:07,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:07,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887695078] [2023-11-26 10:45:07,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887695078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:07,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:45:07,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075533229] [2023-11-26 10:45:07,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:07,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:45:07,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:45:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:07,758 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-26 10:45:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:08,594 INFO L93 Difference]: Finished difference Result 5793 states and 7408 transitions. [2023-11-26 10:45:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:45:08,595 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-26 10:45:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:08,642 INFO L225 Difference]: With dead ends: 5793 [2023-11-26 10:45:08,643 INFO L226 Difference]: Without dead ends: 5577 [2023-11-26 10:45:08,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:08,645 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.4s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:08,646 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.4s Time] [2023-11-26 10:45:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5577 states. [2023-11-26 10:45:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5577 to 1402. [2023-11-26 10:45:08,801 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-26 10:45:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 1801 transitions. [2023-11-26 10:45:08,807 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 1801 transitions. Word has length 88 [2023-11-26 10:45:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:08,807 INFO L495 AbstractCegarLoop]: Abstraction has 1402 states and 1801 transitions. [2023-11-26 10:45:08,807 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-26 10:45:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 1801 transitions. [2023-11-26 10:45:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 10:45:08,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:08,810 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-26 10:45:08,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 10:45:08,811 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-26 10:45:08,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash -697419044, now seen corresponding path program 1 times [2023-11-26 10:45:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:08,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037087663] [2023-11-26 10:45:08,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:08,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:09,074 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-26 10:45:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037087663] [2023-11-26 10:45:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037087663] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:09,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659639301] [2023-11-26 10:45:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:09,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:09,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:09,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:09,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 10:45:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:09,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 10:45:09,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:09,261 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-26 10:45:09,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:09,391 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-26 10:45:09,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659639301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:45:09,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:45:09,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 5] total 10 [2023-11-26 10:45:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216915322] [2023-11-26 10:45:09,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:45:09,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 10:45:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:09,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 10:45:09,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-26 10:45:09,397 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-26 10:45:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:10,682 INFO L93 Difference]: Finished difference Result 4640 states and 6185 transitions. [2023-11-26 10:45:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-26 10:45:10,682 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-26 10:45:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:10,689 INFO L225 Difference]: With dead ends: 4640 [2023-11-26 10:45:10,689 INFO L226 Difference]: Without dead ends: 3245 [2023-11-26 10:45:10,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-11-26 10:45:10,694 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 707 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:10,694 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.7s Time] [2023-11-26 10:45:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2023-11-26 10:45:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2598. [2023-11-26 10:45:10,930 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-26 10:45:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 3156 transitions. [2023-11-26 10:45:10,942 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 3156 transitions. Word has length 88 [2023-11-26 10:45:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:10,943 INFO L495 AbstractCegarLoop]: Abstraction has 2598 states and 3156 transitions. [2023-11-26 10:45:10,943 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-26 10:45:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 3156 transitions. [2023-11-26 10:45:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-26 10:45:10,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:10,947 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-26 10:45:10,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-26 10:45:11,155 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-26 10:45:11,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash 373515176, now seen corresponding path program 1 times [2023-11-26 10:45:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:11,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684150108] [2023-11-26 10:45:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:11,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:11,354 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-26 10:45:11,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684150108] [2023-11-26 10:45:11,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684150108] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:11,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468206293] [2023-11-26 10:45:11,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:11,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:11,359 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:11,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 10:45:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:11,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-26 10:45:11,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:11,524 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-26 10:45:11,525 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468206293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:45:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2023-11-26 10:45:11,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191254906] [2023-11-26 10:45:11,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:11,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:45:11,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:45:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-26 10:45:11,527 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-26 10:45:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:12,033 INFO L93 Difference]: Finished difference Result 5361 states and 6497 transitions. [2023-11-26 10:45:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:45:12,034 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-26 10:45:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:12,043 INFO L225 Difference]: With dead ends: 5361 [2023-11-26 10:45:12,043 INFO L226 Difference]: Without dead ends: 4882 [2023-11-26 10:45:12,046 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-26 10:45:12,047 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-26 10:45:12,047 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-26 10:45:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states. [2023-11-26 10:45:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3946. [2023-11-26 10:45:12,405 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-26 10:45:12,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 4827 transitions. [2023-11-26 10:45:12,416 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 4827 transitions. Word has length 88 [2023-11-26 10:45:12,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:12,416 INFO L495 AbstractCegarLoop]: Abstraction has 3946 states and 4827 transitions. [2023-11-26 10:45:12,416 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-26 10:45:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 4827 transitions. [2023-11-26 10:45:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-26 10:45:12,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:12,422 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-26 10:45:12,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-26 10:45:12,636 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-26 10:45:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 837868115, now seen corresponding path program 1 times [2023-11-26 10:45:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101980330] [2023-11-26 10:45:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-26 10:45:12,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:12,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101980330] [2023-11-26 10:45:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101980330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:12,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186206265] [2023-11-26 10:45:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:12,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:12,821 INFO L87 Difference]: Start difference. First operand 3946 states and 4827 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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-26 10:45:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:12,956 INFO L93 Difference]: Finished difference Result 3961 states and 4845 transitions. [2023-11-26 10:45:12,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:12,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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 90 [2023-11-26 10:45:12,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:12,959 INFO L225 Difference]: With dead ends: 3961 [2023-11-26 10:45:12,959 INFO L226 Difference]: Without dead ends: 964 [2023-11-26 10:45:12,962 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-26 10:45:12,963 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:12,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 10:45:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2023-11-26 10:45:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2023-11-26 10:45:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 963 states have (on average 1.1754932502596054) internal successors, (1132), 963 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1132 transitions. [2023-11-26 10:45:13,083 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1132 transitions. Word has length 90 [2023-11-26 10:45:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:13,084 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1132 transitions. [2023-11-26 10:45:13,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 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-26 10:45:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1132 transitions. [2023-11-26 10:45:13,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-26 10:45:13,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:13,089 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-26 10:45:13,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:45:13,089 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-26 10:45:13,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 341912899, now seen corresponding path program 1 times [2023-11-26 10:45:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464975708] [2023-11-26 10:45:13,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-26 10:45:13,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:13,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464975708] [2023-11-26 10:45:13,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464975708] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:13,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124756662] [2023-11-26 10:45:13,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:13,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:13,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:13,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-26 10:45:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:13,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-26 10:45:13,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:13,836 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-26 10:45:13,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:14,214 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-26 10:45:14,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124756662] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:45:14,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:45:14,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 19 [2023-11-26 10:45:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834214648] [2023-11-26 10:45:14,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:45:14,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-26 10:45:14,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:14,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-26 10:45:14,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2023-11-26 10:45:14,216 INFO L87 Difference]: Start difference. First operand 964 states and 1132 transitions. Second operand has 20 states, 20 states have (on average 11.35) internal successors, (227), 19 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:16,314 INFO L93 Difference]: Finished difference Result 2175 states and 2494 transitions. [2023-11-26 10:45:16,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-26 10:45:16,320 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 19 states have internal predecessors, (227), 0 states have call successors, (0), 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-26 10:45:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:16,324 INFO L225 Difference]: With dead ends: 2175 [2023-11-26 10:45:16,324 INFO L226 Difference]: Without dead ends: 1765 [2023-11-26 10:45:16,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=733, Invalid=2129, Unknown=0, NotChecked=0, Total=2862 [2023-11-26 10:45:16,327 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 913 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:16,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1977 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:45:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2023-11-26 10:45:16,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 940. [2023-11-26 10:45:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 1.1352502662406816) internal successors, (1066), 939 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1066 transitions. [2023-11-26 10:45:16,440 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1066 transitions. Word has length 90 [2023-11-26 10:45:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:16,441 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1066 transitions. [2023-11-26 10:45:16,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.35) internal successors, (227), 19 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:16,458 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1066 transitions. [2023-11-26 10:45:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-26 10:45:16,460 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:16,460 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:45:16,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:16,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-26 10:45:16,677 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-26 10:45:16,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:16,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1509929057, now seen corresponding path program 1 times [2023-11-26 10:45:16,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:16,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679303869] [2023-11-26 10:45:16,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:16,929 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-26 10:45:16,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679303869] [2023-11-26 10:45:16,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679303869] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:16,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644236804] [2023-11-26 10:45:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:16,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:16,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:16,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:16,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-26 10:45:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:17,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-26 10:45:17,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:17,300 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-26 10:45:17,300 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:45:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644236804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 10:45:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-11-26 10:45:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132225287] [2023-11-26 10:45:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:17,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:45:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:45:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:17,304 INFO L87 Difference]: Start difference. First operand 940 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:17,634 INFO L93 Difference]: Finished difference Result 1538 states and 1738 transitions. [2023-11-26 10:45:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:45:17,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2023-11-26 10:45:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:17,638 INFO L225 Difference]: With dead ends: 1538 [2023-11-26 10:45:17,638 INFO L226 Difference]: Without dead ends: 1404 [2023-11-26 10:45:17,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:45:17,641 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 124 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:17,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 472 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-26 10:45:17,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2023-11-26 10:45:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 940. [2023-11-26 10:45:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 939 states have (on average 1.1352502662406816) internal successors, (1066), 939 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1066 transitions. [2023-11-26 10:45:17,777 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1066 transitions. Word has length 91 [2023-11-26 10:45:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:17,778 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1066 transitions. [2023-11-26 10:45:17,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1066 transitions. [2023-11-26 10:45:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-11-26 10:45:17,780 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:17,780 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-26 10:45:17,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:17,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-26 10:45:17,987 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-26 10:45:17,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1820845147, now seen corresponding path program 1 times [2023-11-26 10:45:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:17,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32213879] [2023-11-26 10:45:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-26 10:45:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:18,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32213879] [2023-11-26 10:45:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32213879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:18,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382552819] [2023-11-26 10:45:18,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:18,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:18,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:18,278 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:18,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-26 10:45:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:18,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 10:45:18,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-26 10:45:18,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-26 10:45:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382552819] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:45:19,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:45:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2023-11-26 10:45:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925259215] [2023-11-26 10:45:19,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:45:19,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 10:45:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 10:45:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2023-11-26 10:45:19,055 INFO L87 Difference]: Start difference. First operand 940 states and 1066 transitions. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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-26 10:45:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:20,377 INFO L93 Difference]: Finished difference Result 2335 states and 2635 transitions. [2023-11-26 10:45:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 10:45:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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 94 [2023-11-26 10:45:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:20,381 INFO L225 Difference]: With dead ends: 2335 [2023-11-26 10:45:20,381 INFO L226 Difference]: Without dead ends: 1322 [2023-11-26 10:45:20,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2023-11-26 10:45:20,384 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 1027 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:20,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 886 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:45:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2023-11-26 10:45:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 771. [2023-11-26 10:45:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 1.1337662337662338) internal successors, (873), 770 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:20,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 873 transitions. [2023-11-26 10:45:20,529 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 873 transitions. Word has length 94 [2023-11-26 10:45:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:20,529 INFO L495 AbstractCegarLoop]: Abstraction has 771 states and 873 transitions. [2023-11-26 10:45:20,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 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-26 10:45:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 873 transitions. [2023-11-26 10:45:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-11-26 10:45:20,532 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:20,532 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-26 10:45:20,539 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:20,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:20,738 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-26 10:45:20,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:20,739 INFO L85 PathProgramCache]: Analyzing trace with hash -499738025, now seen corresponding path program 1 times [2023-11-26 10:45:20,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:20,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263756866] [2023-11-26 10:45:20,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:20,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-26 10:45:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263756866] [2023-11-26 10:45:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263756866] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 10:45:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332789227] [2023-11-26 10:45:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:21,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 10:45:21,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:21,169 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 10:45:21,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-26 10:45:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:21,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-26 10:45:21,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:45:21,980 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-26 10:45:21,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 10:45:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 3 proven. 80 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-26 10:45:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332789227] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 10:45:22,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 10:45:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 20 [2023-11-26 10:45:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996051857] [2023-11-26 10:45:22,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 10:45:22,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-26 10:45:22,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:22,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-26 10:45:22,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-11-26 10:45:22,672 INFO L87 Difference]: Start difference. First operand 771 states and 873 transitions. Second operand has 21 states, 21 states have (on average 12.380952380952381) internal successors, (260), 20 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 10:45:24,333 INFO L93 Difference]: Finished difference Result 1561 states and 1714 transitions. [2023-11-26 10:45:24,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-26 10:45:24,334 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 12.380952380952381) internal successors, (260), 20 states have internal predecessors, (260), 0 states have call successors, (0), 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-26 10:45:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 10:45:24,335 INFO L225 Difference]: With dead ends: 1561 [2023-11-26 10:45:24,335 INFO L226 Difference]: Without dead ends: 437 [2023-11-26 10:45:24,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=564, Invalid=1598, Unknown=0, NotChecked=0, Total=2162 [2023-11-26 10:45:24,339 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 1188 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 10:45:24,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1163 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 10:45:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2023-11-26 10:45:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 227. [2023-11-26 10:45:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.1725663716814159) internal successors, (265), 226 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:24,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 265 transitions. [2023-11-26 10:45:24,375 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 265 transitions. Word has length 96 [2023-11-26 10:45:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 10:45:24,376 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 265 transitions. [2023-11-26 10:45:24,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 12.380952380952381) internal successors, (260), 20 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:24,376 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 265 transitions. [2023-11-26 10:45:24,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-26 10:45:24,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 10:45:24,378 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-26 10:45:24,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-26 10:45:24,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-26 10:45:24,584 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-26 10:45:24,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:24,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1184009150, now seen corresponding path program 1 times [2023-11-26 10:45:24,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927851120] [2023-11-26 10:45:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:24,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:45:24,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:45:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:45:24,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:45:24,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:45:24,827 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining) [2023-11-26 10:45:24,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining) [2023-11-26 10:45:24,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining) [2023-11-26 10:45:24,830 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining) [2023-11-26 10:45:24,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining) [2023-11-26 10:45:24,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining) [2023-11-26 10:45:24,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining) [2023-11-26 10:45:24,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining) [2023-11-26 10:45:24,831 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining) [2023-11-26 10:45:24,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining) [2023-11-26 10:45:24,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining) [2023-11-26 10:45:24,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining) [2023-11-26 10:45:24,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining) [2023-11-26 10:45:24,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining) [2023-11-26 10:45:24,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining) [2023-11-26 10:45:24,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining) [2023-11-26 10:45:24,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining) [2023-11-26 10:45:24,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining) [2023-11-26 10:45:24,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining) [2023-11-26 10:45:24,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining) [2023-11-26 10:45:24,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining) [2023-11-26 10:45:24,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining) [2023-11-26 10:45:24,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining) [2023-11-26 10:45:24,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining) [2023-11-26 10:45:24,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining) [2023-11-26 10:45:24,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining) [2023-11-26 10:45:24,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining) [2023-11-26 10:45:24,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining) [2023-11-26 10:45:24,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining) [2023-11-26 10:45:24,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining) [2023-11-26 10:45:24,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining) [2023-11-26 10:45:24,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining) [2023-11-26 10:45:24,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining) [2023-11-26 10:45:24,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining) [2023-11-26 10:45:24,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining) [2023-11-26 10:45:24,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining) [2023-11-26 10:45:24,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining) [2023-11-26 10:45:24,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining) [2023-11-26 10:45:24,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining) [2023-11-26 10:45:24,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining) [2023-11-26 10:45:24,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining) [2023-11-26 10:45:24,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-26 10:45:24,844 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-26 10:45:24,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:45:24,961 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:24,962 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:24,963 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:24,963 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-26 10:45:24,963 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:24,963 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-26 10:45:25,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:45:25 BoogieIcfgContainer [2023-11-26 10:45:25,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:45:25,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:45:25,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:45:25,001 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:45:25,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:44:52" (3/4) ... [2023-11-26 10:45:25,003 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-26 10:45:25,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:25,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:25,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-26 10:45:25,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:25,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated [2023-11-26 10:45:25,045 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated [2023-11-26 10:45:25,162 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:45:25,163 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:45:25,164 INFO L158 Benchmark]: Toolchain (without parser) took 34269.21ms. Allocated memory was 136.3MB in the beginning and 469.8MB in the end (delta: 333.4MB). Free memory was 104.9MB in the beginning and 166.9MB in the end (delta: -62.1MB). Peak memory consumption was 273.6MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,164 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:45:25,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.90ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 91.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.46ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 87.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,170 INFO L158 Benchmark]: Boogie Preprocessor took 66.37ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 84.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,173 INFO L158 Benchmark]: RCFGBuilder took 869.25ms. Allocated memory is still 136.3MB. Free memory was 84.3MB in the beginning and 56.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,173 INFO L158 Benchmark]: TraceAbstraction took 32750.81ms. Allocated memory was 136.3MB in the beginning and 469.8MB in the end (delta: 333.4MB). Free memory was 56.1MB in the beginning and 177.4MB in the end (delta: -121.4MB). Peak memory consumption was 214.8MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,175 INFO L158 Benchmark]: Witness Printer took 162.21ms. Allocated memory is still 469.8MB. Free memory was 177.4MB in the beginning and 166.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 10:45:25,179 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.32ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.90ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 91.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.46ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 87.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.37ms. Allocated memory is still 136.3MB. Free memory was 87.5MB in the beginning and 84.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 869.25ms. Allocated memory is still 136.3MB. Free memory was 84.3MB in the beginning and 56.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 32750.81ms. Allocated memory was 136.3MB in the beginning and 469.8MB in the end (delta: 333.4MB). Free memory was 56.1MB in the beginning and 177.4MB in the end (delta: -121.4MB). Peak memory consumption was 214.8MB. Max. memory is 16.1GB. * Witness Printer took 162.21ms. Allocated memory is still 469.8MB. Free memory was 177.4MB in the beginning and 166.9MB 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~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - 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~nondet1 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet2 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 116]: integer overflow possible integer overflow possible We found a FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, na=4] [L68] nb = (unsigned char)4 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, na=4, nb=4] [L69] COND FALSE !(b3 == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, na=4, nb=4] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=101] [L90] EXPR partial_sum + b0 [L90] partial_sum = partial_sum + b0 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=0, na=4, nb=4, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] COND TRUE i == (unsigned char)1 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0] [L91] EXPR partial_sum + b1 [L91] partial_sum = partial_sum + b1 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0] [L93] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0] [L83] COND TRUE i < na VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] COND TRUE i == (unsigned char)2 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0] [L92] EXPR partial_sum + b2 [L92] partial_sum = partial_sum + b2 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L89] COND TRUE i < nb VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L90] COND FALSE !(i == (unsigned char)0) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L91] COND FALSE !(i == (unsigned char)1) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L92] COND FALSE !(i == (unsigned char)2) VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] COND TRUE i == (unsigned char)3 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0] [L93] EXPR partial_sum + b3 [L93] partial_sum = partial_sum + b3 VAL [\old(a)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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)=234770789, \old(b)=4043419291, a0=234770789, a1=917073, a2=3582, a3=13, a=234770789, b0=4043419291, b1=15794606, b2=61697, b3=241, b=4043419291, 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: 32.5s, OverallIterations: 29, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8639 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8639 mSDsluCounter, 12984 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9427 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6878 IncrementalHoareTripleChecker+Invalid, 7356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 3557 mSDtfsCounter, 6878 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 1282 SyntacticMatches, 7 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2147 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3946occurred in iteration=23, InterpolantAutomatonStates: 280, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 21573 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 2794 NumberOfCodeBlocks, 2794 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3092 ConstructedInterpolants, 0 QuantifiedInterpolants, 12511 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1786 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 43 InterpolantComputations, 23 PerfectInterpolantSequences, 2447/2839 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-26 10:45:25,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f259da7-c588-467c-8a7b-f46273da23bc/bin/uautomizer-verify-VRDe98Ueme/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)