./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.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_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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 b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:48:09,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:48:09,482 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-26 11:48:09,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:48:09,488 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:48:09,518 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:48:09,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:48:09,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:48:09,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:48:09,524 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:48:09,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:48:09,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:48:09,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:48:09,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:48:09,532 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:48:09,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:48:09,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:48:09,534 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:48:09,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:48:09,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:48:09,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:48:09,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:48:09,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:48:09,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:48:09,539 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-26 11:48:09,539 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:48:09,539 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:48:09,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:48:09,540 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:48:09,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:48:09,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:48:09,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:48:09,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:48:09,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:09,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:48:09,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:48:09,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:48:09,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:48:09,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:48:09,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:48:09,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:48:09,545 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:48:09,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:48:09,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:48:09,547 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_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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 -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2023-11-26 11:48:09,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:48:09,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:48:09,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:48:09,836 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:48:09,836 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:48:09,838 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-26 11:48:12,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:48:13,235 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:48:13,236 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-26 11:48:13,244 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/data/0c1e66694/e2b8a3f038e94d9eb75b73e2005a04f2/FLAG51c0b5dae [2023-11-26 11:48:13,259 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/data/0c1e66694/e2b8a3f038e94d9eb75b73e2005a04f2 [2023-11-26 11:48:13,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:48:13,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:48:13,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:13,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:48:13,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:48:13,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf75d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13, skipping insertion in model container [2023-11-26 11:48:13,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,295 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:48:13,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:13,488 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:48:13,513 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:48:13,532 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:48:13,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13 WrapperNode [2023-11-26 11:48:13,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:48:13,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:13,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:48:13,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:48:13,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,574 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 161 [2023-11-26 11:48:13,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:48:13,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:48:13,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:48:13,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:48:13,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,587 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,603 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 11:48:13,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:48:13,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:48:13,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:48:13,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:48:13,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (1/1) ... [2023-11-26 11:48:13,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:48:13,649 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:13,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:48:13,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:48:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:48:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:48:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:48:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:48:13,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-26 11:48:13,704 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-26 11:48:13,771 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:48:13,773 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:48:14,107 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:48:14,134 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:48:14,134 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-26 11:48:14,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:14 BoogieIcfgContainer [2023-11-26 11:48:14,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:48:14,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:48:14,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:48:14,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:48:14,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:48:13" (1/3) ... [2023-11-26 11:48:14,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b4fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:14, skipping insertion in model container [2023-11-26 11:48:14,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:48:13" (2/3) ... [2023-11-26 11:48:14,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282b4fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:48:14, skipping insertion in model container [2023-11-26 11:48:14,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:14" (3/3) ... [2023-11-26 11:48:14,145 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-26 11:48:14,164 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:48:14,164 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2023-11-26 11:48:14,217 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:48:14,224 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;@53c167e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:48:14,224 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-26 11:48:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-26 11:48:14,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:14,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:14,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:14,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1695015777, now seen corresponding path program 1 times [2023-11-26 11:48:14,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:14,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495402714] [2023-11-26 11:48:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:14,495 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 11:48:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495402714] [2023-11-26 11:48:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495402714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:14,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906534889] [2023-11-26 11:48:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:14,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:14,550 INFO L87 Difference]: Start difference. First operand has 107 states, 57 states have (on average 1.894736842105263) internal successors, (108), 90 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:48:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:14,696 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2023-11-26 11:48:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:14,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2023-11-26 11:48:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:14,708 INFO L225 Difference]: With dead ends: 192 [2023-11-26 11:48:14,709 INFO L226 Difference]: Without dead ends: 97 [2023-11-26 11:48:14,713 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 11:48:14,717 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:14,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 128 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-26 11:48:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-26 11:48:14,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5660377358490567) internal successors, (83), 80 states have internal predecessors, (83), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:14,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2023-11-26 11:48:14,776 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 9 [2023-11-26 11:48:14,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:14,777 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2023-11-26 11:48:14,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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 11:48:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2023-11-26 11:48:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:48:14,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:14,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:14,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:48:14,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:14,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:14,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1005883126, now seen corresponding path program 1 times [2023-11-26 11:48:14,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:14,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428547595] [2023-11-26 11:48:14,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:14,824 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 11:48:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428547595] [2023-11-26 11:48:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428547595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:14,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074151895] [2023-11-26 11:48:14,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:14,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:14,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:14,829 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 11:48:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:14,866 INFO L93 Difference]: Finished difference Result 183 states and 226 transitions. [2023-11-26 11:48:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-26 11:48:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:14,868 INFO L225 Difference]: With dead ends: 183 [2023-11-26 11:48:14,869 INFO L226 Difference]: Without dead ends: 97 [2023-11-26 11:48:14,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:14,872 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:14,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-26 11:48:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-26 11:48:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 80 states have internal predecessors, (82), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:14,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2023-11-26 11:48:14,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 10 [2023-11-26 11:48:14,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:14,893 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2023-11-26 11:48:14,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 11:48:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2023-11-26 11:48:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-26 11:48:14,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:14,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:48:14,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:14,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1005881460, now seen corresponding path program 1 times [2023-11-26 11:48:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116511017] [2023-11-26 11:48:14,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:14,963 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 11:48:14,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116511017] [2023-11-26 11:48:14,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116511017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:14,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:48:14,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401084758] [2023-11-26 11:48:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:14,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:14,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:14,973 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 11:48:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:15,064 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2023-11-26 11:48:15,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:15,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2023-11-26 11:48:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:15,067 INFO L225 Difference]: With dead ends: 97 [2023-11-26 11:48:15,067 INFO L226 Difference]: Without dead ends: 92 [2023-11-26 11:48:15,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 11:48:15,069 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:15,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 116 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:15,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-26 11:48:15,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-26 11:48:15,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 75 states have internal predecessors, (77), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2023-11-26 11:48:15,088 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 10 [2023-11-26 11:48:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2023-11-26 11:48:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 11:48:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2023-11-26 11:48:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-26 11:48:15,089 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:15,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:15,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:48:15,090 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:15,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:15,091 INFO L85 PathProgramCache]: Analyzing trace with hash -284438866, now seen corresponding path program 1 times [2023-11-26 11:48:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615966073] [2023-11-26 11:48:15,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:15,160 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 11:48:15,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:15,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615966073] [2023-11-26 11:48:15,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615966073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:15,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:15,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:15,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546583948] [2023-11-26 11:48:15,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:15,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:15,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:15,163 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 11:48:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:15,313 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2023-11-26 11:48:15,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:15,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-26 11:48:15,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:15,315 INFO L225 Difference]: With dead ends: 92 [2023-11-26 11:48:15,316 INFO L226 Difference]: Without dead ends: 84 [2023-11-26 11:48:15,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:48:15,318 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 107 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:15,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 125 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-26 11:48:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-11-26 11:48:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 67 states have internal predecessors, (69), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-26 11:48:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2023-11-26 11:48:15,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 12 [2023-11-26 11:48:15,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:15,337 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2023-11-26 11:48:15,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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 11:48:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2023-11-26 11:48:15,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-26 11:48:15,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:15,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:15,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:48:15,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:15,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:15,340 INFO L85 PathProgramCache]: Analyzing trace with hash -227670169, now seen corresponding path program 1 times [2023-11-26 11:48:15,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:15,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440395219] [2023-11-26 11:48:15,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:15,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:15,420 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 11:48:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:15,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440395219] [2023-11-26 11:48:15,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440395219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:15,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:15,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:15,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081242079] [2023-11-26 11:48:15,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:15,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:15,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:15,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:15,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:48:15,424 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 11:48:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:15,560 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2023-11-26 11:48:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:15,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-26 11:48:15,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:15,562 INFO L225 Difference]: With dead ends: 115 [2023-11-26 11:48:15,563 INFO L226 Difference]: Without dead ends: 108 [2023-11-26 11:48:15,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 11:48:15,565 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 79 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:15,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 198 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-26 11:48:15,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-26 11:48:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-26 11:48:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2023-11-26 11:48:15,590 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 13 [2023-11-26 11:48:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:15,591 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2023-11-26 11:48:15,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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 11:48:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2023-11-26 11:48:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-26 11:48:15,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:15,595 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:15,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:48:15,596 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:15,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:15,597 INFO L85 PathProgramCache]: Analyzing trace with hash -206244278, now seen corresponding path program 1 times [2023-11-26 11:48:15,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885717941] [2023-11-26 11:48:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:15,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:15,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:16,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885717941] [2023-11-26 11:48:16,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885717941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:16,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000632848] [2023-11-26 11:48:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:16,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:16,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:16,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:16,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:48:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:16,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:48:16,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:16,302 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-26 11:48:16,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000632848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:16,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:48:16,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2023-11-26 11:48:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262164785] [2023-11-26 11:48:16,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:16,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:48:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:16,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:48:16,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:48:16,450 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-26 11:48:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:17,651 INFO L93 Difference]: Finished difference Result 456 states and 633 transitions. [2023-11-26 11:48:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-26 11:48:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 69 [2023-11-26 11:48:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:17,662 INFO L225 Difference]: With dead ends: 456 [2023-11-26 11:48:17,662 INFO L226 Difference]: Without dead ends: 450 [2023-11-26 11:48:17,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2023-11-26 11:48:17,676 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 1048 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:17,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 426 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-26 11:48:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-11-26 11:48:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 282. [2023-11-26 11:48:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.2295918367346939) internal successors, (241), 211 states have internal predecessors, (241), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-26 11:48:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 397 transitions. [2023-11-26 11:48:17,809 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 397 transitions. Word has length 69 [2023-11-26 11:48:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:17,810 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 397 transitions. [2023-11-26 11:48:17,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.1) internal successors, (81), 11 states have internal predecessors, (81), 5 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2023-11-26 11:48:17,818 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 397 transitions. [2023-11-26 11:48:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-26 11:48:17,823 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:17,823 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:17,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:18,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:18,033 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:18,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1693853084, now seen corresponding path program 1 times [2023-11-26 11:48:18,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:18,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367943138] [2023-11-26 11:48:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:18,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:48:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 11:48:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-26 11:48:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-26 11:48:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-26 11:48:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-26 11:48:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:18,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367943138] [2023-11-26 11:48:18,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367943138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:18,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:18,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:18,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785832015] [2023-11-26 11:48:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:18,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:18,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:18,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:18,148 INFO L87 Difference]: Start difference. First operand 282 states and 397 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-26 11:48:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:18,240 INFO L93 Difference]: Finished difference Result 402 states and 578 transitions. [2023-11-26 11:48:18,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:18,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2023-11-26 11:48:18,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:18,245 INFO L225 Difference]: With dead ends: 402 [2023-11-26 11:48:18,245 INFO L226 Difference]: Without dead ends: 282 [2023-11-26 11:48:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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 11:48:18,248 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:18,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:18,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-11-26 11:48:18,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2023-11-26 11:48:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 196 states have (on average 1.1989795918367347) internal successors, (235), 211 states have internal predecessors, (235), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-26 11:48:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 391 transitions. [2023-11-26 11:48:18,319 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 391 transitions. Word has length 89 [2023-11-26 11:48:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:18,320 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 391 transitions. [2023-11-26 11:48:18,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-26 11:48:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 391 transitions. [2023-11-26 11:48:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-26 11:48:18,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:18,324 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:18,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:48:18,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:18,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1071833793, now seen corresponding path program 1 times [2023-11-26 11:48:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808966539] [2023-11-26 11:48:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:18,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-26 11:48:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808966539] [2023-11-26 11:48:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808966539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:18,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:18,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064405033] [2023-11-26 11:48:18,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:18,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:18,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:18,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:18,514 INFO L87 Difference]: Start difference. First operand 282 states and 391 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-26 11:48:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:18,564 INFO L93 Difference]: Finished difference Result 282 states and 391 transitions. [2023-11-26 11:48:18,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 90 [2023-11-26 11:48:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:18,570 INFO L225 Difference]: With dead ends: 282 [2023-11-26 11:48:18,570 INFO L226 Difference]: Without dead ends: 281 [2023-11-26 11:48:18,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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 11:48:18,572 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:18,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 114 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-26 11:48:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2023-11-26 11:48:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 196 states have (on average 1.1734693877551021) internal successors, (230), 210 states have internal predecessors, (230), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-26 11:48:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2023-11-26 11:48:18,628 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 90 [2023-11-26 11:48:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:18,631 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2023-11-26 11:48:18,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-26 11:48:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2023-11-26 11:48:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-26 11:48:18,639 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:18,640 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:18,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:48:18,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:18,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890603, now seen corresponding path program 1 times [2023-11-26 11:48:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657982132] [2023-11-26 11:48:18,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-26 11:48:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657982132] [2023-11-26 11:48:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657982132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:18,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:18,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035656233] [2023-11-26 11:48:18,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:18,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:18,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:18,859 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-26 11:48:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:18,907 INFO L93 Difference]: Finished difference Result 281 states and 386 transitions. [2023-11-26 11:48:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 91 [2023-11-26 11:48:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:18,911 INFO L225 Difference]: With dead ends: 281 [2023-11-26 11:48:18,911 INFO L226 Difference]: Without dead ends: 280 [2023-11-26 11:48:18,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 11:48:18,912 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 18 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:18,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-26 11:48:18,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-26 11:48:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1479591836734695) internal successors, (225), 209 states have internal predecessors, (225), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-26 11:48:18,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 381 transitions. [2023-11-26 11:48:18,962 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 381 transitions. Word has length 91 [2023-11-26 11:48:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:18,963 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 381 transitions. [2023-11-26 11:48:18,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 22.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-26 11:48:18,963 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 381 transitions. [2023-11-26 11:48:18,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-26 11:48:18,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:18,965 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:18,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:48:18,966 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:18,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:18,966 INFO L85 PathProgramCache]: Analyzing trace with hash -2010672774, now seen corresponding path program 1 times [2023-11-26 11:48:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431311818] [2023-11-26 11:48:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:18,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-26 11:48:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-26 11:48:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:48:19,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:19,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431311818] [2023-11-26 11:48:19,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431311818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:19,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:19,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:48:19,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509184230] [2023-11-26 11:48:19,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:19,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:19,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:19,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:19,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:19,057 INFO L87 Difference]: Start difference. First operand 280 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:48:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:19,112 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2023-11-26 11:48:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2023-11-26 11:48:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:19,115 INFO L225 Difference]: With dead ends: 376 [2023-11-26 11:48:19,116 INFO L226 Difference]: Without dead ends: 280 [2023-11-26 11:48:19,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 11:48:19,117 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:19,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-26 11:48:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2023-11-26 11:48:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 196 states have (on average 1.1224489795918366) internal successors, (220), 209 states have internal predecessors, (220), 78 states have call successors, (78), 1 states have call predecessors, (78), 1 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-26 11:48:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 376 transitions. [2023-11-26 11:48:19,163 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 376 transitions. Word has length 103 [2023-11-26 11:48:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:19,164 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 376 transitions. [2023-11-26 11:48:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:48:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 376 transitions. [2023-11-26 11:48:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-26 11:48:19,166 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:19,166 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:19,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:48:19,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:19,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2146032074, now seen corresponding path program 1 times [2023-11-26 11:48:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511632602] [2023-11-26 11:48:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:19,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:48:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 11:48:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:48:19,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511632602] [2023-11-26 11:48:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511632602] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:19,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:48:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:48:19,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838240133] [2023-11-26 11:48:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:19,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:48:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:48:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:48:19,300 INFO L87 Difference]: Start difference. First operand 280 states and 376 transitions. Second operand has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:48:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:19,359 INFO L93 Difference]: Finished difference Result 341 states and 455 transitions. [2023-11-26 11:48:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:48:19,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2023-11-26 11:48:19,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:19,363 INFO L225 Difference]: With dead ends: 341 [2023-11-26 11:48:19,363 INFO L226 Difference]: Without dead ends: 339 [2023-11-26 11:48:19,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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 11:48:19,365 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:19,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 177 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-26 11:48:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 338. [2023-11-26 11:48:19,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.1097560975609757) internal successors, (273), 258 states have internal predecessors, (273), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2023-11-26 11:48:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 445 transitions. [2023-11-26 11:48:19,418 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 445 transitions. Word has length 105 [2023-11-26 11:48:19,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:19,419 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 445 transitions. [2023-11-26 11:48:19,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:48:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 445 transitions. [2023-11-26 11:48:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-26 11:48:19,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:19,423 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 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 11:48:19,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:48:19,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:19,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2135030018, now seen corresponding path program 2 times [2023-11-26 11:48:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805612160] [2023-11-26 11:48:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-26 11:48:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:48:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 11:48:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-26 11:48:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 11:48:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-26 11:48:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-26 11:48:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:48:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805612160] [2023-11-26 11:48:19,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805612160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:19,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432809028] [2023-11-26 11:48:19,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:48:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:19,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:19,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:19,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:48:19,869 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:48:19,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:48:19,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 11:48:19,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:20,043 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:48:20,044 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-26 11:48:20,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432809028] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:20,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:48:20,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-11-26 11:48:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672710284] [2023-11-26 11:48:20,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:20,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-26 11:48:20,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-26 11:48:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2023-11-26 11:48:20,293 INFO L87 Difference]: Start difference. First operand 338 states and 445 transitions. Second operand has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-11-26 11:48:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:22,270 INFO L93 Difference]: Finished difference Result 979 states and 1306 transitions. [2023-11-26 11:48:22,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-26 11:48:22,271 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 133 [2023-11-26 11:48:22,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:22,279 INFO L225 Difference]: With dead ends: 979 [2023-11-26 11:48:22,279 INFO L226 Difference]: Without dead ends: 976 [2023-11-26 11:48:22,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=757, Invalid=1499, Unknown=0, NotChecked=0, Total=2256 [2023-11-26 11:48:22,282 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1556 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:22,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 570 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-26 11:48:22,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2023-11-26 11:48:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 765. [2023-11-26 11:48:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 561 states have (on average 1.1105169340463459) internal successors, (623), 587 states have internal predecessors, (623), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2023-11-26 11:48:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1019 transitions. [2023-11-26 11:48:22,426 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1019 transitions. Word has length 133 [2023-11-26 11:48:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:22,427 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1019 transitions. [2023-11-26 11:48:22,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.352941176470588) internal successors, (108), 18 states have internal predecessors, (108), 12 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-11-26 11:48:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1019 transitions. [2023-11-26 11:48:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-26 11:48:22,430 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:22,431 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:22,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:22,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:22,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:22,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:22,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1539023991, now seen corresponding path program 1 times [2023-11-26 11:48:22,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548739334] [2023-11-26 11:48:22,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:22,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:48:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 11:48:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 11:48:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-26 11:48:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 11:48:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-26 11:48:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:48:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-26 11:48:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,816 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:22,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:22,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548739334] [2023-11-26 11:48:22,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548739334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:22,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65120422] [2023-11-26 11:48:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:22,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:22,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:22,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:22,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:48:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:22,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:48:22,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:22,979 INFO L134 CoverageAnalysis]: Checked inductivity of 623 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:22,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:48:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65120422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:48:22,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-26 11:48:22,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-11-26 11:48:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31687784] [2023-11-26 11:48:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:48:22,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:48:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:48:22,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:48:22,983 INFO L87 Difference]: Start difference. First operand 765 states and 1019 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-26 11:48:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:23,089 INFO L93 Difference]: Finished difference Result 766 states and 1019 transitions. [2023-11-26 11:48:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:48:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2023-11-26 11:48:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:23,096 INFO L225 Difference]: With dead ends: 766 [2023-11-26 11:48:23,096 INFO L226 Difference]: Without dead ends: 765 [2023-11-26 11:48:23,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 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 11:48:23,098 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 8 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:23,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 257 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:48:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-26 11:48:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 764. [2023-11-26 11:48:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 561 states have (on average 1.0909090909090908) internal successors, (612), 586 states have internal predecessors, (612), 198 states have call successors, (198), 1 states have call predecessors, (198), 1 states have return successors, (198), 198 states have call predecessors, (198), 198 states have call successors, (198) [2023-11-26 11:48:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1008 transitions. [2023-11-26 11:48:23,224 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1008 transitions. Word has length 147 [2023-11-26 11:48:23,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:23,225 INFO L495 AbstractCegarLoop]: Abstraction has 764 states and 1008 transitions. [2023-11-26 11:48:23,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-26 11:48:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1008 transitions. [2023-11-26 11:48:23,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-26 11:48:23,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:23,229 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:23,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:23,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-26 11:48:23,437 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:23,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:23,437 INFO L85 PathProgramCache]: Analyzing trace with hash 465103665, now seen corresponding path program 1 times [2023-11-26 11:48:23,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666573645] [2023-11-26 11:48:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:48:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 11:48:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 11:48:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-26 11:48:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 11:48:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-26 11:48:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:48:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-26 11:48:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:23,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666573645] [2023-11-26 11:48:23,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666573645] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:23,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152708581] [2023-11-26 11:48:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:23,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:23,603 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:23,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:48:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:23,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:48:23,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:23,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-26 11:48:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152708581] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:23,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:48:23,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-11-26 11:48:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079315940] [2023-11-26 11:48:23,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:23,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:48:23,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:23,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:48:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:23,872 INFO L87 Difference]: Start difference. First operand 764 states and 1008 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-26 11:48:24,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:24,109 INFO L93 Difference]: Finished difference Result 1273 states and 1743 transitions. [2023-11-26 11:48:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:48:24,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) Word has length 148 [2023-11-26 11:48:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:24,120 INFO L225 Difference]: With dead ends: 1273 [2023-11-26 11:48:24,120 INFO L226 Difference]: Without dead ends: 1272 [2023-11-26 11:48:24,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:48:24,122 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 20 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:24,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 278 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:24,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2023-11-26 11:48:24,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1268. [2023-11-26 11:48:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1268 states, 891 states have (on average 1.0875420875420876) internal successors, (969), 943 states have internal predecessors, (969), 372 states have call successors, (372), 1 states have call predecessors, (372), 1 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2023-11-26 11:48:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1713 transitions. [2023-11-26 11:48:24,307 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1713 transitions. Word has length 148 [2023-11-26 11:48:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:24,308 INFO L495 AbstractCegarLoop]: Abstraction has 1268 states and 1713 transitions. [2023-11-26 11:48:24,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 6 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 6 states have call predecessors, (32), 6 states have call successors, (32) [2023-11-26 11:48:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1713 transitions. [2023-11-26 11:48:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2023-11-26 11:48:24,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:24,316 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 30, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 1, 1, 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 11:48:24,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:24,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:24,523 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:24,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash -591541447, now seen corresponding path program 3 times [2023-11-26 11:48:24,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:24,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453257099] [2023-11-26 11:48:24,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:48:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:48:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-26 11:48:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-26 11:48:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-26 11:48:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-26 11:48:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-26 11:48:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-26 11:48:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-26 11:48:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-26 11:48:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-26 11:48:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-26 11:48:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-26 11:48:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-26 11:48:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-26 11:48:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-26 11:48:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-26 11:48:25,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-26 11:48:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-26 11:48:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-26 11:48:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-26 11:48:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-26 11:48:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-26 11:48:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-26 11:48:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2023-11-26 11:48:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453257099] [2023-11-26 11:48:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453257099] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031654210] [2023-11-26 11:48:25,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:48:25,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:25,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:25,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:25,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-26 11:48:25,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-26 11:48:25,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:48:25,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-26 11:48:25,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:25,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2023-11-26 11:48:25,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2364 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 2217 trivial. 0 not checked. [2023-11-26 11:48:26,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031654210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:26,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:48:26,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6, 6] total 24 [2023-11-26 11:48:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064758233] [2023-11-26 11:48:26,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:26,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-26 11:48:26,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:26,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-26 11:48:26,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2023-11-26 11:48:26,088 INFO L87 Difference]: Start difference. First operand 1268 states and 1713 transitions. Second operand has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2023-11-26 11:48:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:26,667 INFO L93 Difference]: Finished difference Result 1345 states and 1801 transitions. [2023-11-26 11:48:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:48:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) Word has length 245 [2023-11-26 11:48:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:26,680 INFO L225 Difference]: With dead ends: 1345 [2023-11-26 11:48:26,680 INFO L226 Difference]: Without dead ends: 1342 [2023-11-26 11:48:26,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 541 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2023-11-26 11:48:26,683 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 251 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:26,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 267 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-26 11:48:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2023-11-26 11:48:26,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 141. [2023-11-26 11:48:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.0693069306930694) internal successors, (108), 107 states have internal predecessors, (108), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-26 11:48:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 184 transitions. [2023-11-26 11:48:26,808 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 184 transitions. Word has length 245 [2023-11-26 11:48:26,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:26,809 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 184 transitions. [2023-11-26 11:48:26,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 6.125) internal successors, (147), 25 states have internal predecessors, (147), 19 states have call successors, (46), 1 states have call predecessors, (46), 2 states have return successors, (46), 17 states have call predecessors, (46), 19 states have call successors, (46) [2023-11-26 11:48:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 184 transitions. [2023-11-26 11:48:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2023-11-26 11:48:26,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:48:26,814 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 36, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:48:26,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:27,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:27,020 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2023-11-26 11:48:27,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:48:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -958996402, now seen corresponding path program 2 times [2023-11-26 11:48:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:48:27,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299287438] [2023-11-26 11:48:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:48:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:48:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:48:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-26 11:48:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-26 11:48:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-26 11:48:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-26 11:48:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:48:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-26 11:48:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-26 11:48:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-26 11:48:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-26 11:48:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-26 11:48:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-26 11:48:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-26 11:48:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-26 11:48:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-26 11:48:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-26 11:48:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-26 11:48:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-26 11:48:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2023-11-26 11:48:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-26 11:48:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-26 11:48:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-11-26 11:48:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-26 11:48:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-26 11:48:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-26 11:48:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-26 11:48:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-26 11:48:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-26 11:48:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-26 11:48:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-26 11:48:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-26 11:48:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-26 11:48:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-26 11:48:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-11-26 11:48:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-26 11:48:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-26 11:48:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:48:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2610 trivial. 0 not checked. [2023-11-26 11:48:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:48:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299287438] [2023-11-26 11:48:27,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299287438] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:48:27,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478582855] [2023-11-26 11:48:27,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:48:27,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:48:27,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:48:27,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:48:27,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-26 11:48:27,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:48:27,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:48:27,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 11:48:27,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:48:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 11:48:27,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:48:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2023-11-26 11:48:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478582855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:48:27,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:48:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-26 11:48:27,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884366407] [2023-11-26 11:48:27,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:48:27,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-26 11:48:27,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:48:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-26 11:48:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-11-26 11:48:27,962 INFO L87 Difference]: Start difference. First operand 141 states and 184 transitions. Second operand has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2023-11-26 11:48:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:48:28,247 INFO L93 Difference]: Finished difference Result 171 states and 226 transitions. [2023-11-26 11:48:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-26 11:48:28,247 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) Word has length 274 [2023-11-26 11:48:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:48:28,252 INFO L225 Difference]: With dead ends: 171 [2023-11-26 11:48:28,252 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:48:28,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=219, Invalid=333, Unknown=0, NotChecked=0, Total=552 [2023-11-26 11:48:28,254 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 49 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:48:28,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 484 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:48:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:48:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:48:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:48:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:48:28,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 274 [2023-11-26 11:48:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:48:28,257 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:48:28,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 14.333333333333334) internal successors, (215), 16 states have internal predecessors, (215), 14 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 14 states have call predecessors, (86), 14 states have call successors, (86) [2023-11-26 11:48:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:48:28,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:48:28,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 30 remaining) [2023-11-26 11:48:28,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 30 remaining) [2023-11-26 11:48:28,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 30 remaining) [2023-11-26 11:48:28,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 30 remaining) [2023-11-26 11:48:28,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 30 remaining) [2023-11-26 11:48:28,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 30 remaining) [2023-11-26 11:48:28,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 30 remaining) [2023-11-26 11:48:28,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 30 remaining) [2023-11-26 11:48:28,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 30 remaining) [2023-11-26 11:48:28,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 30 remaining) [2023-11-26 11:48:28,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 30 remaining) [2023-11-26 11:48:28,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 30 remaining) [2023-11-26 11:48:28,264 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 30 remaining) [2023-11-26 11:48:28,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 30 remaining) [2023-11-26 11:48:28,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 30 remaining) [2023-11-26 11:48:28,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 30 remaining) [2023-11-26 11:48:28,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 30 remaining) [2023-11-26 11:48:28,265 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 30 remaining) [2023-11-26 11:48:28,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 30 remaining) [2023-11-26 11:48:28,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 30 remaining) [2023-11-26 11:48:28,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 30 remaining) [2023-11-26 11:48:28,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 30 remaining) [2023-11-26 11:48:28,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 30 remaining) [2023-11-26 11:48:28,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 30 remaining) [2023-11-26 11:48:28,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 30 remaining) [2023-11-26 11:48:28,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 30 remaining) [2023-11-26 11:48:28,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 30 remaining) [2023-11-26 11:48:28,268 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 30 remaining) [2023-11-26 11:48:28,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 30 remaining) [2023-11-26 11:48:28,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 30 remaining) [2023-11-26 11:48:28,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:48:28,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-26 11:48:28,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 11:48:34,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-26 11:48:34,441 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-26 11:48:34,442 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,443 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse1 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999999) .cse3) (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse0 .cse1 .cse2 (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse3))) [2023-11-26 11:48:34,443 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-26 11:48:34,443 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,444 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 38) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW(line 66) no Hoare annotation was computed. [2023-11-26 11:48:34,444 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 51) no Hoare annotation was computed. [2023-11-26 11:48:34,445 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 11:48:34,445 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,445 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-11-26 11:48:34,445 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,445 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2023-11-26 11:48:34,445 INFO L899 garLoopResultBuilder]: For program point L38-3(line 38) no Hoare annotation was computed. [2023-11-26 11:48:34,445 INFO L899 garLoopResultBuilder]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,446 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point L55-1(line 55) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-11-26 11:48:34,446 INFO L899 garLoopResultBuilder]: For program point L47-1(lines 47 52) no Hoare annotation was computed. [2023-11-26 11:48:34,447 INFO L895 garLoopResultBuilder]: At program point L47-3(lines 47 52) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,447 INFO L895 garLoopResultBuilder]: At program point L47-4(lines 47 52) the Hoare annotation is: (let ((.cse0 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse1 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse4 (<= |ULTIMATE.start_main_~scheme~0#1| 1000000))) (or (and (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) .cse4))) [2023-11-26 11:48:34,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-26 11:48:34,447 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,447 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,447 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-26 11:48:34,447 INFO L899 garLoopResultBuilder]: For program point L56-1(line 56) no Hoare annotation was computed. [2023-11-26 11:48:34,448 INFO L895 garLoopResultBuilder]: At program point L56-2(line 56) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,448 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2023-11-26 11:48:34,454 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-26 11:48:34,454 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-11-26 11:48:34,455 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-26 11:48:34,455 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 55) no Hoare annotation was computed. [2023-11-26 11:48:34,456 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~c~0#1| 2147483642) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000)) [2023-11-26 11:48:34,456 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-26 11:48:34,456 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-26 11:48:34,456 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 65 66) no Hoare annotation was computed. [2023-11-26 11:48:34,456 INFO L899 garLoopResultBuilder]: For program point L65-3(lines 65 77) no Hoare annotation was computed. [2023-11-26 11:48:34,456 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-26 11:48:34,457 INFO L895 garLoopResultBuilder]: At program point L65-5(lines 65 77) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse5 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 2147483642) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-26 11:48:34,457 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-11-26 11:48:34,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-26 11:48:34,457 INFO L895 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,457 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-11-26 11:48:34,457 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-26 11:48:34,458 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,458 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (<= |ULTIMATE.start_main_~cp~0#1| 999998) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,458 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-26 11:48:34,458 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2023-11-26 11:48:34,458 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 43) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point L58-1(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,459 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,460 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW(line 76) no Hoare annotation was computed. [2023-11-26 11:48:34,460 INFO L899 garLoopResultBuilder]: For program point L58-3(line 58) no Hoare annotation was computed. [2023-11-26 11:48:34,460 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW(line 59) no Hoare annotation was computed. [2023-11-26 11:48:34,460 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-26 11:48:34,461 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 56) no Hoare annotation was computed. [2023-11-26 11:48:34,461 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2023-11-26 11:48:34,461 INFO L899 garLoopResultBuilder]: For program point L42-1(line 42) no Hoare annotation was computed. [2023-11-26 11:48:34,461 INFO L895 garLoopResultBuilder]: At program point L42-2(line 42) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,463 INFO L899 garLoopResultBuilder]: For program point L42-3(line 42) no Hoare annotation was computed. [2023-11-26 11:48:34,463 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (<= |ULTIMATE.start_main_~cp~0#1| 1000000)) (.cse5 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse6 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7) (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2023-11-26 11:48:34,463 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-26 11:48:34,464 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~urilen~0#1| 1000000)) (.cse1 (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000))) (.cse2 (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|))) (.cse3 (<= 0 |ULTIMATE.start_main_~cp~0#1|)) (.cse4 (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|)) (.cse5 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse6 (<= |ULTIMATE.start_main_~cp~0#1| 999999)) (.cse7 (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~c~0#1| 999999) .cse7))) [2023-11-26 11:48:34,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW(line 65) no Hoare annotation was computed. [2023-11-26 11:48:34,464 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 42) no Hoare annotation was computed. [2023-11-26 11:48:34,464 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-26 11:48:34,464 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2023-11-26 11:48:34,464 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2023-11-26 11:48:34,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 57) no Hoare annotation was computed. [2023-11-26 11:48:34,465 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-26 11:48:34,465 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-26 11:48:34,465 INFO L895 garLoopResultBuilder]: At program point L43-1(line 43) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~urilen~0#1| 1000000) (<= 0 (+ |ULTIMATE.start_main_~urilen~0#1| 1000000)) (<= 0 (+ 1000000 |ULTIMATE.start_main_~tokenlen~0#1|)) (<= 0 |ULTIMATE.start_main_~cp~0#1|) (or (< |ULTIMATE.start_main_~scheme~0#1| 1000000) |ULTIMATE.start_main_#t~short4#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (<= |ULTIMATE.start_main_~cp~0#1| 999999) (<= |ULTIMATE.start_main_~tokenlen~0#1| 1000000) (<= |ULTIMATE.start_main_~scheme~0#1| 1000000)) [2023-11-26 11:48:34,465 INFO L899 garLoopResultBuilder]: For program point L43-2(line 43) no Hoare annotation was computed. [2023-11-26 11:48:34,465 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 47) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-26 11:48:34,466 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-11-26 11:48:34,467 INFO L899 garLoopResultBuilder]: For program point L12-2(line 12) no Hoare annotation was computed. [2023-11-26 11:48:34,467 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-26 11:48:34,467 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-26 11:48:34,473 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:48:34,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:48:34,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-26 11:48:34,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-26 11:48:34,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated [2023-11-26 11:48:34,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:48:34 BoogieIcfgContainer [2023-11-26 11:48:34,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:48:34,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:48:34,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:48:34,501 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:48:34,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:48:14" (3/4) ... [2023-11-26 11:48:34,503 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:48:34,508 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-26 11:48:34,518 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-26 11:48:34,518 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-26 11:48:34,519 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:48:34,519 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:48:34,652 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:48:34,652 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:48:34,652 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:48:34,654 INFO L158 Benchmark]: Toolchain (without parser) took 21390.22ms. Allocated memory was 155.2MB in the beginning and 413.1MB in the end (delta: 257.9MB). Free memory was 125.7MB in the beginning and 247.7MB in the end (delta: -122.0MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,654 INFO L158 Benchmark]: CDTParser took 1.41ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:48:34,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.75ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 114.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.87ms. Allocated memory is still 155.2MB. Free memory was 114.2MB in the beginning and 112.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,656 INFO L158 Benchmark]: Boogie Preprocessor took 42.45ms. Allocated memory is still 155.2MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,657 INFO L158 Benchmark]: RCFGBuilder took 516.40ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 92.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,657 INFO L158 Benchmark]: TraceAbstraction took 20361.81ms. Allocated memory was 155.2MB in the beginning and 413.1MB in the end (delta: 257.9MB). Free memory was 92.2MB in the beginning and 254.0MB in the end (delta: -161.8MB). Peak memory consumption was 218.8MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,658 INFO L158 Benchmark]: Witness Printer took 152.23ms. Allocated memory is still 413.1MB. Free memory was 254.0MB in the beginning and 247.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 11:48:34,663 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.41ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.75ms. Allocated memory is still 155.2MB. Free memory was 125.7MB in the beginning and 114.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.87ms. Allocated memory is still 155.2MB. Free memory was 114.2MB in the beginning and 112.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.45ms. Allocated memory is still 155.2MB. Free memory was 112.3MB in the beginning and 110.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 516.40ms. Allocated memory is still 155.2MB. Free memory was 110.2MB in the beginning and 92.7MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20361.81ms. Allocated memory was 155.2MB in the beginning and 413.1MB in the end (delta: 257.9MB). Free memory was 92.2MB in the beginning and 254.0MB in the end (delta: -161.8MB). Peak memory consumption was 218.8MB. Max. memory is 16.1GB. * Witness Printer took 152.23ms. Allocated memory is still 413.1MB. Free memory was 254.0MB in the beginning and 247.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short4 could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 59]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 65]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 76]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 30 error locations. Started 1 CEGAR loops. OverallTime: 20.3s, OverallIterations: 16, TraceHistogramMax: 36, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3390 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3310 mSDsluCounter, 3831 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2442 mSDsCounter, 1315 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1503 IncrementalHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1315 mSolverCounterUnsat, 1389 mSDtfsCounter, 1503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2361 GetRequests, 2216 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=14, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 1586 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 169 PreInvPairs, 227 NumberOfFragments, 879 HoareAnnotationTreeSize, 169 FomulaSimplifications, 56677 FormulaSimplificationTreeSizeReduction, 4.4s HoareSimplificationTime, 21 FomulaSimplificationsInter, 10184 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2564 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3406 ConstructedInterpolants, 0 QuantifiedInterpolants, 6197 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1504 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 27 InterpolantComputations, 11 PerfectInterpolantSequences, 19931/21466 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((urilen <= 1000000) && (0 <= (urilen + 1000000))) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (0 <= scheme)) && (cp <= 999999)) && (tokenlen <= 1000000)) && (scheme <= 1000000)) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: ((((((((((urilen <= 1000000) && (0 <= (urilen + 1000000))) && (1 <= c)) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (0 <= scheme)) && (c <= 2147483642)) && (tokenlen <= 1000000)) || ((((((((c == 0) && (urilen <= 1000000)) && (0 <= (urilen + 1000000))) && (0 <= (1000000 + tokenlen))) && (0 <= cp)) && (cp <= 1000000)) && (0 <= scheme)) && (tokenlen <= 1000000))) RESULT: Ultimate proved your program to be correct! [2023-11-26 11:48:34,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93b2220b-1ea4-4719-90c3-e20a218dcbd4/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 Result: TRUE