./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:19,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:19,455 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 23:03:19,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:19,461 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:19,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:19,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:19,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:19,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:19,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:19,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:19,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:19,491 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:19,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:19,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:03:19,493 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:19,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:19,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:19,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:19,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:03:19,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:19,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:03:19,504 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 23:03:19,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:03:19,505 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:19,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:03:19,524 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:19,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:19,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:19,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:19,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:19,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:19,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:19,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:03:19,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:19,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:19,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:19,528 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:03:19,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:19,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:19,529 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:19,529 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_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c114a15ea6b1c9b012290758a6a9559b9c02a944706c9768958a3bd9c86822a7 [2023-11-06 23:03:19,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:19,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:19,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:19,932 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:19,933 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:19,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-06 23:03:23,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:23,403 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:23,413 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/sv-benchmarks/c/systemc/kundu1.cil.c [2023-11-06 23:03:23,430 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/data/51230484e/80ec75d1be524fd290118f23dd40755a/FLAGc35f65a5f [2023-11-06 23:03:23,478 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/data/51230484e/80ec75d1be524fd290118f23dd40755a [2023-11-06 23:03:23,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:23,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:23,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:23,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:23,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:23,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:23,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c09e8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23, skipping insertion in model container [2023-11-06 23:03:23,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:23,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:23,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:23,847 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:23,907 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:23,926 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:23,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23 WrapperNode [2023-11-06 23:03:23,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:23,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:23,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:23,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:23,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:23,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:23,980 INFO L138 Inliner]: procedures = 32, calls = 37, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 271 [2023-11-06 23:03:23,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:23,982 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:23,982 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:23,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:23,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:24,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:24,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:24,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:24,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (1/1) ... [2023-11-06 23:03:24,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:24,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:24,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:24,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:24,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:24,185 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 23:03:24,185 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 23:03:24,185 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 23:03:24,185 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 23:03:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 23:03:24,186 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 23:03:24,186 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 23:03:24,186 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 23:03:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 23:03:24,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 23:03:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:24,187 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 23:03:24,188 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 23:03:24,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:24,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:24,361 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:24,364 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:24,823 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:24,832 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:24,832 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 23:03:24,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:24 BoogieIcfgContainer [2023-11-06 23:03:24,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:24,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:24,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:24,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:24,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:23" (1/3) ... [2023-11-06 23:03:24,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c81c36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:24, skipping insertion in model container [2023-11-06 23:03:24,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:23" (2/3) ... [2023-11-06 23:03:24,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c81c36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:24, skipping insertion in model container [2023-11-06 23:03:24,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:24" (3/3) ... [2023-11-06 23:03:24,856 INFO L112 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2023-11-06 23:03:24,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:24,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-06 23:03:24,934 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:24,941 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d7fbf58, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:24,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-06 23:03:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 104 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-06 23:03:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:03:24,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:24,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:24,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:24,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1980410107, now seen corresponding path program 1 times [2023-11-06 23:03:24,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:24,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007860027] [2023-11-06 23:03:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 23:03:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:03:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:25,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:25,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007860027] [2023-11-06 23:03:25,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007860027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:25,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:25,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184343378] [2023-11-06 23:03:25,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:25,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:25,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:25,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:25,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:25,682 INFO L87 Difference]: Start difference. First operand has 123 states, 93 states have (on average 1.5268817204301075) internal successors, (142), 104 states have internal predecessors, (142), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:26,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:26,179 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2023-11-06 23:03:26,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-06 23:03:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:26,200 INFO L225 Difference]: With dead ends: 360 [2023-11-06 23:03:26,200 INFO L226 Difference]: Without dead ends: 231 [2023-11-06 23:03:26,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:26,212 INFO L413 NwaCegarLoop]: 302 mSDtfsCounter, 321 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:26,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 732 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:03:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-06 23:03:26,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 195. [2023-11-06 23:03:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.4331210191082802) internal successors, (225), 165 states have internal predecessors, (225), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:03:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2023-11-06 23:03:26,334 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 48 [2023-11-06 23:03:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:26,335 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2023-11-06 23:03:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2023-11-06 23:03:26,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:03:26,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:26,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:26,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:26,340 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:26,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 737999430, now seen corresponding path program 1 times [2023-11-06 23:03:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281006204] [2023-11-06 23:03:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:26,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 23:03:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:03:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281006204] [2023-11-06 23:03:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281006204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296443562] [2023-11-06 23:03:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:26,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:26,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:26,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:26,548 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:26,865 INFO L93 Difference]: Finished difference Result 411 states and 568 transitions. [2023-11-06 23:03:26,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-06 23:03:26,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:26,870 INFO L225 Difference]: With dead ends: 411 [2023-11-06 23:03:26,870 INFO L226 Difference]: Without dead ends: 226 [2023-11-06 23:03:26,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:03:26,874 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 99 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:26,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 661 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:26,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-06 23:03:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 198. [2023-11-06 23:03:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 160 states have (on average 1.41875) internal successors, (227), 168 states have internal predecessors, (227), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 23:03:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 267 transitions. [2023-11-06 23:03:26,904 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 267 transitions. Word has length 48 [2023-11-06 23:03:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:26,905 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 267 transitions. [2023-11-06 23:03:26,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 267 transitions. [2023-11-06 23:03:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 23:03:26,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:26,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:26,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:26,908 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:26,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2124202824, now seen corresponding path program 1 times [2023-11-06 23:03:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:26,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068989897] [2023-11-06 23:03:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:26,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 23:03:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-06 23:03:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:27,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:27,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068989897] [2023-11-06 23:03:27,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068989897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:27,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:27,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:27,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278265726] [2023-11-06 23:03:27,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:27,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:27,070 INFO L87 Difference]: Start difference. First operand 198 states and 267 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:27,615 INFO L93 Difference]: Finished difference Result 784 states and 1066 transitions. [2023-11-06 23:03:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:27,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2023-11-06 23:03:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:27,623 INFO L225 Difference]: With dead ends: 784 [2023-11-06 23:03:27,623 INFO L226 Difference]: Without dead ends: 596 [2023-11-06 23:03:27,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:03:27,626 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 505 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:27,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 768 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:03:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2023-11-06 23:03:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 353. [2023-11-06 23:03:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 289 states have (on average 1.3944636678200693) internal successors, (403), 297 states have internal predecessors, (403), 36 states have call successors, (36), 20 states have call predecessors, (36), 20 states have return successors, (38), 36 states have call predecessors, (38), 36 states have call successors, (38) [2023-11-06 23:03:27,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 477 transitions. [2023-11-06 23:03:27,702 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 477 transitions. Word has length 48 [2023-11-06 23:03:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:27,702 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 477 transitions. [2023-11-06 23:03:27,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 477 transitions. [2023-11-06 23:03:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:03:27,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:27,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:03:27,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:27,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 349081956, now seen corresponding path program 1 times [2023-11-06 23:03:27,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342531744] [2023-11-06 23:03:27,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:27,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:27,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342531744] [2023-11-06 23:03:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342531744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:27,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008898139] [2023-11-06 23:03:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:27,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:27,829 INFO L87 Difference]: Start difference. First operand 353 states and 477 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:28,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:28,284 INFO L93 Difference]: Finished difference Result 1262 states and 1742 transitions. [2023-11-06 23:03:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-06 23:03:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:28,296 INFO L225 Difference]: With dead ends: 1262 [2023-11-06 23:03:28,297 INFO L226 Difference]: Without dead ends: 919 [2023-11-06 23:03:28,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:28,310 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 307 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:28,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 785 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2023-11-06 23:03:28,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 782. [2023-11-06 23:03:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 640 states have (on average 1.334375) internal successors, (854), 648 states have internal predecessors, (854), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-11-06 23:03:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1036 transitions. [2023-11-06 23:03:28,471 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1036 transitions. Word has length 50 [2023-11-06 23:03:28,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:28,471 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1036 transitions. [2023-11-06 23:03:28,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1036 transitions. [2023-11-06 23:03:28,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:03:28,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:28,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:28,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:03:28,478 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:28,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:28,479 INFO L85 PathProgramCache]: Analyzing trace with hash 40642947, now seen corresponding path program 1 times [2023-11-06 23:03:28,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408970753] [2023-11-06 23:03:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:28,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408970753] [2023-11-06 23:03:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408970753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:28,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:28,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792588025] [2023-11-06 23:03:28,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:28,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:28,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:28,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:28,629 INFO L87 Difference]: Start difference. First operand 782 states and 1036 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:28,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:28,949 INFO L93 Difference]: Finished difference Result 1635 states and 2234 transitions. [2023-11-06 23:03:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:03:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-06 23:03:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:28,964 INFO L225 Difference]: With dead ends: 1635 [2023-11-06 23:03:28,964 INFO L226 Difference]: Without dead ends: 863 [2023-11-06 23:03:28,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:03:28,972 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:28,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 616 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2023-11-06 23:03:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 800. [2023-11-06 23:03:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 658 states have (on average 1.3191489361702127) internal successors, (868), 666 states have internal predecessors, (868), 84 states have call successors, (84), 50 states have call predecessors, (84), 50 states have return successors, (98), 84 states have call predecessors, (98), 84 states have call successors, (98) [2023-11-06 23:03:29,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1050 transitions. [2023-11-06 23:03:29,112 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1050 transitions. Word has length 50 [2023-11-06 23:03:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:29,112 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1050 transitions. [2023-11-06 23:03:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1050 transitions. [2023-11-06 23:03:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 23:03:29,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:29,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:29,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:03:29,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:29,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash -93370559, now seen corresponding path program 1 times [2023-11-06 23:03:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145174152] [2023-11-06 23:03:29,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:29,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:29,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:29,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145174152] [2023-11-06 23:03:29,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145174152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:29,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:29,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:29,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331339532] [2023-11-06 23:03:29,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:29,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:29,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:29,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:29,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:29,256 INFO L87 Difference]: Start difference. First operand 800 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:29,649 INFO L93 Difference]: Finished difference Result 2356 states and 3166 transitions. [2023-11-06 23:03:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-06 23:03:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:29,662 INFO L225 Difference]: With dead ends: 2356 [2023-11-06 23:03:29,663 INFO L226 Difference]: Without dead ends: 1567 [2023-11-06 23:03:29,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:29,668 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 219 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:29,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 341 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2023-11-06 23:03:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1537. [2023-11-06 23:03:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1537 states, 1259 states have (on average 1.289118347895155) internal successors, (1623), 1271 states have internal predecessors, (1623), 167 states have call successors, (167), 100 states have call predecessors, (167), 103 states have return successors, (233), 167 states have call predecessors, (233), 167 states have call successors, (233) [2023-11-06 23:03:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 2023 transitions. [2023-11-06 23:03:29,937 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 2023 transitions. Word has length 50 [2023-11-06 23:03:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:29,939 INFO L495 AbstractCegarLoop]: Abstraction has 1537 states and 2023 transitions. [2023-11-06 23:03:29,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-06 23:03:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 2023 transitions. [2023-11-06 23:03:29,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 23:03:29,941 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:29,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:29,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:03:29,941 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:29,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 229733577, now seen corresponding path program 1 times [2023-11-06 23:03:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396137248] [2023-11-06 23:03:29,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:29,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396137248] [2023-11-06 23:03:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396137248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463804602] [2023-11-06 23:03:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:30,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:30,009 INFO L87 Difference]: Start difference. First operand 1537 states and 2023 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:30,497 INFO L93 Difference]: Finished difference Result 4093 states and 5453 transitions. [2023-11-06 23:03:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2023-11-06 23:03:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:30,519 INFO L225 Difference]: With dead ends: 4093 [2023-11-06 23:03:30,520 INFO L226 Difference]: Without dead ends: 2700 [2023-11-06 23:03:30,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:30,527 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 180 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:30,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 357 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2023-11-06 23:03:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2594. [2023-11-06 23:03:30,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2131 states have (on average 1.278742374472079) internal successors, (2725), 2146 states have internal predecessors, (2725), 279 states have call successors, (279), 170 states have call predecessors, (279), 176 states have return successors, (398), 279 states have call predecessors, (398), 279 states have call successors, (398) [2023-11-06 23:03:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3402 transitions. [2023-11-06 23:03:30,887 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 3402 transitions. Word has length 51 [2023-11-06 23:03:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:30,887 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 3402 transitions. [2023-11-06 23:03:30,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:30,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 3402 transitions. [2023-11-06 23:03:30,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-06 23:03:30,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:30,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:30,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:03:30,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:30,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:30,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1971660673, now seen corresponding path program 1 times [2023-11-06 23:03:30,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:30,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694756819] [2023-11-06 23:03:30,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:30,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694756819] [2023-11-06 23:03:30,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694756819] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:30,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:30,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085827391] [2023-11-06 23:03:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:30,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:30,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:30,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:30,994 INFO L87 Difference]: Start difference. First operand 2594 states and 3402 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:31,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:31,419 INFO L93 Difference]: Finished difference Result 3062 states and 4057 transitions. [2023-11-06 23:03:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:31,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2023-11-06 23:03:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:31,443 INFO L225 Difference]: With dead ends: 3062 [2023-11-06 23:03:31,443 INFO L226 Difference]: Without dead ends: 3058 [2023-11-06 23:03:31,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:31,447 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:31,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 374 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2023-11-06 23:03:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2939. [2023-11-06 23:03:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2423 states have (on average 1.2736277342137845) internal successors, (3086), 2439 states have internal predecessors, (3086), 311 states have call successors, (311), 190 states have call predecessors, (311), 197 states have return successors, (442), 311 states have call predecessors, (442), 311 states have call successors, (442) [2023-11-06 23:03:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3839 transitions. [2023-11-06 23:03:31,814 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3839 transitions. Word has length 51 [2023-11-06 23:03:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:31,815 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3839 transitions. [2023-11-06 23:03:31,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3839 transitions. [2023-11-06 23:03:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 23:03:31,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:31,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:31,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:03:31,817 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:31,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:31,819 INFO L85 PathProgramCache]: Analyzing trace with hash 395990028, now seen corresponding path program 1 times [2023-11-06 23:03:31,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:31,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822971218] [2023-11-06 23:03:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:31,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:31,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:31,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822971218] [2023-11-06 23:03:31,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822971218] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:31,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:31,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:31,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208068759] [2023-11-06 23:03:31,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:31,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:31,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:31,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:31,925 INFO L87 Difference]: Start difference. First operand 2939 states and 3839 transitions. Second operand has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:32,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:32,538 INFO L93 Difference]: Finished difference Result 5264 states and 6962 transitions. [2023-11-06 23:03:32,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2023-11-06 23:03:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:32,565 INFO L225 Difference]: With dead ends: 5264 [2023-11-06 23:03:32,566 INFO L226 Difference]: Without dead ends: 3386 [2023-11-06 23:03:32,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:32,575 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 305 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:32,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 610 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2023-11-06 23:03:32,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3248. [2023-11-06 23:03:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2679 states have (on average 1.2695035460992907) internal successors, (3401), 2696 states have internal predecessors, (3401), 343 states have call successors, (343), 210 states have call predecessors, (343), 218 states have return successors, (486), 343 states have call predecessors, (486), 343 states have call successors, (486) [2023-11-06 23:03:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4230 transitions. [2023-11-06 23:03:33,010 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4230 transitions. Word has length 59 [2023-11-06 23:03:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:33,011 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 4230 transitions. [2023-11-06 23:03:33,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:33,012 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4230 transitions. [2023-11-06 23:03:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 23:03:33,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:33,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:33,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:03:33,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:33,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -609210758, now seen corresponding path program 1 times [2023-11-06 23:03:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154111500] [2023-11-06 23:03:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:33,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:33,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154111500] [2023-11-06 23:03:33,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154111500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:33,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:33,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390589132] [2023-11-06 23:03:33,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:33,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:33,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:33,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:33,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:33,101 INFO L87 Difference]: Start difference. First operand 3248 states and 4230 transitions. Second operand has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:33,767 INFO L93 Difference]: Finished difference Result 5046 states and 6653 transitions. [2023-11-06 23:03:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:33,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2023-11-06 23:03:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:33,805 INFO L225 Difference]: With dead ends: 5046 [2023-11-06 23:03:33,805 INFO L226 Difference]: Without dead ends: 5044 [2023-11-06 23:03:33,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:33,809 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 322 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:33,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 493 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5044 states. [2023-11-06 23:03:34,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5044 to 4823. [2023-11-06 23:03:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4823 states, 3989 states have (on average 1.266984206568062) internal successors, (5054), 4011 states have internal predecessors, (5054), 503 states have call successors, (503), 310 states have call predecessors, (503), 323 states have return successors, (720), 503 states have call predecessors, (720), 503 states have call successors, (720) [2023-11-06 23:03:34,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4823 states to 4823 states and 6277 transitions. [2023-11-06 23:03:34,393 INFO L78 Accepts]: Start accepts. Automaton has 4823 states and 6277 transitions. Word has length 60 [2023-11-06 23:03:34,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:34,395 INFO L495 AbstractCegarLoop]: Abstraction has 4823 states and 6277 transitions. [2023-11-06 23:03:34,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-06 23:03:34,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4823 states and 6277 transitions. [2023-11-06 23:03:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-06 23:03:34,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:34,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2023-11-06 23:03:34,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:03:34,398 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:34,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1069966793, now seen corresponding path program 1 times [2023-11-06 23:03:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:34,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633104387] [2023-11-06 23:03:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:03:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 23:03:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633104387] [2023-11-06 23:03:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633104387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:34,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:34,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267665484] [2023-11-06 23:03:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:34,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:34,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:34,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:34,503 INFO L87 Difference]: Start difference. First operand 4823 states and 6277 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 23:03:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:35,839 INFO L93 Difference]: Finished difference Result 13328 states and 17731 transitions. [2023-11-06 23:03:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 70 [2023-11-06 23:03:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:35,916 INFO L225 Difference]: With dead ends: 13328 [2023-11-06 23:03:35,917 INFO L226 Difference]: Without dead ends: 8521 [2023-11-06 23:03:35,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:35,937 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 455 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:35,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 606 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2023-11-06 23:03:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8239. [2023-11-06 23:03:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8239 states, 6727 states have (on average 1.2430503939348891) internal successors, (8362), 6799 states have internal predecessors, (8362), 893 states have call successors, (893), 550 states have call predecessors, (893), 611 states have return successors, (1678), 893 states have call predecessors, (1678), 893 states have call successors, (1678) [2023-11-06 23:03:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8239 states to 8239 states and 10933 transitions. [2023-11-06 23:03:37,105 INFO L78 Accepts]: Start accepts. Automaton has 8239 states and 10933 transitions. Word has length 70 [2023-11-06 23:03:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:37,106 INFO L495 AbstractCegarLoop]: Abstraction has 8239 states and 10933 transitions. [2023-11-06 23:03:37,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 23:03:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8239 states and 10933 transitions. [2023-11-06 23:03:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-06 23:03:37,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:37,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:37,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:03:37,116 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:37,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1242824384, now seen corresponding path program 1 times [2023-11-06 23:03:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:37,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065563860] [2023-11-06 23:03:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:03:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:37,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:37,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065563860] [2023-11-06 23:03:37,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065563860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:37,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:37,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:37,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028657573] [2023-11-06 23:03:37,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:37,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:37,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:37,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:37,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:37,224 INFO L87 Difference]: Start difference. First operand 8239 states and 10933 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 23:03:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:38,632 INFO L93 Difference]: Finished difference Result 16593 states and 22002 transitions. [2023-11-06 23:03:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 23:03:38,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 82 [2023-11-06 23:03:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:38,681 INFO L225 Difference]: With dead ends: 16593 [2023-11-06 23:03:38,681 INFO L226 Difference]: Without dead ends: 7947 [2023-11-06 23:03:38,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:03:38,716 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 678 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:38,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 854 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:03:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2023-11-06 23:03:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 7719. [2023-11-06 23:03:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7719 states, 6301 states have (on average 1.228059038247897) internal successors, (7738), 6372 states have internal predecessors, (7738), 834 states have call successors, (834), 515 states have call predecessors, (834), 576 states have return successors, (1435), 834 states have call predecessors, (1435), 834 states have call successors, (1435) [2023-11-06 23:03:39,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7719 states to 7719 states and 10007 transitions. [2023-11-06 23:03:39,837 INFO L78 Accepts]: Start accepts. Automaton has 7719 states and 10007 transitions. Word has length 82 [2023-11-06 23:03:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:39,838 INFO L495 AbstractCegarLoop]: Abstraction has 7719 states and 10007 transitions. [2023-11-06 23:03:39,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-06 23:03:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7719 states and 10007 transitions. [2023-11-06 23:03:39,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-06 23:03:39,849 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:39,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:39,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:03:39,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:39,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1450817259, now seen corresponding path program 1 times [2023-11-06 23:03:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679030704] [2023-11-06 23:03:39,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:03:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 23:03:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 23:03:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-11-06 23:03:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 23:03:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 23:03:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 23:03:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-06 23:03:40,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679030704] [2023-11-06 23:03:40,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679030704] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:40,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615948816] [2023-11-06 23:03:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:40,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:40,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:40,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:40,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:03:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:40,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-06 23:03:40,343 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:40,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615948816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:40,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:40,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-06 23:03:40,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046885538] [2023-11-06 23:03:40,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:40,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:40,346 INFO L87 Difference]: Start difference. First operand 7719 states and 10007 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:41,049 INFO L93 Difference]: Finished difference Result 12033 states and 15714 transitions. [2023-11-06 23:03:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2023-11-06 23:03:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:41,079 INFO L225 Difference]: With dead ends: 12033 [2023-11-06 23:03:41,080 INFO L226 Difference]: Without dead ends: 5587 [2023-11-06 23:03:41,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:41,105 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:41,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 146 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5587 states. [2023-11-06 23:03:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5587 to 5587. [2023-11-06 23:03:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5587 states, 4555 states have (on average 1.2169045005488475) internal successors, (5543), 4604 states have internal predecessors, (5543), 610 states have call successors, (610), 375 states have call predecessors, (610), 414 states have return successors, (977), 610 states have call predecessors, (977), 610 states have call successors, (977) [2023-11-06 23:03:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7130 transitions. [2023-11-06 23:03:41,730 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7130 transitions. Word has length 127 [2023-11-06 23:03:41,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:41,731 INFO L495 AbstractCegarLoop]: Abstraction has 5587 states and 7130 transitions. [2023-11-06 23:03:41,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:41,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7130 transitions. [2023-11-06 23:03:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-11-06 23:03:41,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:41,740 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:41,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 23:03:41,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 23:03:41,949 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:41,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 32864813, now seen corresponding path program 1 times [2023-11-06 23:03:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320524065] [2023-11-06 23:03:41,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:03:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 23:03:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 23:03:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:03:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:03:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 23:03:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 23:03:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320524065] [2023-11-06 23:03:42,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320524065] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:42,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81788632] [2023-11-06 23:03:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:42,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:42,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:42,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:42,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:03:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:42,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:42,521 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-06 23:03:42,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:42,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81788632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:42,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:42,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-06 23:03:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428187792] [2023-11-06 23:03:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:42,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:42,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:42,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:42,526 INFO L87 Difference]: Start difference. First operand 5587 states and 7130 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:43,291 INFO L93 Difference]: Finished difference Result 12745 states and 16166 transitions. [2023-11-06 23:03:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:43,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2023-11-06 23:03:43,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:43,332 INFO L225 Difference]: With dead ends: 12745 [2023-11-06 23:03:43,333 INFO L226 Difference]: Without dead ends: 8431 [2023-11-06 23:03:43,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:43,351 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 284 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-06 23:03:43,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:43,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8431 states. [2023-11-06 23:03:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8431 to 8428. [2023-11-06 23:03:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8428 states, 6846 states have (on average 1.1958808063102542) internal successors, (8187), 6905 states have internal predecessors, (8187), 925 states have call successors, (925), 600 states have call predecessors, (925), 649 states have return successors, (1342), 925 states have call predecessors, (1342), 925 states have call successors, (1342) [2023-11-06 23:03:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8428 states to 8428 states and 10454 transitions. [2023-11-06 23:03:44,523 INFO L78 Accepts]: Start accepts. Automaton has 8428 states and 10454 transitions. Word has length 130 [2023-11-06 23:03:44,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:44,524 INFO L495 AbstractCegarLoop]: Abstraction has 8428 states and 10454 transitions. [2023-11-06 23:03:44,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8428 states and 10454 transitions. [2023-11-06 23:03:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-06 23:03:44,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:44,545 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:44,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:44,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 23:03:44,751 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:44,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,751 INFO L85 PathProgramCache]: Analyzing trace with hash 865439513, now seen corresponding path program 1 times [2023-11-06 23:03:44,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001996748] [2023-11-06 23:03:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:03:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 23:03:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 23:03:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:03:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:03:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 23:03:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-11-06 23:03:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 23:03:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001996748] [2023-11-06 23:03:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001996748] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:44,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914761707] [2023-11-06 23:03:44,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:44,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:44,968 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:44,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:03:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:45,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:45,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-06 23:03:45,243 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:45,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914761707] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:45,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:45,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2023-11-06 23:03:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152549960] [2023-11-06 23:03:45,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:45,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:45,247 INFO L87 Difference]: Start difference. First operand 8428 states and 10454 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:46,209 INFO L93 Difference]: Finished difference Result 13900 states and 17415 transitions. [2023-11-06 23:03:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:46,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 141 [2023-11-06 23:03:46,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:46,237 INFO L225 Difference]: With dead ends: 13900 [2023-11-06 23:03:46,238 INFO L226 Difference]: Without dead ends: 6508 [2023-11-06 23:03:46,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:46,259 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 52 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 278 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-06 23:03:46,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 278 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6508 states. [2023-11-06 23:03:46,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6508 to 6508. [2023-11-06 23:03:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6508 states, 5284 states have (on average 1.2036336109008328) internal successors, (6360), 5333 states have internal predecessors, (6360), 722 states have call successors, (722), 455 states have call predecessors, (722), 494 states have return successors, (1101), 722 states have call predecessors, (1101), 722 states have call successors, (1101) [2023-11-06 23:03:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6508 states to 6508 states and 8183 transitions. [2023-11-06 23:03:46,944 INFO L78 Accepts]: Start accepts. Automaton has 6508 states and 8183 transitions. Word has length 141 [2023-11-06 23:03:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:46,945 INFO L495 AbstractCegarLoop]: Abstraction has 6508 states and 8183 transitions. [2023-11-06 23:03:46,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 23:03:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6508 states and 8183 transitions. [2023-11-06 23:03:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-06 23:03:46,957 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:46,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2023-11-06 23:03:46,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:47,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 23:03:47,164 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:47,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:47,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1011745838, now seen corresponding path program 1 times [2023-11-06 23:03:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:47,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508186444] [2023-11-06 23:03:47,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:03:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-06 23:03:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 23:03:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:03:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-06 23:03:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 23:03:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-06 23:03:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,369 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2023-11-06 23:03:47,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508186444] [2023-11-06 23:03:47,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508186444] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:47,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933840123] [2023-11-06 23:03:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:47,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:47,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:47,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:03:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:47,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 23:03:47,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933840123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 23:03:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464059989] [2023-11-06 23:03:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:47,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:47,606 INFO L87 Difference]: Start difference. First operand 6508 states and 8183 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 23:03:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:48,252 INFO L93 Difference]: Finished difference Result 8734 states and 11097 transitions. [2023-11-06 23:03:48,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2023-11-06 23:03:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:48,270 INFO L225 Difference]: With dead ends: 8734 [2023-11-06 23:03:48,270 INFO L226 Difference]: Without dead ends: 3722 [2023-11-06 23:03:48,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:48,285 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 86 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:48,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 260 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2023-11-06 23:03:48,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3719. [2023-11-06 23:03:48,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3719 states, 3031 states have (on average 1.1956450016496205) internal successors, (3624), 3059 states have internal predecessors, (3624), 406 states have call successors, (406), 255 states have call predecessors, (406), 274 states have return successors, (537), 406 states have call predecessors, (537), 406 states have call successors, (537) [2023-11-06 23:03:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3719 states to 3719 states and 4567 transitions. [2023-11-06 23:03:48,719 INFO L78 Accepts]: Start accepts. Automaton has 3719 states and 4567 transitions. Word has length 151 [2023-11-06 23:03:48,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:48,719 INFO L495 AbstractCegarLoop]: Abstraction has 3719 states and 4567 transitions. [2023-11-06 23:03:48,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 23:03:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 4567 transitions. [2023-11-06 23:03:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 23:03:48,727 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:48,727 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:48,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:48,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 23:03:48,941 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:48,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2052588499, now seen corresponding path program 1 times [2023-11-06 23:03:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231764268] [2023-11-06 23:03:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:03:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 23:03:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 23:03:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 23:03:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:03:49,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 23:03:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 23:03:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:03:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-06 23:03:49,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:49,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231764268] [2023-11-06 23:03:49,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231764268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:49,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197610040] [2023-11-06 23:03:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:49,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:49,188 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:49,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:03:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:49,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-06 23:03:49,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197610040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:49,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-11-06 23:03:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976023849] [2023-11-06 23:03:49,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:49,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:49,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:49,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:49,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:49,356 INFO L87 Difference]: Start difference. First operand 3719 states and 4567 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 23:03:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:49,970 INFO L93 Difference]: Finished difference Result 8907 states and 10999 transitions. [2023-11-06 23:03:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:49,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 164 [2023-11-06 23:03:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:49,996 INFO L225 Difference]: With dead ends: 8907 [2023-11-06 23:03:49,997 INFO L226 Difference]: Without dead ends: 5738 [2023-11-06 23:03:50,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:03:50,006 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 104 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:50,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 391 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2023-11-06 23:03:50,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5728. [2023-11-06 23:03:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5728 states, 4712 states have (on average 1.1808149405772497) internal successors, (5564), 4751 states have internal predecessors, (5564), 581 states have call successors, (581), 397 states have call predecessors, (581), 427 states have return successors, (796), 581 states have call predecessors, (796), 581 states have call successors, (796) [2023-11-06 23:03:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5728 states to 5728 states and 6941 transitions. [2023-11-06 23:03:50,533 INFO L78 Accepts]: Start accepts. Automaton has 5728 states and 6941 transitions. Word has length 164 [2023-11-06 23:03:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:50,534 INFO L495 AbstractCegarLoop]: Abstraction has 5728 states and 6941 transitions. [2023-11-06 23:03:50,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 23:03:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 5728 states and 6941 transitions. [2023-11-06 23:03:50,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-11-06 23:03:50,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:50,542 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:03:50,554 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:50,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 23:03:50,748 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:50,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:50,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1155195221, now seen corresponding path program 1 times [2023-11-06 23:03:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084629071] [2023-11-06 23:03:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:50,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 23:03:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 23:03:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:03:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-06 23:03:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-06 23:03:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-06 23:03:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 23:03:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-06 23:03:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:03:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-11-06 23:03:50,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084629071] [2023-11-06 23:03:50,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084629071] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:50,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011823838] [2023-11-06 23:03:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:50,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:50,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:50,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:50,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:03:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:51,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:03:51,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-06 23:03:51,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011823838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:51,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:51,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2023-11-06 23:03:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314275387] [2023-11-06 23:03:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:03:51,144 INFO L87 Difference]: Start difference. First operand 5728 states and 6941 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:03:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:51,528 INFO L93 Difference]: Finished difference Result 9257 states and 11268 transitions. [2023-11-06 23:03:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:51,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2023-11-06 23:03:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:51,544 INFO L225 Difference]: With dead ends: 9257 [2023-11-06 23:03:51,545 INFO L226 Difference]: Without dead ends: 3544 [2023-11-06 23:03:51,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:03:51,556 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 59 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:51,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 669 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2023-11-06 23:03:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3364. [2023-11-06 23:03:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3364 states, 2871 states have (on average 1.1894810170672239) internal successors, (3415), 2884 states have internal predecessors, (3415), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2023-11-06 23:03:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3364 states to 3364 states and 4071 transitions. [2023-11-06 23:03:51,907 INFO L78 Accepts]: Start accepts. Automaton has 3364 states and 4071 transitions. Word has length 164 [2023-11-06 23:03:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:51,908 INFO L495 AbstractCegarLoop]: Abstraction has 3364 states and 4071 transitions. [2023-11-06 23:03:51,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 5 states have internal predecessors, (115), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 23:03:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3364 states and 4071 transitions. [2023-11-06 23:03:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-06 23:03:51,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:51,914 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:51,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:52,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 23:03:52,120 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:52,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:52,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1903534116, now seen corresponding path program 1 times [2023-11-06 23:03:52,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:52,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970242168] [2023-11-06 23:03:52,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:52,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:03:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:03:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:03:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 23:03:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 23:03:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 23:03:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:03:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 23:03:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-06 23:03:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970242168] [2023-11-06 23:03:52,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970242168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:52,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2618969] [2023-11-06 23:03:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:52,246 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:52,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:03:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:03:52,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2023-11-06 23:03:52,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:52,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2618969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:52,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:52,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-11-06 23:03:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810633636] [2023-11-06 23:03:52,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:52,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:52,543 INFO L87 Difference]: Start difference. First operand 3364 states and 4071 transitions. Second operand has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:03:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:52,891 INFO L93 Difference]: Finished difference Result 3364 states and 4071 transitions. [2023-11-06 23:03:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:52,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 168 [2023-11-06 23:03:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:52,902 INFO L225 Difference]: With dead ends: 3364 [2023-11-06 23:03:52,903 INFO L226 Difference]: Without dead ends: 3362 [2023-11-06 23:03:52,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:52,905 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:52,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 133 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:52,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2023-11-06 23:03:53,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3362. [2023-11-06 23:03:53,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 2871 states have (on average 1.1818181818181819) internal successors, (3393), 2882 states have internal predecessors, (3393), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2023-11-06 23:03:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 4049 transitions. [2023-11-06 23:03:53,251 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 4049 transitions. Word has length 168 [2023-11-06 23:03:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:53,252 INFO L495 AbstractCegarLoop]: Abstraction has 3362 states and 4049 transitions. [2023-11-06 23:03:53,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 58.5) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:03:53,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 4049 transitions. [2023-11-06 23:03:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-11-06 23:03:53,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:53,257 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:53,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:53,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:53,464 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:53,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1449759974, now seen corresponding path program 1 times [2023-11-06 23:03:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060543371] [2023-11-06 23:03:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:53,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:03:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:03:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:03:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-06 23:03:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-06 23:03:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-06 23:03:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:03:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-11-06 23:03:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2023-11-06 23:03:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060543371] [2023-11-06 23:03:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060543371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:53,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509206655] [2023-11-06 23:03:53,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:53,572 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:53,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:03:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:53,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:53,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 23:03:53,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:53,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509206655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:53,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:53,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-06 23:03:53,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57277307] [2023-11-06 23:03:53,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:53,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:53,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:53,744 INFO L87 Difference]: Start difference. First operand 3362 states and 4049 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 23:03:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:54,087 INFO L93 Difference]: Finished difference Result 5976 states and 7312 transitions. [2023-11-06 23:03:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 169 [2023-11-06 23:03:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:54,100 INFO L225 Difference]: With dead ends: 5976 [2023-11-06 23:03:54,100 INFO L226 Difference]: Without dead ends: 3283 [2023-11-06 23:03:54,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:54,107 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 90 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:54,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 347 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:54,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2023-11-06 23:03:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3282. [2023-11-06 23:03:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2791 states have (on average 1.171981368685059) internal successors, (3271), 2802 states have internal predecessors, (3271), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2023-11-06 23:03:54,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 3927 transitions. [2023-11-06 23:03:54,469 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 3927 transitions. Word has length 169 [2023-11-06 23:03:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:54,470 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 3927 transitions. [2023-11-06 23:03:54,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-11-06 23:03:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 3927 transitions. [2023-11-06 23:03:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-06 23:03:54,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:54,475 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:54,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:54,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:54,681 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:54,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:54,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1227816467, now seen corresponding path program 1 times [2023-11-06 23:03:54,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283289377] [2023-11-06 23:03:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:03:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:03:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:03:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:03:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:03:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:03:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:03:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:03:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:03:54,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:54,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283289377] [2023-11-06 23:03:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283289377] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968015329] [2023-11-06 23:03:54,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:54,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:54,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:54,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 23:03:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:54,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 23:03:55,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:03:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968015329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:03:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-06 23:03:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827897892] [2023-11-06 23:03:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:55,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:55,180 INFO L87 Difference]: Start difference. First operand 3282 states and 3927 transitions. Second operand has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:03:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:55,562 INFO L93 Difference]: Finished difference Result 3283 states and 3927 transitions. [2023-11-06 23:03:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 170 [2023-11-06 23:03:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:55,573 INFO L225 Difference]: With dead ends: 3283 [2023-11-06 23:03:55,573 INFO L226 Difference]: Without dead ends: 3281 [2023-11-06 23:03:55,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:55,576 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 113 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:55,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 306 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2023-11-06 23:03:55,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3280. [2023-11-06 23:03:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 2791 states have (on average 1.1648154783231817) internal successors, (3251), 2800 states have internal predecessors, (3251), 275 states have call successors, (275), 177 states have call predecessors, (275), 210 states have return successors, (381), 302 states have call predecessors, (381), 275 states have call successors, (381) [2023-11-06 23:03:55,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 3907 transitions. [2023-11-06 23:03:55,938 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 3907 transitions. Word has length 170 [2023-11-06 23:03:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:55,939 INFO L495 AbstractCegarLoop]: Abstraction has 3280 states and 3907 transitions. [2023-11-06 23:03:55,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 4 states have internal predecessors, (118), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:03:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 3907 transitions. [2023-11-06 23:03:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-06 23:03:55,945 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:55,945 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:55,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-06 23:03:56,151 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:03:56,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 592395441, now seen corresponding path program 1 times [2023-11-06 23:03:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276164050] [2023-11-06 23:03:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:03:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:03:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:03:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:03:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:03:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:03:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:03:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:03:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:03:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:03:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:03:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:03:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:03:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:03:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:03:56,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:56,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276164050] [2023-11-06 23:03:56,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276164050] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:56,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231261360] [2023-11-06 23:03:56,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:56,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:56,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:56,336 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:56,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 23:03:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:56,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:03:56,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-06 23:03:56,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:03:56,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231261360] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:56,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:56,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2023-11-06 23:03:56,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927070626] [2023-11-06 23:03:56,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:56,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:56,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:56,980 INFO L87 Difference]: Start difference. First operand 3280 states and 3907 transitions. Second operand has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2023-11-06 23:03:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:58,853 INFO L93 Difference]: Finished difference Result 10629 states and 12813 transitions. [2023-11-06 23:03:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:03:58,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) Word has length 171 [2023-11-06 23:03:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:58,900 INFO L225 Difference]: With dead ends: 10629 [2023-11-06 23:03:58,900 INFO L226 Difference]: Without dead ends: 10621 [2023-11-06 23:03:58,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:03:58,909 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 490 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:58,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 693 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:03:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10621 states. [2023-11-06 23:03:59,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10621 to 8614. [2023-11-06 23:03:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8614 states, 7397 states have (on average 1.173043125591456) internal successors, (8677), 7420 states have internal predecessors, (8677), 689 states have call successors, (689), 431 states have call predecessors, (689), 524 states have return successors, (1059), 762 states have call predecessors, (1059), 689 states have call successors, (1059) [2023-11-06 23:03:59,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8614 states to 8614 states and 10425 transitions. [2023-11-06 23:03:59,988 INFO L78 Accepts]: Start accepts. Automaton has 8614 states and 10425 transitions. Word has length 171 [2023-11-06 23:03:59,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:59,989 INFO L495 AbstractCegarLoop]: Abstraction has 8614 states and 10425 transitions. [2023-11-06 23:03:59,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 5 states have call successors, (39), 4 states have call predecessors, (39), 3 states have return successors, (39), 5 states have call predecessors, (39), 5 states have call successors, (39) [2023-11-06 23:03:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8614 states and 10425 transitions. [2023-11-06 23:03:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-11-06 23:03:59,995 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:59,996 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2023-11-06 23:04:00,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:00,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 23:04:00,203 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:00,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -206968297, now seen corresponding path program 1 times [2023-11-06 23:04:00,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:00,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276134949] [2023-11-06 23:04:00,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:04:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276134949] [2023-11-06 23:04:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276134949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751122380] [2023-11-06 23:04:00,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:00,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:00,491 INFO L87 Difference]: Start difference. First operand 8614 states and 10425 transitions. Second operand has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:02,275 INFO L93 Difference]: Finished difference Result 23613 states and 28784 transitions. [2023-11-06 23:04:02,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:02,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 180 [2023-11-06 23:04:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:02,343 INFO L225 Difference]: With dead ends: 23613 [2023-11-06 23:04:02,343 INFO L226 Difference]: Without dead ends: 16651 [2023-11-06 23:04:02,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:02,364 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 298 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:02,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 492 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:04:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2023-11-06 23:04:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 10913. [2023-11-06 23:04:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10913 states, 9347 states have (on average 1.1716058628436932) internal successors, (10951), 9378 states have internal predecessors, (10951), 886 states have call successors, (886), 550 states have call predecessors, (886), 676 states have return successors, (1371), 984 states have call predecessors, (1371), 886 states have call successors, (1371) [2023-11-06 23:04:03,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10913 states to 10913 states and 13208 transitions. [2023-11-06 23:04:03,941 INFO L78 Accepts]: Start accepts. Automaton has 10913 states and 13208 transitions. Word has length 180 [2023-11-06 23:04:03,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:03,942 INFO L495 AbstractCegarLoop]: Abstraction has 10913 states and 13208 transitions. [2023-11-06 23:04:03,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 10913 states and 13208 transitions. [2023-11-06 23:04:03,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-11-06 23:04:03,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:03,948 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2023-11-06 23:04:03,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 23:04:03,948 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:03,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -277180787, now seen corresponding path program 1 times [2023-11-06 23:04:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978768177] [2023-11-06 23:04:03,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:03,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:04:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 23:04:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:04:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 23:04:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 23:04:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 23:04:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:04:04,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:04,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978768177] [2023-11-06 23:04:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978768177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:04,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:04:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141990992] [2023-11-06 23:04:04,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:04,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:04,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:04,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:04,147 INFO L87 Difference]: Start difference. First operand 10913 states and 13208 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 23:04:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:05,683 INFO L93 Difference]: Finished difference Result 22699 states and 27573 transitions. [2023-11-06 23:04:05,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:04:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 181 [2023-11-06 23:04:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:05,736 INFO L225 Difference]: With dead ends: 22699 [2023-11-06 23:04:05,736 INFO L226 Difference]: Without dead ends: 14323 [2023-11-06 23:04:05,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-06 23:04:05,757 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 192 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:05,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 862 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14323 states. [2023-11-06 23:04:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14323 to 13835. [2023-11-06 23:04:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13835 states, 11821 states have (on average 1.17155908975552) internal successors, (13849), 11860 states have internal predecessors, (13849), 1142 states have call successors, (1142), 706 states have call predecessors, (1142), 868 states have return successors, (1799), 1268 states have call predecessors, (1799), 1142 states have call successors, (1799) [2023-11-06 23:04:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13835 states to 13835 states and 16790 transitions. [2023-11-06 23:04:07,353 INFO L78 Accepts]: Start accepts. Automaton has 13835 states and 16790 transitions. Word has length 181 [2023-11-06 23:04:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:07,354 INFO L495 AbstractCegarLoop]: Abstraction has 13835 states and 16790 transitions. [2023-11-06 23:04:07,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 6 states have internal predecessors, (110), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 23:04:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 16790 transitions. [2023-11-06 23:04:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-11-06 23:04:07,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:07,358 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:07,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 23:04:07,359 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:07,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1808173409, now seen corresponding path program 1 times [2023-11-06 23:04:07,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:07,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661406718] [2023-11-06 23:04:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:07,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:04:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 23:04:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:04:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 23:04:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 23:04:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 23:04:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:04:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661406718] [2023-11-06 23:04:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661406718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:07,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:07,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226544589] [2023-11-06 23:04:07,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:07,591 INFO L87 Difference]: Start difference. First operand 13835 states and 16790 transitions. Second operand has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:09,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:09,482 INFO L93 Difference]: Finished difference Result 17552 states and 21315 transitions. [2023-11-06 23:04:09,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:09,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 182 [2023-11-06 23:04:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:09,546 INFO L225 Difference]: With dead ends: 17552 [2023-11-06 23:04:09,546 INFO L226 Difference]: Without dead ends: 17550 [2023-11-06 23:04:09,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:09,553 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 254 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:09,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 704 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17550 states. [2023-11-06 23:04:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17550 to 13835. [2023-11-06 23:04:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13835 states, 11821 states have (on average 1.17155908975552) internal successors, (13849), 11860 states have internal predecessors, (13849), 1142 states have call successors, (1142), 706 states have call predecessors, (1142), 868 states have return successors, (1799), 1268 states have call predecessors, (1799), 1142 states have call successors, (1799) [2023-11-06 23:04:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13835 states to 13835 states and 16790 transitions. [2023-11-06 23:04:11,258 INFO L78 Accepts]: Start accepts. Automaton has 13835 states and 16790 transitions. Word has length 182 [2023-11-06 23:04:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:11,259 INFO L495 AbstractCegarLoop]: Abstraction has 13835 states and 16790 transitions. [2023-11-06 23:04:11,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 16790 transitions. [2023-11-06 23:04:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-11-06 23:04:11,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:11,273 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:11,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 23:04:11,274 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:11,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -33185425, now seen corresponding path program 1 times [2023-11-06 23:04:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909007181] [2023-11-06 23:04:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 23:04:11,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 23:04:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:04:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:04:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 23:04:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 23:04:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:04:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 23:04:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-06 23:04:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-06 23:04:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-06 23:04:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-06 23:04:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 23:04:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-06 23:04:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-06 23:04:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-11-06 23:04:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909007181] [2023-11-06 23:04:11,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909007181] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917140899] [2023-11-06 23:04:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:11,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:11,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:11,465 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:11,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 23:04:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:04:11,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-11-06 23:04:11,752 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917140899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 23:04:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593266075] [2023-11-06 23:04:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:11,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:11,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:11,755 INFO L87 Difference]: Start difference. First operand 13835 states and 16790 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 23:04:13,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:13,763 INFO L93 Difference]: Finished difference Result 35722 states and 43466 transitions. [2023-11-06 23:04:13,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:13,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 235 [2023-11-06 23:04:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:13,836 INFO L225 Difference]: With dead ends: 35722 [2023-11-06 23:04:13,837 INFO L226 Difference]: Without dead ends: 22315 [2023-11-06 23:04:13,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:13,867 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 66 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 366 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-06 23:04:13,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 366 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:13,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22315 states. [2023-11-06 23:04:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22315 to 22194. [2023-11-06 23:04:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22194 states, 18888 states have (on average 1.1651842439644218) internal successors, (22008), 18927 states have internal predecessors, (22008), 1920 states have call successors, (1920), 1191 states have call predecessors, (1920), 1382 states have return successors, (2874), 2075 states have call predecessors, (2874), 1920 states have call successors, (2874) [2023-11-06 23:04:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22194 states to 22194 states and 26802 transitions. [2023-11-06 23:04:16,495 INFO L78 Accepts]: Start accepts. Automaton has 22194 states and 26802 transitions. Word has length 235 [2023-11-06 23:04:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:16,495 INFO L495 AbstractCegarLoop]: Abstraction has 22194 states and 26802 transitions. [2023-11-06 23:04:16,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 3 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-06 23:04:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 22194 states and 26802 transitions. [2023-11-06 23:04:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2023-11-06 23:04:16,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:16,508 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:16,516 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:16,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:16,709 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:16,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash -365828563, now seen corresponding path program 1 times [2023-11-06 23:04:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435079698] [2023-11-06 23:04:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 23:04:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 23:04:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:04:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:04:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 23:04:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 23:04:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:04:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 23:04:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-06 23:04:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-06 23:04:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-06 23:04:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2023-11-06 23:04:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 23:04:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-06 23:04:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-06 23:04:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-11-06 23:04:16,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435079698] [2023-11-06 23:04:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435079698] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222595682] [2023-11-06 23:04:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:16,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:16,892 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:16,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 23:04:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:17,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:04:17,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-11-06 23:04:17,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:17,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222595682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:17,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:17,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-11-06 23:04:17,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840270970] [2023-11-06 23:04:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:17,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:17,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:17,115 INFO L87 Difference]: Start difference. First operand 22194 states and 26802 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 23:04:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:17,961 INFO L93 Difference]: Finished difference Result 31176 states and 37731 transitions. [2023-11-06 23:04:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:17,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 235 [2023-11-06 23:04:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:17,994 INFO L225 Difference]: With dead ends: 31176 [2023-11-06 23:04:17,994 INFO L226 Difference]: Without dead ends: 9356 [2023-11-06 23:04:18,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:18,029 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 8 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:18,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:18,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9356 states. [2023-11-06 23:04:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9356 to 9105. [2023-11-06 23:04:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9105 states, 7682 states have (on average 1.1455350169226763) internal successors, (8800), 7714 states have internal predecessors, (8800), 791 states have call successors, (791), 533 states have call predecessors, (791), 628 states have return successors, (1253), 857 states have call predecessors, (1253), 791 states have call successors, (1253) [2023-11-06 23:04:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9105 states to 9105 states and 10844 transitions. [2023-11-06 23:04:19,034 INFO L78 Accepts]: Start accepts. Automaton has 9105 states and 10844 transitions. Word has length 235 [2023-11-06 23:04:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:19,035 INFO L495 AbstractCegarLoop]: Abstraction has 9105 states and 10844 transitions. [2023-11-06 23:04:19,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-06 23:04:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 9105 states and 10844 transitions. [2023-11-06 23:04:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2023-11-06 23:04:19,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:19,044 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:19,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:19,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-06 23:04:19,251 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:19,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:19,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1426093183, now seen corresponding path program 1 times [2023-11-06 23:04:19,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:19,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215447546] [2023-11-06 23:04:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 23:04:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 23:04:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:04:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:04:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 23:04:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 23:04:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:04:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 23:04:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-11-06 23:04:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2023-11-06 23:04:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-06 23:04:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-06 23:04:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 23:04:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-11-06 23:04:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2023-11-06 23:04:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-06 23:04:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 40 proven. 54 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2023-11-06 23:04:19,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215447546] [2023-11-06 23:04:19,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215447546] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:19,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773445708] [2023-11-06 23:04:19,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:19,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:19,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:19,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 23:04:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:19,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 1 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2023-11-06 23:04:19,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:04:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 86 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 23:04:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773445708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:04:20,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:04:20,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-06 23:04:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405956770] [2023-11-06 23:04:20,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:04:20,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:20,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:20,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:20,078 INFO L87 Difference]: Start difference. First operand 9105 states and 10844 transitions. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2023-11-06 23:04:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:21,376 INFO L93 Difference]: Finished difference Result 18024 states and 21426 transitions. [2023-11-06 23:04:21,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 23:04:21,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) Word has length 258 [2023-11-06 23:04:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:21,400 INFO L225 Difference]: With dead ends: 18024 [2023-11-06 23:04:21,400 INFO L226 Difference]: Without dead ends: 9213 [2023-11-06 23:04:21,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 565 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2023-11-06 23:04:21,414 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 294 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:21,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1015 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 23:04:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9213 states. [2023-11-06 23:04:22,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9213 to 9070. [2023-11-06 23:04:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9070 states, 7643 states have (on average 1.121941645950543) internal successors, (8575), 7691 states have internal predecessors, (8575), 784 states have call successors, (784), 528 states have call predecessors, (784), 639 states have return successors, (1058), 850 states have call predecessors, (1058), 784 states have call successors, (1058) [2023-11-06 23:04:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 10417 transitions. [2023-11-06 23:04:22,402 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 10417 transitions. Word has length 258 [2023-11-06 23:04:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:22,403 INFO L495 AbstractCegarLoop]: Abstraction has 9070 states and 10417 transitions. [2023-11-06 23:04:22,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 7 states have internal predecessors, (222), 5 states have call successors, (49), 5 states have call predecessors, (49), 5 states have return successors, (47), 5 states have call predecessors, (47), 5 states have call successors, (47) [2023-11-06 23:04:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 10417 transitions. [2023-11-06 23:04:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-11-06 23:04:22,412 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:22,412 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:22,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:22,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-06 23:04:22,613 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:22,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 656183061, now seen corresponding path program 1 times [2023-11-06 23:04:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232517622] [2023-11-06 23:04:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 23:04:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 23:04:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 23:04:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 23:04:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-06 23:04:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-06 23:04:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-06 23:04:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 23:04:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-06 23:04:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-06 23:04:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-06 23:04:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-11-06 23:04:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-06 23:04:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-06 23:04:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-06 23:04:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 23:04:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-06 23:04:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-06 23:04:22,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232517622] [2023-11-06 23:04:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232517622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:22,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:22,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:22,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933217045] [2023-11-06 23:04:22,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:22,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:22,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:22,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:22,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:22,737 INFO L87 Difference]: Start difference. First operand 9070 states and 10417 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 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-06 23:04:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:23,722 INFO L93 Difference]: Finished difference Result 9387 states and 10771 transitions. [2023-11-06 23:04:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 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 260 [2023-11-06 23:04:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:23,744 INFO L225 Difference]: With dead ends: 9387 [2023-11-06 23:04:23,744 INFO L226 Difference]: Without dead ends: 9103 [2023-11-06 23:04:23,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:23,749 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 168 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:23,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 207 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9103 states. [2023-11-06 23:04:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9103 to 9045. [2023-11-06 23:04:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9045 states, 7624 states have (on average 1.1221143756558236) internal successors, (8555), 7672 states have internal predecessors, (8555), 781 states have call successors, (781), 525 states have call predecessors, (781), 636 states have return successors, (1055), 847 states have call predecessors, (1055), 781 states have call successors, (1055) [2023-11-06 23:04:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 10391 transitions. [2023-11-06 23:04:24,738 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 10391 transitions. Word has length 260 [2023-11-06 23:04:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:24,738 INFO L495 AbstractCegarLoop]: Abstraction has 9045 states and 10391 transitions. [2023-11-06 23:04:24,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 2 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-06 23:04:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 10391 transitions. [2023-11-06 23:04:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-11-06 23:04:24,798 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:24,799 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:24,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-06 23:04:24,800 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:24,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1180723491, now seen corresponding path program 1 times [2023-11-06 23:04:24,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:24,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653795326] [2023-11-06 23:04:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 23:04:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:04:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 23:04:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 23:04:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-06 23:04:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-06 23:04:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 23:04:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-06 23:04:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-06 23:04:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 23:04:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-06 23:04:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-11-06 23:04:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-06 23:04:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-06 23:04:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2023-11-06 23:04:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-06 23:04:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2023-11-06 23:04:25,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:25,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653795326] [2023-11-06 23:04:25,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653795326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:25,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:25,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498476062] [2023-11-06 23:04:25,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:25,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:25,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:25,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:25,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:25,072 INFO L87 Difference]: Start difference. First operand 9045 states and 10391 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:25,942 INFO L93 Difference]: Finished difference Result 9104 states and 10462 transitions. [2023-11-06 23:04:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 265 [2023-11-06 23:04:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:25,961 INFO L225 Difference]: With dead ends: 9104 [2023-11-06 23:04:25,961 INFO L226 Difference]: Without dead ends: 8841 [2023-11-06 23:04:25,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:25,966 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 102 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:25,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 295 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8841 states. [2023-11-06 23:04:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8841 to 8783. [2023-11-06 23:04:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8783 states, 7400 states have (on average 1.122972972972973) internal successors, (8310), 7448 states have internal predecessors, (8310), 760 states have call successors, (760), 510 states have call predecessors, (760), 619 states have return successors, (1032), 824 states have call predecessors, (1032), 760 states have call successors, (1032) [2023-11-06 23:04:26,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8783 states to 8783 states and 10102 transitions. [2023-11-06 23:04:26,790 INFO L78 Accepts]: Start accepts. Automaton has 8783 states and 10102 transitions. Word has length 265 [2023-11-06 23:04:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:26,791 INFO L495 AbstractCegarLoop]: Abstraction has 8783 states and 10102 transitions. [2023-11-06 23:04:26,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 8783 states and 10102 transitions. [2023-11-06 23:04:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-11-06 23:04:26,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:26,800 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:26,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-06 23:04:26,800 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:26,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1681845663, now seen corresponding path program 1 times [2023-11-06 23:04:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45704373] [2023-11-06 23:04:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:04:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 23:04:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 23:04:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:04:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-11-06 23:04:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-11-06 23:04:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-06 23:04:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-11-06 23:04:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2023-11-06 23:04:26,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-11-06 23:04:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-06 23:04:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-06 23:04:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-06 23:04:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-06 23:04:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-11-06 23:04:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-06 23:04:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-06 23:04:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 88 proven. 21 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2023-11-06 23:04:26,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45704373] [2023-11-06 23:04:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45704373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184445633] [2023-11-06 23:04:26,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:26,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:26,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:26,942 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:26,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 23:04:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:27,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:04:27,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2023-11-06 23:04:27,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184445633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-06 23:04:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558553569] [2023-11-06 23:04:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:27,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:27,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:27,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:27,206 INFO L87 Difference]: Start difference. First operand 8783 states and 10102 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 23:04:28,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:28,181 INFO L93 Difference]: Finished difference Result 9151 states and 10521 transitions. [2023-11-06 23:04:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:28,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 279 [2023-11-06 23:04:28,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:28,197 INFO L225 Difference]: With dead ends: 9151 [2023-11-06 23:04:28,197 INFO L226 Difference]: Without dead ends: 8784 [2023-11-06 23:04:28,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:28,199 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 47 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:28,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 345 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:28,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8784 states. [2023-11-06 23:04:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8784 to 8783. [2023-11-06 23:04:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8783 states, 7400 states have (on average 1.1217567567567568) internal successors, (8301), 7448 states have internal predecessors, (8301), 760 states have call successors, (760), 510 states have call predecessors, (760), 619 states have return successors, (1032), 824 states have call predecessors, (1032), 760 states have call successors, (1032) [2023-11-06 23:04:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8783 states to 8783 states and 10093 transitions. [2023-11-06 23:04:28,966 INFO L78 Accepts]: Start accepts. Automaton has 8783 states and 10093 transitions. Word has length 279 [2023-11-06 23:04:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 8783 states and 10093 transitions. [2023-11-06 23:04:28,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 23:04:28,967 INFO L276 IsEmpty]: Start isEmpty. Operand 8783 states and 10093 transitions. [2023-11-06 23:04:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2023-11-06 23:04:28,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:28,974 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:28,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:29,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:29,175 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:29,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1318444317, now seen corresponding path program 1 times [2023-11-06 23:04:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131100030] [2023-11-06 23:04:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 23:04:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 23:04:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 23:04:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-11-06 23:04:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-06 23:04:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-06 23:04:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-11-06 23:04:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-11-06 23:04:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-06 23:04:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-06 23:04:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-06 23:04:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 23:04:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 23:04:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-06 23:04:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-06 23:04:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-06 23:04:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-06 23:04:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-11-06 23:04:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2023-11-06 23:04:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131100030] [2023-11-06 23:04:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131100030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:29,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:29,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383669289] [2023-11-06 23:04:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:29,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:29,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:29,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:29,344 INFO L87 Difference]: Start difference. First operand 8783 states and 10093 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:04:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:30,345 INFO L93 Difference]: Finished difference Result 8841 states and 10164 transitions. [2023-11-06 23:04:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:30,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 283 [2023-11-06 23:04:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:30,368 INFO L225 Difference]: With dead ends: 8841 [2023-11-06 23:04:30,368 INFO L226 Difference]: Without dead ends: 8447 [2023-11-06 23:04:30,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:30,374 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 162 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:30,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 489 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8447 states. [2023-11-06 23:04:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8447 to 8335. [2023-11-06 23:04:31,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8335 states, 7009 states have (on average 1.1218433442716507) internal successors, (7863), 7056 states have internal predecessors, (7863), 729 states have call successors, (729), 488 states have call predecessors, (729), 594 states have return successors, (998), 790 states have call predecessors, (998), 729 states have call successors, (998) [2023-11-06 23:04:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8335 states to 8335 states and 9590 transitions. [2023-11-06 23:04:31,266 INFO L78 Accepts]: Start accepts. Automaton has 8335 states and 9590 transitions. Word has length 283 [2023-11-06 23:04:31,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:31,267 INFO L495 AbstractCegarLoop]: Abstraction has 8335 states and 9590 transitions. [2023-11-06 23:04:31,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:04:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 8335 states and 9590 transitions. [2023-11-06 23:04:31,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2023-11-06 23:04:31,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:31,276 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:31,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-06 23:04:31,277 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:31,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -802938290, now seen corresponding path program 1 times [2023-11-06 23:04:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:31,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372664170] [2023-11-06 23:04:31,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-06 23:04:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-06 23:04:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-06 23:04:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-06 23:04:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-06 23:04:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-06 23:04:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2023-11-06 23:04:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-06 23:04:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-06 23:04:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2023-11-06 23:04:31,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372664170] [2023-11-06 23:04:31,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372664170] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:31,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866603870] [2023-11-06 23:04:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:31,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:31,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:31,492 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:31,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 23:04:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 23:04:31,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-06 23:04:31,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:31,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866603870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2023-11-06 23:04:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897108993] [2023-11-06 23:04:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:31,783 INFO L87 Difference]: Start difference. First operand 8335 states and 9590 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 23:04:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:32,254 INFO L93 Difference]: Finished difference Result 13112 states and 15112 transitions. [2023-11-06 23:04:32,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:32,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 284 [2023-11-06 23:04:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:32,266 INFO L225 Difference]: With dead ends: 13112 [2023-11-06 23:04:32,267 INFO L226 Difference]: Without dead ends: 5023 [2023-11-06 23:04:32,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:32,279 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 329 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-06 23:04:32,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 329 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:32,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2023-11-06 23:04:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4863. [2023-11-06 23:04:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4863 states, 4198 states have (on average 1.1145783706526917) internal successors, (4679), 4200 states have internal predecessors, (4679), 360 states have call successors, (360), 241 states have call predecessors, (360), 302 states have return successors, (460), 421 states have call predecessors, (460), 360 states have call successors, (460) [2023-11-06 23:04:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4863 states to 4863 states and 5499 transitions. [2023-11-06 23:04:32,700 INFO L78 Accepts]: Start accepts. Automaton has 4863 states and 5499 transitions. Word has length 284 [2023-11-06 23:04:32,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:32,701 INFO L495 AbstractCegarLoop]: Abstraction has 4863 states and 5499 transitions. [2023-11-06 23:04:32,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 23:04:32,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4863 states and 5499 transitions. [2023-11-06 23:04:32,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2023-11-06 23:04:32,705 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:32,705 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:32,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:32,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-11-06 23:04:32,906 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:32,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1041547156, now seen corresponding path program 1 times [2023-11-06 23:04:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644488335] [2023-11-06 23:04:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-11-06 23:04:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-06 23:04:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-11-06 23:04:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-06 23:04:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-06 23:04:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-11-06 23:04:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-06 23:04:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-06 23:04:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2023-11-06 23:04:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 77 proven. 10 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2023-11-06 23:04:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:33,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644488335] [2023-11-06 23:04:33,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644488335] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:33,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156846475] [2023-11-06 23:04:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:33,092 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:33,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 23:04:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:33,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:04:33,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2023-11-06 23:04:33,285 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156846475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-11-06 23:04:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588415931] [2023-11-06 23:04:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:33,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:33,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:33,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:33,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:33,289 INFO L87 Difference]: Start difference. First operand 4863 states and 5499 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 23:04:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:33,724 INFO L93 Difference]: Finished difference Result 9226 states and 10507 transitions. [2023-11-06 23:04:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 285 [2023-11-06 23:04:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:33,732 INFO L225 Difference]: With dead ends: 9226 [2023-11-06 23:04:33,732 INFO L226 Difference]: Without dead ends: 4449 [2023-11-06 23:04:33,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:33,738 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 6 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:33,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 523 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4449 states. [2023-11-06 23:04:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4449 to 4449. [2023-11-06 23:04:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4449 states, 3845 states have (on average 1.1092327698309492) internal successors, (4265), 3847 states have internal predecessors, (4265), 344 states have call successors, (344), 241 states have call predecessors, (344), 257 states have return successors, (386), 360 states have call predecessors, (386), 344 states have call successors, (386) [2023-11-06 23:04:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4449 states to 4449 states and 4995 transitions. [2023-11-06 23:04:34,135 INFO L78 Accepts]: Start accepts. Automaton has 4449 states and 4995 transitions. Word has length 285 [2023-11-06 23:04:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 4449 states and 4995 transitions. [2023-11-06 23:04:34,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-06 23:04:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 4449 states and 4995 transitions. [2023-11-06 23:04:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2023-11-06 23:04:34,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:34,139 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:34,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:34,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-11-06 23:04:34,346 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:34,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 702457147, now seen corresponding path program 1 times [2023-11-06 23:04:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:34,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278316328] [2023-11-06 23:04:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-06 23:04:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-06 23:04:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-06 23:04:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 23:04:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-06 23:04:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-06 23:04:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-06 23:04:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-06 23:04:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-06 23:04:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2023-11-06 23:04:34,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:34,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278316328] [2023-11-06 23:04:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278316328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:34,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:34,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:34,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694617009] [2023-11-06 23:04:34,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:34,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:34,511 INFO L87 Difference]: Start difference. First operand 4449 states and 4995 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 23:04:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:35,013 INFO L93 Difference]: Finished difference Result 7181 states and 8058 transitions. [2023-11-06 23:04:35,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:35,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 292 [2023-11-06 23:04:35,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:35,027 INFO L225 Difference]: With dead ends: 7181 [2023-11-06 23:04:35,028 INFO L226 Difference]: Without dead ends: 3273 [2023-11-06 23:04:35,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:35,033 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:35,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 335 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2023-11-06 23:04:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3269. [2023-11-06 23:04:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 2825 states have (on average 1.0976991150442479) internal successors, (3101), 2827 states have internal predecessors, (3101), 252 states have call successors, (252), 177 states have call predecessors, (252), 189 states have return successors, (282), 264 states have call predecessors, (282), 252 states have call successors, (282) [2023-11-06 23:04:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 3635 transitions. [2023-11-06 23:04:35,442 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 3635 transitions. Word has length 292 [2023-11-06 23:04:35,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:35,443 INFO L495 AbstractCegarLoop]: Abstraction has 3269 states and 3635 transitions. [2023-11-06 23:04:35,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-06 23:04:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 3635 transitions. [2023-11-06 23:04:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2023-11-06 23:04:35,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:35,446 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:35,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-06 23:04:35,447 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:35,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash -558094674, now seen corresponding path program 1 times [2023-11-06 23:04:35,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:35,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143825499] [2023-11-06 23:04:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-06 23:04:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-06 23:04:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-06 23:04:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-06 23:04:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-06 23:04:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 23:04:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-06 23:04:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-06 23:04:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-06 23:04:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-06 23:04:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2023-11-06 23:04:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143825499] [2023-11-06 23:04:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143825499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422083476] [2023-11-06 23:04:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:35,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:35,594 INFO L87 Difference]: Start difference. First operand 3269 states and 3635 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 23:04:36,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:36,405 INFO L93 Difference]: Finished difference Result 7506 states and 8375 transitions. [2023-11-06 23:04:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:36,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 304 [2023-11-06 23:04:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:36,413 INFO L225 Difference]: With dead ends: 7506 [2023-11-06 23:04:36,413 INFO L226 Difference]: Without dead ends: 2772 [2023-11-06 23:04:36,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:36,420 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 110 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:36,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 416 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2023-11-06 23:04:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2528. [2023-11-06 23:04:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2159 states have (on average 1.0861509958314035) internal successors, (2345), 2168 states have internal predecessors, (2345), 208 states have call successors, (208), 150 states have call predecessors, (208), 158 states have return successors, (232), 209 states have call predecessors, (232), 208 states have call successors, (232) [2023-11-06 23:04:36,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 2785 transitions. [2023-11-06 23:04:36,692 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 2785 transitions. Word has length 304 [2023-11-06 23:04:36,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:36,693 INFO L495 AbstractCegarLoop]: Abstraction has 2528 states and 2785 transitions. [2023-11-06 23:04:36,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2023-11-06 23:04:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 2785 transitions. [2023-11-06 23:04:36,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2023-11-06 23:04:36,696 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:36,696 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-06 23:04:36,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-06 23:04:36,696 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:36,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1131606491, now seen corresponding path program 1 times [2023-11-06 23:04:36,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:36,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020924194] [2023-11-06 23:04:36,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:36,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:04:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 23:04:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:04:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 23:04:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 23:04:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 23:04:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-11-06 23:04:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2023-11-06 23:04:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-06 23:04:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-06 23:04:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-06 23:04:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-06 23:04:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-11-06 23:04:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-06 23:04:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-06 23:04:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2023-11-06 23:04:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2023-11-06 23:04:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020924194] [2023-11-06 23:04:36,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020924194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:36,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681492084] [2023-11-06 23:04:36,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:36,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:36,867 INFO L87 Difference]: Start difference. First operand 2528 states and 2785 transitions. Second operand has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:04:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:37,378 INFO L93 Difference]: Finished difference Result 2528 states and 2785 transitions. [2023-11-06 23:04:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 314 [2023-11-06 23:04:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:37,384 INFO L225 Difference]: With dead ends: 2528 [2023-11-06 23:04:37,385 INFO L226 Difference]: Without dead ends: 2527 [2023-11-06 23:04:37,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:37,387 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 143 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:37,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 172 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2527 states. [2023-11-06 23:04:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2527 to 2506. [2023-11-06 23:04:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 2138 states have (on average 1.0855940130963517) internal successors, (2321), 2146 states have internal predecessors, (2321), 208 states have call successors, (208), 150 states have call predecessors, (208), 158 states have return successors, (232), 209 states have call predecessors, (232), 208 states have call successors, (232) [2023-11-06 23:04:37,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 2761 transitions. [2023-11-06 23:04:37,810 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 2761 transitions. Word has length 314 [2023-11-06 23:04:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:37,810 INFO L495 AbstractCegarLoop]: Abstraction has 2506 states and 2761 transitions. [2023-11-06 23:04:37,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-06 23:04:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 2761 transitions. [2023-11-06 23:04:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2023-11-06 23:04:37,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:37,816 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 16, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:37,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-06 23:04:37,817 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:37,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:37,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1140000569, now seen corresponding path program 1 times [2023-11-06 23:04:37,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:37,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006276521] [2023-11-06 23:04:37,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:37,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:04:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-06 23:04:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-11-06 23:04:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-11-06 23:04:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-06 23:04:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-06 23:04:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-06 23:04:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-06 23:04:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-06 23:04:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-06 23:04:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-06 23:04:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-11-06 23:04:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 304 [2023-11-06 23:04:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2023-11-06 23:04:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-11-06 23:04:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-11-06 23:04:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2023-11-06 23:04:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2023-11-06 23:04:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 362 [2023-11-06 23:04:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 377 [2023-11-06 23:04:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 405 [2023-11-06 23:04:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 415 [2023-11-06 23:04:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2023-11-06 23:04:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2023-11-06 23:04:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2023-11-06 23:04:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 442 [2023-11-06 23:04:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 452 [2023-11-06 23:04:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2023-11-06 23:04:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 488 [2023-11-06 23:04:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 152 proven. 94 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2023-11-06 23:04:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006276521] [2023-11-06 23:04:38,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006276521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157453126] [2023-11-06 23:04:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:38,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:38,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:38,041 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:38,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 23:04:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:38,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 1199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 23:04:38,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2023-11-06 23:04:38,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157453126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:38,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:38,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2023-11-06 23:04:38,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000279621] [2023-11-06 23:04:38,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:38,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:38,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:38,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:38,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:38,395 INFO L87 Difference]: Start difference. First operand 2506 states and 2761 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 23:04:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:38,646 INFO L93 Difference]: Finished difference Result 3916 states and 4334 transitions. [2023-11-06 23:04:38,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:38,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 507 [2023-11-06 23:04:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:38,650 INFO L225 Difference]: With dead ends: 3916 [2023-11-06 23:04:38,650 INFO L226 Difference]: Without dead ends: 1778 [2023-11-06 23:04:38,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:38,653 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:38,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 216 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2023-11-06 23:04:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2023-11-06 23:04:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1534 states have (on average 1.074315514993481) internal successors, (1648), 1538 states have internal predecessors, (1648), 136 states have call successors, (136), 98 states have call predecessors, (136), 106 states have return successors, (144), 141 states have call predecessors, (144), 136 states have call successors, (144) [2023-11-06 23:04:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1928 transitions. [2023-11-06 23:04:38,840 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1928 transitions. Word has length 507 [2023-11-06 23:04:38,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:38,840 INFO L495 AbstractCegarLoop]: Abstraction has 1778 states and 1928 transitions. [2023-11-06 23:04:38,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2023-11-06 23:04:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1928 transitions. [2023-11-06 23:04:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2023-11-06 23:04:38,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:38,845 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:38,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:39,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-06 23:04:39,046 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:39,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 125707292, now seen corresponding path program 1 times [2023-11-06 23:04:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:39,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533831193] [2023-11-06 23:04:39,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:39,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-06 23:04:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 23:04:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-06 23:04:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 23:04:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-11-06 23:04:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-06 23:04:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-06 23:04:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-06 23:04:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-06 23:04:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-06 23:04:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-06 23:04:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2023-11-06 23:04:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-06 23:04:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-06 23:04:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2023-11-06 23:04:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-06 23:04:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-06 23:04:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2023-11-06 23:04:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2023-11-06 23:04:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-11-06 23:04:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2023-11-06 23:04:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-11-06 23:04:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2023-11-06 23:04:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-11-06 23:04:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-06 23:04:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2023-11-06 23:04:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2023-11-06 23:04:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2023-11-06 23:04:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 418 [2023-11-06 23:04:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 422 [2023-11-06 23:04:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 425 [2023-11-06 23:04:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2023-11-06 23:04:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2023-11-06 23:04:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 456 [2023-11-06 23:04:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2023-11-06 23:04:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2023-11-06 23:04:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 177 proven. 72 refuted. 0 times theorem prover too weak. 1558 trivial. 0 not checked. [2023-11-06 23:04:39,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:39,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533831193] [2023-11-06 23:04:39,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533831193] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:39,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067394400] [2023-11-06 23:04:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:39,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:39,381 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:39,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 23:04:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:39,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:39,680 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1807 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 1509 trivial. 0 not checked. [2023-11-06 23:04:39,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067394400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:39,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-11-06 23:04:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077726406] [2023-11-06 23:04:39,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:39,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:39,817 INFO L87 Difference]: Start difference. First operand 1778 states and 1928 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:39,927 INFO L93 Difference]: Finished difference Result 2260 states and 2449 transitions. [2023-11-06 23:04:39,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 510 [2023-11-06 23:04:39,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:39,929 INFO L225 Difference]: With dead ends: 2260 [2023-11-06 23:04:39,930 INFO L226 Difference]: Without dead ends: 661 [2023-11-06 23:04:39,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:04:39,933 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:39,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 264 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:04:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2023-11-06 23:04:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2023-11-06 23:04:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 567 states have (on average 1.0634920634920635) internal successors, (603), 568 states have internal predecessors, (603), 52 states have call successors, (52), 39 states have call predecessors, (52), 40 states have return successors, (53), 53 states have call predecessors, (53), 52 states have call successors, (53) [2023-11-06 23:04:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 708 transitions. [2023-11-06 23:04:40,012 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 708 transitions. Word has length 510 [2023-11-06 23:04:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:40,012 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 708 transitions. [2023-11-06 23:04:40,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-11-06 23:04:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 708 transitions. [2023-11-06 23:04:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2023-11-06 23:04:40,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:04:40,017 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:40,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-06 23:04:40,225 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2023-11-06 23:04:40,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash 90815994, now seen corresponding path program 1 times [2023-11-06 23:04:40,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:40,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794895284] [2023-11-06 23:04:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 23:04:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 23:04:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-06 23:04:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 23:04:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 23:04:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-06 23:04:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 23:04:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 23:04:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-06 23:04:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-06 23:04:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 23:04:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-06 23:04:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-06 23:04:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 23:04:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-06 23:04:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-11-06 23:04:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-06 23:04:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-11-06 23:04:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-06 23:04:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-06 23:04:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-06 23:04:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2023-11-06 23:04:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2023-11-06 23:04:40,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2023-11-06 23:04:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2023-11-06 23:04:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-11-06 23:04:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-06 23:04:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-06 23:04:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-11-06 23:04:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-11-06 23:04:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 378 [2023-11-06 23:04:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-11-06 23:04:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 429 [2023-11-06 23:04:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 439 [2023-11-06 23:04:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 443 [2023-11-06 23:04:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2023-11-06 23:04:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2023-11-06 23:04:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 467 [2023-11-06 23:04:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 477 [2023-11-06 23:04:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 498 [2023-11-06 23:04:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 512 [2023-11-06 23:04:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1797 trivial. 0 not checked. [2023-11-06 23:04:40,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794895284] [2023-11-06 23:04:40,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794895284] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:04:40,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245904722] [2023-11-06 23:04:40,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:40,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:04:40,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:40,651 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:04:40,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 23:04:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:40,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:40,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:42,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1801 backedges. 1370 proven. 0 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2023-11-06 23:04:42,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:42,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245904722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:42,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 23:04:42,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2023-11-06 23:04:42,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758415219] [2023-11-06 23:04:42,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:42,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:42,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:42,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:42,237 INFO L87 Difference]: Start difference. First operand 661 states and 708 transitions. Second operand has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2023-11-06 23:04:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:04:42,412 INFO L93 Difference]: Finished difference Result 661 states and 708 transitions. [2023-11-06 23:04:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 531 [2023-11-06 23:04:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:04:42,413 INFO L225 Difference]: With dead ends: 661 [2023-11-06 23:04:42,413 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 23:04:42,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 609 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:42,415 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 23 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:04:42,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 388 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:04:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 23:04:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 23:04:42,421 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-06 23:04:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 23:04:42,422 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 531 [2023-11-06 23:04:42,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:04:42,422 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 23:04:42,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.6) internal successors, (273), 5 states have internal predecessors, (273), 4 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2023-11-06 23:04:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 23:04:42,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 23:04:42,425 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2023-11-06 23:04:42,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2023-11-06 23:04:42,426 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2023-11-06 23:04:42,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2023-11-06 23:04:42,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2023-11-06 23:04:42,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2023-11-06 23:04:42,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2023-11-06 23:04:42,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2023-11-06 23:04:42,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-06 23:04:42,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 23:05:49,736 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 123) no Hoare annotation was computed. [2023-11-06 23:05:49,736 INFO L899 garLoopResultBuilder]: For program point L209-1(lines 209 218) no Hoare annotation was computed. [2023-11-06 23:05:49,737 INFO L899 garLoopResultBuilder]: For program point L391(lines 391 395) no Hoare annotation was computed. [2023-11-06 23:05:49,737 INFO L899 garLoopResultBuilder]: For program point L391-2(lines 374 399) no Hoare annotation was computed. [2023-11-06 23:05:49,737 INFO L899 garLoopResultBuilder]: For program point L383(lines 383 387) no Hoare annotation was computed. [2023-11-06 23:05:49,737 INFO L899 garLoopResultBuilder]: For program point L383-2(lines 383 387) no Hoare annotation was computed. [2023-11-06 23:05:49,737 INFO L899 garLoopResultBuilder]: For program point L210(lines 210 215) no Hoare annotation was computed. [2023-11-06 23:05:49,739 INFO L895 garLoopResultBuilder]: At program point L128(lines 116 130) the Hoare annotation is: (let ((.cse13 (= ~P_1_pc~0 1)) (.cse16 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0)) (.cse32 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse33 (= |old(~P_1_st~0)| ~P_1_st~0))) (let ((.cse1 (< ~num~0 1)) (.cse28 (< 1 ~C_1_pc~0)) (.cse24 (< ~C_1_ev~0 2)) (.cse31 (< 2 ~max_loop~0)) (.cse4 (not (= ~C_1_pc~0 1))) (.cse26 (< ~num~0 0)) (.cse25 (< ~P_1_ev~0 2)) (.cse3 (< 1 ~i~0)) (.cse5 (< 0 ~P_1_ev~0)) (.cse7 (< 0 ~C_1_ev~0)) (.cse12 (not (= ~P_1_ev~0 1))) (.cse0 (not (= ~C_1_i~0 1))) (.cse23 (and .cse32 .cse33)) (.cse30 (not (= ~num~0 1))) (.cse18 (< ~i~0 ~max_loop~0)) (.cse27 (< 2147483646 ~i~0)) (.cse14 (not (= 2 ~C_1_pc~0))) (.cse15 (not (= ~C_1_ev~0 1))) (.cse8 (< ~i~0 1)) (.cse2 (and .cse32 .cse33 .cse16)) (.cse19 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse9 (< 0 ~e~0)) (.cse20 (not (= ~P_1_pc~0 0))) (.cse21 (not (= ~i~0 0))) (.cse22 (not (= ~C_1_pc~0 0))) (.cse6 (= |old(~P_1_st~0)| 0)) (.cse29 (and .cse32 .cse33 (<= 1 ~P_1_pc~0) (not .cse13) .cse16)) (.cse10 (= |old(~C_1_st~0)| 0)) (.cse17 (not (= ~num~0 0))) (.cse11 (< ~P_1_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~num~0) .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16 .cse10 .cse17 .cse11 .cse18) (or (not .cse6) (and (= ~C_1_st~0 0) (= ~P_1_st~0 0) .cse16) .cse0 .cse5 .cse19 .cse7 (not (= ~max_loop~0 2)) .cse9 .cse20 .cse17 (not .cse10) .cse21) (or .cse22 .cse2 .cse6 .cse20 .cse10 .cse17) (or .cse12 .cse0 .cse23 .cse14 .cse6 .cse15 .cse8 .cse9 .cse10 .cse17 .cse11 .cse18) (or .cse0 .cse14 .cse2 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse17 .cse11 .cse18) (or .cse12 .cse0 .cse23 .cse4 .cse6 .cse15 .cse26 .cse8 .cse9 .cse10 .cse11) (or .cse27 .cse13 .cse14 .cse2 .cse6 .cse8 .cse9 .cse10 .cse17 .cse11) (or .cse28 .cse2 .cse6 .cse9 .cse20 .cse10 .cse17) (or .cse13 .cse1 .cse22 .cse6 .cse29 .cse10 .cse11) (or .cse13 .cse1 .cse28 .cse6 .cse29 .cse9 .cse10 .cse11) (or .cse13 .cse28 .cse6 .cse29 .cse9 .cse10 .cse17 .cse11) (or .cse12 .cse0 .cse13 .cse14 .cse6 .cse15 .cse8 .cse9 .cse16 .cse10 .cse11 .cse30 .cse18) (or .cse2 (and (or .cse0 .cse14 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse17 .cse11) (or .cse0 .cse14 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse11)) .cse31) (or .cse0 .cse14 .cse2 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse30 .cse18) (or .cse12 .cse0 .cse23 .cse14 .cse6 .cse15 .cse8 .cse9 .cse31 .cse10 .cse17 .cse11) (or .cse0 .cse2 .cse4 .cse6 .cse26 .cse8 .cse25 .cse9 .cse10 .cse11) (or .cse0 .cse14 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse30 .cse18) (or .cse12 .cse0 .cse23 .cse14 .cse6 .cse15 .cse8 .cse9 .cse10 .cse11 .cse30 .cse18) (or .cse27 .cse13 .cse14 .cse2 .cse6 .cse15 .cse8 .cse9 .cse17 .cse11) (or .cse2 .cse6 .cse19 .cse9 .cse20 .cse17 .cse21) (or .cse13 .cse22 .cse6 .cse29 .cse10 .cse17 .cse11)))) [2023-11-06 23:05:49,742 INFO L895 garLoopResultBuilder]: At program point is_C_1_triggered_returnLabel#1(lines 195 223) the Hoare annotation is: (let ((.cse8 (= ~P_1_st~0 0))) (let ((.cse7 (= ~C_1_st~0 0)) (.cse35 (not .cse8)) (.cse22 (= ~C_1_ev~0 1)) (.cse6 (= |activate_threads_~tmp~1#1| 0)) (.cse9 (= |activate_threads_is_C_1_triggered_#res#1| 0)) (.cse10 (= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse11 (= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse42 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse44 (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse45 (<= 1 |activate_threads_is_C_1_triggered_#res#1|)) (.cse43 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse17 (= ~P_1_pc~0 1))) (let ((.cse3 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse15 (not (= ~i~0 0))) (.cse28 (< ~C_1_ev~0 2)) (.cse29 (< ~P_1_ev~0 2)) (.cse31 (not .cse17)) (.cse32 (< 2 ~max_loop~0)) (.cse16 (< 2147483646 ~i~0)) (.cse24 (and .cse44 .cse45 .cse8 .cse43)) (.cse19 (not (= 2 ~C_1_pc~0))) (.cse25 (and .cse44 .cse45 .cse43 .cse42)) (.cse40 (not (= ~num~0 1))) (.cse27 (< ~i~0 ~max_loop~0)) (.cse34 (not (= ~C_1_pc~0 0))) (.cse36 (and .cse6 .cse43 .cse9 .cse42 .cse10 .cse11)) (.cse12 (not (= ~P_1_pc~0 0))) (.cse23 (not (= ~P_1_ev~0 1))) (.cse26 (not .cse22)) (.cse39 (< ~num~0 0)) (.cse1 (not (= ~C_1_i~0 1))) (.cse33 (< ~num~0 1)) (.cse37 (and (<= 1 ~i~0) (<= ~e~0 0) .cse43 .cse9 .cse42 (<= 1 ~P_1_pc~0) (not .cse7) .cse11 .cse35)) (.cse30 (< 1 ~i~0)) (.cse38 (not (= ~C_1_pc~0 1))) (.cse2 (< 0 ~P_1_ev~0)) (.cse4 (< 0 ~C_1_ev~0)) (.cse20 (< ~i~0 1)) (.cse41 (< 1 ~C_1_pc~0)) (.cse18 (and .cse43 .cse9 .cse42 .cse11)) (.cse0 (= |old(~P_1_st~0)| 0)) (.cse5 (< 0 ~e~0)) (.cse14 (= |old(~C_1_st~0)| 0)) (.cse13 (not (= ~num~0 0))) (.cse21 (< ~P_1_pc~0 1))) (and (or (not .cse0) .cse1 .cse2 .cse3 .cse4 (not (= ~max_loop~0 2)) .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 (not .cse14) .cse15) (or .cse16 .cse17 .cse18 .cse19 .cse0 .cse20 .cse5 .cse14 .cse13 .cse21 .cse22) (or .cse23 .cse1 .cse24 .cse19 .cse25 .cse0 .cse26 .cse20 .cse5 .cse14 .cse13 .cse21 .cse27) (or .cse18 (and (or .cse1 .cse19 .cse0 .cse28 .cse20 .cse29 .cse5 .cse14 .cse13) (or .cse1 .cse19 .cse30 .cse2 .cse0 .cse4 .cse20 .cse5 .cse14 .cse13)) .cse31 .cse32) (or .cse17 .cse33 .cse34 .cse18 .cse0 .cse14 .cse21) (or .cse23 .cse1 .cse17 .cse19 .cse0 .cse26 .cse20 .cse5 .cse14 .cse13 .cse21 .cse27 .cse35) (or .cse0 .cse36 .cse3 .cse5 .cse12 .cse13 .cse15) (or .cse1 .cse37 .cse38 .cse0 .cse39 .cse20 .cse29 .cse5 .cse14 .cse21) (or .cse1 .cse18 .cse19 .cse30 .cse2 .cse0 .cse4 .cse20 .cse5 .cse14 .cse21 .cse40 .cse27) (or .cse1 .cse18 .cse19 .cse0 .cse28 .cse20 .cse29 .cse5 .cse14 .cse21 .cse40 .cse27) (or .cse1 .cse18 .cse19 .cse0 .cse28 .cse20 .cse29 .cse5 .cse14 .cse13 .cse21 .cse27) (or .cse17 .cse34 .cse18 .cse0 .cse14 .cse13 .cse21) (or .cse17 .cse33 .cse41 .cse18 .cse0 .cse5 .cse14 .cse21) (or .cse23 .cse1 .cse17 .cse19 .cse0 .cse26 .cse42 .cse20 .cse5 .cse14 .cse21 .cse40 .cse27) (or .cse23 .cse1 .cse24 .cse19 .cse25 .cse0 .cse26 .cse20 .cse31 .cse5 .cse32 .cse14 .cse13) (or .cse41 .cse0 .cse36 .cse5 .cse12 .cse14 .cse13) (or .cse16 (and .cse43 .cse42) .cse17 .cse19 .cse0 .cse26 .cse20 .cse5 .cse13 .cse21) (or .cse23 .cse1 .cse24 .cse19 .cse25 .cse0 .cse26 .cse20 .cse5 .cse14 .cse21 .cse40 .cse27) (or .cse34 .cse0 .cse36 .cse12 .cse14 .cse13) (or .cse23 .cse1 .cse18 .cse38 .cse0 (and .cse8 .cse43 .cse9 .cse11) .cse26 .cse39 .cse20 .cse5 .cse14 .cse21) (or .cse1 .cse33 .cse37 .cse30 .cse38 .cse2 .cse0 .cse4 (< 1 ~num~0) .cse20 .cse5 .cse14 .cse21) (or .cse17 .cse41 .cse18 .cse0 .cse5 .cse14 .cse13 .cse21))))) [2023-11-06 23:05:49,743 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 374 399) the Hoare annotation is: (let ((.cse23 (not (= ~C_1_pc~0 0))) (.cse12 (< 1 ~i~0)) (.cse13 (< 0 ~P_1_ev~0)) (.cse14 (< 0 ~C_1_ev~0)) (.cse28 (< 2 ~max_loop~0)) (.cse18 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse20 (not (= ~i~0 0))) (.cse22 (< ~num~0 1)) (.cse24 (not (= ~C_1_pc~0 1))) (.cse25 (< ~num~0 0)) (.cse16 (not (= ~P_1_ev~0 1))) (.cse27 (< 2147483646 ~i~0)) (.cse21 (= ~P_1_pc~0 1)) (.cse17 (not (= ~C_1_ev~0 1))) (.cse0 (not (= ~C_1_i~0 1))) (.cse2 (not (= 2 ~C_1_pc~0))) (.cse4 (< ~C_1_ev~0 2)) (.cse5 (< ~i~0 1)) (.cse6 (< ~P_1_ev~0 2)) (.cse10 (< ~P_1_pc~0 1)) (.cse15 (not (= ~num~0 1))) (.cse11 (< ~i~0 ~max_loop~0)) (.cse1 (and (= ~C_1_st~0 |old(~C_1_st~0)|) (= |old(~P_1_st~0)| ~P_1_st~0))) (.cse26 (< 1 ~C_1_pc~0)) (.cse3 (= |old(~P_1_st~0)| 0)) (.cse7 (< 0 ~e~0)) (.cse19 (not (= ~P_1_pc~0 0))) (.cse8 (= |old(~C_1_st~0)| 0)) (.cse9 (not (= ~num~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse2 .cse12 .cse13 .cse3 .cse14 .cse5 .cse7 .cse8 .cse10 .cse15 .cse11) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11) (or (not .cse3) .cse0 (and (= ~C_1_st~0 0) (= ~P_1_st~0 0)) .cse13 .cse18 .cse14 (not (= ~max_loop~0 2)) .cse7 .cse19 .cse9 (not .cse8) .cse20) (or .cse1 .cse21 .cse22 .cse23 .cse3 .cse8 .cse10) (or .cse16 .cse0 .cse1 .cse24 .cse3 .cse17 .cse25 .cse5 .cse7 .cse8 .cse10) (or .cse1 .cse21 .cse26 .cse3 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse23 .cse3 .cse19 .cse8 .cse9) (or .cse0 .cse1 .cse22 .cse12 .cse24 .cse13 .cse3 .cse14 (< 1 ~num~0) .cse5 .cse7 .cse8 .cse10) (or .cse27 .cse1 .cse21 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse21 .cse23 .cse3 .cse8 .cse9 .cse10) (or .cse1 (and (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse2 .cse12 .cse13 .cse3 .cse14 .cse5 .cse7 .cse8 .cse9 .cse10)) .cse28) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse7 .cse28 .cse8 .cse9 .cse10) (or .cse1 .cse3 .cse18 .cse7 .cse19 .cse9 .cse20) (or .cse1 .cse21 .cse22 .cse26 .cse3 .cse7 .cse8 .cse10) (or .cse0 .cse1 .cse24 .cse3 .cse25 .cse5 .cse6 .cse7 .cse8 .cse10) (or .cse16 .cse0 .cse1 .cse2 .cse3 .cse17 .cse5 .cse7 .cse8 .cse10 .cse15 .cse11) (or .cse27 .cse1 .cse21 .cse2 .cse3 .cse17 .cse5 .cse7 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse15 .cse11) (or .cse1 .cse26 .cse3 .cse7 .cse19 .cse8 .cse9))) [2023-11-06 23:05:49,744 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 208) no Hoare annotation was computed. [2023-11-06 23:05:49,744 INFO L899 garLoopResultBuilder]: For program point L199-2(lines 198 222) no Hoare annotation was computed. [2023-11-06 23:05:49,746 INFO L895 garLoopResultBuilder]: At program point is_P_1_triggered_returnLabel#1(lines 113 131) the Hoare annotation is: (let ((.cse34 (= ~C_1_st~0 |old(~C_1_st~0)|)) (.cse35 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse28 (= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse17 (= ~P_1_pc~0 1)) (.cse29 (= |activate_threads_is_P_1_triggered_~__retres1~0#1| 0))) (let ((.cse1 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse6 (not (= ~i~0 0))) (.cse18 (not (= ~C_1_pc~0 0))) (.cse33 (< 2 ~max_loop~0)) (.cse27 (< ~num~0 0)) (.cse24 (< ~num~0 1)) (.cse9 (< 1 ~i~0)) (.cse26 (not (= ~C_1_pc~0 1))) (.cse10 (< 0 ~P_1_ev~0)) (.cse11 (< 0 ~C_1_ev~0)) (.cse19 (and .cse34 .cse35 (<= 1 ~P_1_pc~0) .cse28 (not .cse17) .cse29)) (.cse31 (< ~C_1_ev~0 2)) (.cse32 (< ~P_1_ev~0 2)) (.cse30 (and .cse28 .cse29)) (.cse25 (< 1 ~C_1_pc~0)) (.cse4 (not (= ~P_1_pc~0 0))) (.cse21 (not (= ~P_1_ev~0 1))) (.cse7 (not (= ~C_1_i~0 1))) (.cse22 (and .cse34 .cse35)) (.cse13 (= |old(~C_1_st~0)| 0)) (.cse15 (not (= ~num~0 1))) (.cse16 (< ~i~0 ~max_loop~0)) (.cse20 (< 2147483646 ~i~0)) (.cse8 (not (= 2 ~C_1_pc~0))) (.cse0 (= |old(~P_1_st~0)| 0)) (.cse23 (not (= ~C_1_ev~0 1))) (.cse12 (< ~i~0 1)) (.cse2 (< 0 ~e~0)) (.cse3 (and .cse34 .cse35 .cse28 .cse29)) (.cse5 (not (= ~num~0 0))) (.cse14 (< ~P_1_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse2 .cse3 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse18 .cse0 .cse13 .cse5 .cse19 .cse14) (or .cse20 .cse17 .cse8 .cse0 .cse12 .cse2 .cse3 .cse13 .cse5 .cse14) (or .cse21 .cse7 .cse22 .cse8 .cse0 .cse23 .cse12 .cse2 .cse13 .cse5 .cse14 .cse16) (or .cse17 .cse24 .cse25 .cse0 .cse2 .cse13 .cse19 .cse14) (or .cse17 .cse24 .cse18 .cse0 .cse13 .cse19 .cse14) (or .cse21 .cse7 .cse22 .cse26 .cse0 .cse23 .cse27 .cse12 .cse2 .cse13 .cse14) (or (not .cse0) .cse7 (and (= ~C_1_st~0 0) (= ~P_1_st~0 0) .cse28 .cse29) .cse10 .cse1 .cse11 (not (= ~max_loop~0 2)) .cse2 .cse4 .cse5 (not .cse13) .cse6) (or .cse21 .cse7 .cse17 .cse8 .cse30 .cse0 .cse23 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16) (or .cse18 .cse0 .cse3 .cse4 .cse13 .cse5) (or (and (or .cse7 .cse8 .cse0 .cse31 .cse12 .cse32 .cse2 .cse13 .cse5 .cse14) (or .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 .cse2 .cse13 .cse5 .cse14)) .cse33 .cse3) (or .cse21 .cse7 .cse22 .cse8 .cse0 .cse23 .cse12 .cse2 .cse33 .cse13 .cse5 .cse14) (or .cse7 .cse26 .cse0 .cse27 .cse12 .cse32 .cse2 .cse3 .cse13 .cse14) (or .cse7 .cse8 .cse0 .cse31 .cse12 .cse32 .cse2 .cse3 .cse13 .cse5 .cse14 .cse16) (or .cse7 .cse24 .cse9 .cse26 .cse10 .cse0 .cse11 (< 1 ~num~0) .cse12 .cse2 .cse3 .cse13 .cse14) (or .cse17 .cse25 .cse0 .cse2 .cse13 .cse5 .cse19 .cse14) (or .cse7 .cse8 .cse0 .cse31 .cse12 .cse32 .cse2 .cse3 .cse13 .cse14 .cse15 .cse16) (or .cse21 .cse7 .cse17 .cse8 .cse30 .cse0 .cse23 .cse12 .cse2 .cse13 .cse5 .cse14 .cse16) (or .cse25 .cse0 .cse2 .cse3 .cse4 .cse13 .cse5) (or .cse21 .cse7 .cse22 .cse8 .cse0 .cse23 .cse12 .cse2 .cse13 .cse14 .cse15 .cse16) (or .cse20 .cse17 .cse8 .cse0 .cse23 .cse12 .cse2 .cse3 .cse5 .cse14)))) [2023-11-06 23:05:49,748 INFO L895 garLoopResultBuilder]: At program point L220(lines 198 222) the Hoare annotation is: (let ((.cse3 (= ~P_1_st~0 0)) (.cse2 (= ~C_1_st~0 0))) (let ((.cse34 (= ~C_1_ev~0 1)) (.cse1 (= |activate_threads_~tmp~1#1| 0)) (.cse4 (= |activate_threads_is_P_1_triggered_#res#1| 0)) (.cse43 (<= 1 ~i~0)) (.cse44 (<= ~e~0 0)) (.cse45 (<= 1 ~P_1_pc~0)) (.cse46 (not .cse2)) (.cse28 (not .cse3)) (.cse5 (= |activate_threads_is_C_1_triggered_~__retres1~1#1| 0)) (.cse39 (= |old(~P_1_st~0)| ~P_1_st~0)) (.cse47 (<= 1 |activate_threads_is_C_1_triggered_~__retres1~1#1|)) (.cse40 (= ~C_1_st~0 |old(~C_1_st~0)|))) (let ((.cse8 (not (= ~C_1_pc~0 ~P_1_pc~0))) (.cse14 (not (= ~i~0 0))) (.cse31 (and .cse47 .cse3 .cse40)) (.cse32 (and .cse47 .cse40 .cse39)) (.cse37 (< 2 ~max_loop~0)) (.cse35 (< 1 ~C_1_pc~0)) (.cse21 (< ~C_1_ev~0 2)) (.cse23 (< ~P_1_ev~0 2)) (.cse24 (not (= ~num~0 1))) (.cse25 (< ~i~0 ~max_loop~0)) (.cse18 (and .cse40 .cse39 .cse5)) (.cse36 (< 1 ~i~0)) (.cse7 (< 0 ~P_1_ev~0)) (.cse9 (< 0 ~C_1_ev~0)) (.cse30 (and .cse43 .cse44 .cse40 .cse39 .cse45 .cse46 .cse5 .cse28)) (.cse33 (< 2147483646 ~i~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse20 (not (= 2 ~C_1_pc~0))) (.cse38 (< ~num~0 1)) (.cse15 (and .cse1 .cse40 .cse39 .cse4 .cse5)) (.cse17 (not (= ~C_1_pc~0 0))) (.cse11 (not (= ~P_1_pc~0 0))) (.cse26 (not (= ~P_1_ev~0 1))) (.cse6 (not (= ~C_1_i~0 1))) (.cse29 (not (= ~C_1_pc~0 1))) (.cse41 (and .cse43 .cse44 .cse40 .cse39 .cse45 .cse46 .cse5 .cse34 .cse28)) (.cse0 (= |old(~P_1_st~0)| 0)) (.cse27 (not .cse34)) (.cse22 (< ~i~0 1)) (.cse10 (< 0 ~e~0)) (.cse13 (= |old(~C_1_st~0)| 0)) (.cse12 (not (= ~num~0 0))) (.cse19 (< ~P_1_pc~0 1)) (.cse42 (and .cse43 .cse44 .cse3 .cse40 .cse45 .cse46 .cse5 .cse34))) (and (or (not .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 (not (= ~max_loop~0 2)) .cse10 .cse11 .cse12 (not .cse13) .cse14) (or .cse15 .cse0 .cse8 .cse10 .cse11 .cse12 .cse14) (or .cse16 .cse17 .cse0 .cse18 .cse13 .cse12 .cse19) (or .cse6 .cse20 .cse0 .cse18 .cse21 .cse22 .cse23 .cse10 .cse13 .cse19 .cse24 .cse25) (or .cse26 .cse6 .cse16 .cse20 .cse0 .cse27 .cse22 .cse10 .cse13 .cse12 .cse19 .cse25 .cse28) (or .cse6 .cse29 .cse0 (< ~num~0 0) .cse22 .cse23 .cse10 .cse13 .cse19 .cse30) (or .cse31 .cse26 .cse6 .cse20 .cse0 .cse27 .cse32 .cse22 .cse10 .cse13 .cse19 .cse24 .cse25) (or .cse33 .cse16 .cse20 .cse0 .cse18 .cse22 .cse10 .cse13 .cse12 .cse19 .cse34) (or .cse16 .cse35 .cse0 .cse18 .cse10 .cse13 .cse12 .cse19) (or .cse15 .cse35 .cse0 .cse10 .cse11 .cse13 .cse12) (or .cse6 .cse20 .cse36 .cse7 .cse0 .cse9 .cse18 .cse22 .cse10 .cse13 .cse19 .cse24 .cse25) (or .cse31 .cse26 .cse6 .cse20 .cse0 .cse27 .cse32 .cse22 .cse10 .cse13 .cse12 .cse19 .cse25) (or .cse31 .cse26 .cse6 .cse20 .cse0 .cse27 .cse32 .cse22 (not .cse16) .cse10 .cse37 .cse13 .cse12) (or (and (or .cse6 .cse20 .cse0 .cse21 .cse22 .cse23 .cse10 .cse13 .cse12 .cse19) (or .cse6 .cse20 .cse36 .cse7 .cse0 .cse9 .cse22 .cse10 .cse13 .cse12 .cse19)) .cse18 .cse37) (or .cse16 .cse38 .cse35 .cse0 .cse18 .cse10 .cse13 .cse19) (or .cse6 .cse20 .cse0 .cse18 .cse21 .cse22 .cse23 .cse10 .cse13 .cse12 .cse19 .cse25) (or .cse26 .cse6 .cse16 .cse20 .cse0 .cse27 .cse39 .cse22 .cse10 .cse13 .cse19 .cse24 .cse25) (or .cse16 .cse38 .cse17 .cse0 .cse18 .cse13 .cse19) (or .cse6 .cse38 .cse36 .cse29 .cse7 .cse0 .cse9 (< 1 ~num~0) .cse22 .cse10 .cse13 .cse19 .cse30) (or .cse33 (and .cse40 .cse39) .cse16 .cse20 .cse0 .cse27 .cse22 .cse10 .cse12 .cse19) (or .cse26 .cse6 .cse38 .cse29 .cse41 .cse0 .cse27 .cse22 .cse10 .cse13 .cse19 .cse42) (or .cse15 .cse17 .cse0 .cse11 .cse13 .cse12) (or .cse26 .cse6 .cse29 .cse41 .cse0 .cse27 .cse22 .cse10 .cse13 .cse12 .cse19 .cse42))))) [2023-11-06 23:05:49,749 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 126) no Hoare annotation was computed. [2023-11-06 23:05:49,749 INFO L899 garLoopResultBuilder]: For program point L117-2(lines 117 126) no Hoare annotation was computed. [2023-11-06 23:05:49,749 INFO L899 garLoopResultBuilder]: For program point activate_threadsEXIT(lines 374 399) no Hoare annotation was computed. [2023-11-06 23:05:49,749 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 205) no Hoare annotation was computed. [2023-11-06 23:05:49,749 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2023-11-06 23:05:49,750 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 250 269) no Hoare annotation was computed. [2023-11-06 23:05:49,751 INFO L895 garLoopResultBuilder]: At program point L267(lines 251 269) the Hoare annotation is: (let ((.cse18 (= ~C_1_st~0 0))) (let ((.cse0 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse4 (= ~P_1_st~0 0)) (.cse9 (not .cse18)) (.cse26 (= ~P_1_pc~0 1))) (let ((.cse24 (not (= ~P_1_pc~0 0))) (.cse21 (< 0 ~P_1_ev~0)) (.cse22 (< 0 ~C_1_ev~0)) (.cse15 (< 1 ~num~0)) (.cse23 (not (= ~max_loop~0 2))) (.cse25 (not (= ~i~0 0))) (.cse2 (< 2147483646 ~i~0)) (.cse16 (not .cse26)) (.cse17 (< 2 ~max_loop~0)) (.cse10 (not (= ~num~0 0))) (.cse3 (not (= 2 ~C_1_pc~0))) (.cse5 (< ~C_1_ev~0 2)) (.cse27 (not (= ~num~0 1))) (.cse12 (< ~i~0 ~max_loop~0)) (.cse1 (not (= ~C_1_i~0 1))) (.cse14 (< ~num~0 1)) (.cse19 (not (= ~C_1_pc~0 1))) (.cse20 (and (<= 1 ~i~0) .cse0 (<= ~e~0 0) .cse4 (<= 1 ~P_1_pc~0) .cse9)) (.cse6 (< ~i~0 1)) (.cse7 (< ~P_1_ev~0 2)) (.cse8 (< 0 ~e~0)) (.cse11 (< ~P_1_pc~0 1)) (.cse13 (not .cse4))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse17 .cse9) (or .cse1 .cse18 .cse19 .cse20 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13) (or .cse0 .cse1 .cse21 (not (= ~C_1_pc~0 ~P_1_pc~0)) .cse22 .cse23 .cse8 .cse24 .cse9 .cse10 .cse13 .cse25) (or .cse0 .cse1 .cse18 (< 1 ~i~0) .cse19 .cse21 .cse22 .cse6 .cse8 .cse24 .cse10 .cse13) (or .cse0 .cse1 .cse14 (not (= ~C_1_pc~0 0)) .cse4 .cse21 .cse22 .cse15 .cse16 .cse23 .cse8 .cse9 .cse25) (or .cse0 .cse2 .cse26 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse16 .cse7 .cse8 .cse17 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11 .cse27 .cse12 .cse13) (or .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse27 .cse12) (or .cse1 .cse18 .cse14 .cse19 .cse20 .cse6 .cse7 .cse8 .cse11 .cse13))))) [2023-11-06 23:05:49,751 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 250 269) the Hoare annotation is: true [2023-11-06 23:05:49,751 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 263) no Hoare annotation was computed. [2023-11-06 23:05:49,752 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadFINAL(lines 250 269) no Hoare annotation was computed. [2023-11-06 23:05:49,752 INFO L902 garLoopResultBuilder]: At program point fire_delta_eventsFINAL(lines 326 333) the Hoare annotation is: true [2023-11-06 23:05:49,752 INFO L899 garLoopResultBuilder]: For program point fire_delta_eventsEXIT(lines 326 333) no Hoare annotation was computed. [2023-11-06 23:05:49,752 INFO L899 garLoopResultBuilder]: For program point update_channelsEXIT(lines 224 231) no Hoare annotation was computed. [2023-11-06 23:05:49,752 INFO L902 garLoopResultBuilder]: At program point update_channelsFINAL(lines 224 231) the Hoare annotation is: true [2023-11-06 23:05:49,753 INFO L899 garLoopResultBuilder]: For program point reset_delta_eventsEXIT(lines 334 341) no Hoare annotation was computed. [2023-11-06 23:05:49,753 INFO L902 garLoopResultBuilder]: At program point reset_delta_eventsFINAL(lines 334 341) the Hoare annotation is: true [2023-11-06 23:05:49,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2023-11-06 23:05:49,753 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-11-06 23:05:49,753 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 288) no Hoare annotation was computed. [2023-11-06 23:05:49,754 INFO L899 garLoopResultBuilder]: For program point L284-1(lines 279 319) no Hoare annotation was computed. [2023-11-06 23:05:49,754 INFO L895 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 430 488) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-06 23:05:49,754 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2023-11-06 23:05:49,754 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 49) no Hoare annotation was computed. [2023-11-06 23:05:49,755 INFO L895 garLoopResultBuilder]: At program point L417(line 417) the Hoare annotation is: (let ((.cse25 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse21 (= ~C_1_pc~0 1)) (.cse3 (<= ~i~0 2147483646)) (.cse20 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse19 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse24 (= ~num~0 1)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse25)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse21 .cse2 .cse22 .cse23 .cse17 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse20 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse10 .cse11 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse5 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse19 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse10 .cse11 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse5 .cse10 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse24 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse24 .cse18) (and (= ~i~0 0) .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,756 INFO L899 garLoopResultBuilder]: For program point L417-1(line 417) no Hoare annotation was computed. [2023-11-06 23:05:49,756 INFO L895 garLoopResultBuilder]: At program point fire_time_events_returnLabel#1(lines 342 355) the Hoare annotation is: (let ((.cse11 (= ~P_1_pc~0 1)) (.cse8 (= 2 ~C_1_pc~0)) (.cse16 (<= ~max_loop~0 ~i~0)) (.cse7 (<= 1 ~i~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse14 (= ~P_1_ev~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse12 (= ~C_1_ev~0 1)) (.cse15 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 (<= ~i~0 2147483646) .cse10 .cse2 (not .cse11) .cse12 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse11 .cse9 .cse14 (<= ~max_loop~0 2) (= ~i~0 1) .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse14 .cse16 .cse10 .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse13 .cse9 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse14 .cse16 .cse10 (= ~num~0 1) .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse17 .cse9 .cse14 .cse10 .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse17 .cse9 .cse14 .cse10 .cse3 .cse12 .cse5 .cse15 .cse4) (and .cse13 .cse9 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,757 INFO L899 garLoopResultBuilder]: For program point L236(lines 236 240) no Hoare annotation was computed. [2023-11-06 23:05:49,757 INFO L899 garLoopResultBuilder]: For program point L236-2(lines 235 248) no Hoare annotation was computed. [2023-11-06 23:05:49,757 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 176) no Hoare annotation was computed. [2023-11-06 23:05:49,757 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 176) no Hoare annotation was computed. [2023-11-06 23:05:49,757 INFO L899 garLoopResultBuilder]: For program point L187(lines 155 188) no Hoare annotation was computed. [2023-11-06 23:05:49,758 INFO L895 garLoopResultBuilder]: At program point P_1_returnLabel#1(lines 78 112) the Hoare annotation is: (let ((.cse18 (= ~C_1_st~0 0))) (let ((.cse19 (= ~P_1_pc~0 1)) (.cse20 (= ~max_loop~0 2)) (.cse5 (<= 1 ~i~0)) (.cse6 (<= 2 ~C_1_ev~0)) (.cse7 (<= 2 ~P_1_ev~0)) (.cse8 (= 2 ~C_1_pc~0)) (.cse11 (<= ~max_loop~0 ~i~0)) (.cse22 (<= ~C_1_pc~0 1)) (.cse16 (<= 1 ~num~0)) (.cse17 (<= 2 ~P_1_pc~0)) (.cse15 (= ~C_1_pc~0 1)) (.cse10 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse24 (<= ~P_1_ev~0 0)) (.cse25 (<= ~C_1_ev~0 0)) (.cse21 (= ~i~0 1)) (.cse12 (<= 1 ~P_1_pc~0)) (.cse13 (= ~num~0 1)) (.cse3 (not .cse18)) (.cse14 (= ~C_1_i~0 1)) (.cse23 (= ~i~0 0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse4) (and .cse5 .cse7 .cse15 .cse9 .cse10 .cse12 .cse3 .cse16 .cse14 .cse4) (and .cse1 .cse3 .cse16 .cse17 .cse4) (and .cse6 .cse7 .cse8 .cse18 .cse19 .cse9 .cse10 .cse20 .cse21 .cse13 .cse14 .cse4) (and .cse5 .cse7 .cse15 .cse9 .cse10 .cse12 .cse2 .cse3 .cse14 .cse4) (and .cse1 .cse2 .cse3 .cse17 .cse4) (and .cse22 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse22 .cse9 .cse2 .cse3 .cse17 .cse4) (and .cse5 .cse8 .cse9 .cse10 (<= ~i~0 2147483646) .cse12 .cse2 (not .cse19) .cse4) (and .cse18 .cse19 .cse23 .cse9 .cse10 .cse24 .cse20 .cse25 .cse1 .cse13 .cse14 .cse4) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse2 .cse14 .cse4) (and .cse22 .cse9 .cse3 .cse16 .cse17 .cse4) (and .cse15 .cse9 .cse10 .cse24 .cse25 .cse21 .cse12 .cse13 .cse3 .cse14 .cse4) (and .cse23 .cse9 .cse0 .cse1 .cse2 .cse4)))) [2023-11-06 23:05:49,759 INFO L895 garLoopResultBuilder]: At program point L468(line 468) the Hoare annotation is: (let ((.cse11 (= ~P_1_pc~0 1)) (.cse8 (= 2 ~C_1_pc~0)) (.cse16 (<= ~max_loop~0 ~i~0)) (.cse7 (<= 1 ~i~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse14 (= ~P_1_ev~0 1)) (.cse10 (<= 1 ~P_1_pc~0)) (.cse12 (= ~C_1_ev~0 1)) (.cse15 (= ~C_1_i~0 1)) (.cse13 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse9 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 (<= ~i~0 2147483646) .cse10 .cse2 (not .cse11) .cse12 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse13 .cse9 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse11 .cse9 .cse14 (<= ~max_loop~0 2) (= ~i~0 1) .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse14 .cse16 .cse10 .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse13 .cse9 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse14 .cse16 .cse10 (= ~num~0 1) .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse17 .cse9 .cse14 .cse10 .cse2 .cse3 .cse12 .cse15 .cse4) (and .cse7 .cse17 .cse9 .cse14 .cse10 .cse3 .cse12 .cse5 .cse15 .cse4) (and .cse13 .cse9 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse9 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,759 INFO L899 garLoopResultBuilder]: For program point L468-1(line 468) no Hoare annotation was computed. [2023-11-06 23:05:49,759 INFO L899 garLoopResultBuilder]: For program point L105(lines 92 106) no Hoare annotation was computed. [2023-11-06 23:05:49,759 INFO L899 garLoopResultBuilder]: For program point L419(lines 419 424) no Hoare annotation was computed. [2023-11-06 23:05:49,760 INFO L895 garLoopResultBuilder]: At program point L304(lines 279 319) the Hoare annotation is: (let ((.cse24 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse27 (= ~C_1_pc~0 1)) (.cse28 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (<= ~i~0 2147483646)) (.cse26 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse23 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse21 (= ~max_loop~0 2)) (.cse25 (= ~num~0 1)) (.cse19 (= ~i~0 0)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse22 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse24)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse15 .cse19 .cse2 .cse20 .cse21 .cse22 .cse8 .cse9 .cse5 .cse18) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse23 .cse4 .cse5 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse24 .cse23 .cse4 .cse25 .cse18) (and .cse26 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse27 .cse2 .cse20 .cse22 .cse17 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse27 .cse2 .cse4 .cse10 (<= 0 ~num~0) .cse18) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse24 .cse23 .cse4 .cse5 .cse18) (and .cse26 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse27 .cse2 .cse28 .cse20 .cse22 .cse17 .cse8 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse20 .cse22 .cse17 .cse23 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse15 .cse6 .cse19 .cse2 .cse28 .cse20 .cse21 .cse22 .cse9 .cse25 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse26 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse23 .cse4 .cse25 .cse18 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse21 .cse17 .cse25 .cse18 .cse7) (and .cse19 .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse20 .cse22 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,761 INFO L895 garLoopResultBuilder]: At program point C_1_returnLabel#1(lines 137 194) the Hoare annotation is: (let ((.cse1 (= ~C_1_pc~0 0)) (.cse9 (<= 2 ~C_1_ev~0)) (.cse6 (<= ~C_1_pc~0 1)) (.cse5 (<= 2 ~P_1_pc~0)) (.cse0 (= ~P_1_pc~0 0)) (.cse17 (= ~P_1_pc~0 1)) (.cse11 (= 2 ~C_1_pc~0)) (.cse19 (<= ~P_1_ev~0 0)) (.cse20 (<= ~C_1_ev~0 0)) (.cse18 (= ~i~0 1)) (.cse13 (<= ~max_loop~0 ~i~0)) (.cse15 (= ~num~0 1)) (.cse4 (not (= ~P_1_st~0 0))) (.cse8 (<= 1 ~i~0)) (.cse10 (<= 2 ~P_1_ev~0)) (.cse21 (= ~C_1_pc~0 1)) (.cse7 (<= ~e~0 0)) (.cse12 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse14 (<= 1 ~P_1_pc~0)) (.cse2 (= ~num~0 0)) (.cse3 (not (= ~C_1_st~0 0))) (.cse16 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 (<= 1 ~num~0) .cse5 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse7 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse12 .cse13 .cse14 .cse15 .cse3 .cse16) (and .cse8 .cse9 .cse10 .cse11 .cse7 .cse12 .cse13 .cse14 .cse2 .cse3 .cse16) (and .cse17 (<= ~max_loop~0 2) (or (and .cse9 .cse10 .cse11 .cse7 .cse12 .cse18 .cse2 .cse3 .cse16 .cse4) (and .cse11 .cse7 .cse12 .cse19 .cse20 .cse18 .cse2 .cse3 .cse16 .cse4))) (and .cse6 .cse7 .cse2 .cse3 .cse5 .cse4) (and .cse21 .cse7 .cse12 .cse19 .cse20 .cse18 .cse0 .cse2 .cse3 .cse16) (and .cse8 .cse11 .cse7 .cse12 (<= ~i~0 2147483646) .cse14 .cse2 (not .cse17) .cse3 .cse4) (and .cse11 .cse7 .cse12 .cse19 .cse20 .cse18 .cse13 .cse14 .cse15 .cse3 .cse16 .cse4) (and .cse8 .cse10 .cse21 .cse7 .cse12 .cse14 .cse2 .cse3 .cse16))) [2023-11-06 23:05:49,761 INFO L895 garLoopResultBuilder]: At program point L172(line 172) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-06 23:05:49,762 INFO L895 garLoopResultBuilder]: At program point L453(line 453) the Hoare annotation is: (let ((.cse18 (<= ~P_1_ev~0 0)) (.cse19 (<= ~C_1_ev~0 0)) (.cse20 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse21 (= ~P_1_pc~0 1)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse16 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse16 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse17 .cse11 .cse18 .cse19 .cse20 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse20 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse2 .cse3 .cse15 .cse4)) .cse21 (<= ~max_loop~0 2)) (and .cse16 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 (<= ~i~0 2147483646) .cse13 .cse2 (not .cse21) .cse3 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse16 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,762 INFO L899 garLoopResultBuilder]: For program point L453-1(line 453) no Hoare annotation was computed. [2023-11-06 23:05:49,762 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 48) no Hoare annotation was computed. [2023-11-06 23:05:49,763 INFO L899 garLoopResultBuilder]: For program point L289(lines 279 319) no Hoare annotation was computed. [2023-11-06 23:05:49,763 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 23:05:49,763 INFO L899 garLoopResultBuilder]: For program point L157(lines 156 186) no Hoare annotation was computed. [2023-11-06 23:05:49,763 INFO L895 garLoopResultBuilder]: At program point L438(line 438) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2023-11-06 23:05:49,764 INFO L899 garLoopResultBuilder]: For program point L438-1(line 438) no Hoare annotation was computed. [2023-11-06 23:05:49,764 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2023-11-06 23:05:49,764 INFO L895 garLoopResultBuilder]: At program point read_data_returnLabel#1(lines 32 54) the Hoare annotation is: (let ((.cse0 (= 2 ~C_1_pc~0)) (.cse4 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse7 (= ~max_loop~0 2)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~C_1_st~0 0))) (.cse8 (= ~C_1_i~0 1)) (.cse6 (not (= ~P_1_st~0 0)))) (or (and (<= 1 ~i~0) .cse0 .cse1 .cse2 (<= ~i~0 2147483645) (<= 1 ~P_1_pc~0) .cse3 (not .cse4) .cse5 .cse6) (and .cse4 (= ~i~0 0) .cse1 (= |ULTIMATE.start_read_data_~i___0#1| 0) .cse2 (<= ~P_1_ev~0 0) .cse7 (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) .cse3 .cse5 .cse8 .cse6) (and (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= ~num~0 |ULTIMATE.start_read_data_~i___0#1|) .cse0 .cse4 .cse1 .cse2 .cse7 (= ~i~0 1) .cse3 .cse5 .cse8 .cse6))) [2023-11-06 23:05:49,764 INFO L895 garLoopResultBuilder]: At program point $Ultimate##55(lines 156 186) the Hoare annotation is: (let ((.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse7 (<= 1 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse20 (<= ~i~0 2147483646)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse16 (= ~P_1_pc~0 1)) (.cse6 (not (= ~P_1_st~0 0))) (.cse0 (= ~i~0 0)) (.cse1 (<= ~e~0 0)) (.cse11 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse17 (<= ~P_1_ev~0 0)) (.cse18 (= ~max_loop~0 2)) (.cse19 (<= ~C_1_ev~0 0)) (.cse2 (= ~P_1_pc~0 0)) (.cse3 (= ~C_1_pc~0 0)) (.cse4 (= ~num~0 0)) (.cse5 (not (= ~C_1_st~0 0))) (.cse15 (= ~C_1_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15) (and .cse16 .cse0 .cse1 .cse11 .cse17 .cse18 .cse19 .cse3 .cse14 .cse5 .cse15 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse20 .cse13 .cse4 .cse5 .cse15) (and .cse8 .cse9 .cse10 .cse16 .cse1 .cse11 (<= ~max_loop~0 2) (= ~i~0 1) .cse14 .cse5 .cse15 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse1 .cse11 .cse12 .cse13 .cse4 .cse5 .cse15) (and .cse7 .cse10 .cse1 .cse11 .cse20 .cse13 .cse4 (not .cse16) .cse5 .cse6) (and .cse0 .cse1 .cse11 .cse17 .cse18 .cse19 .cse2 .cse3 .cse4 .cse5 .cse15))) [2023-11-06 23:05:49,765 INFO L895 garLoopResultBuilder]: At program point init_model_returnLabel#1(lines 489 498) the Hoare annotation is: (and (= ~C_1_st~0 0) (= ~i~0 0) (<= ~e~0 0) (= ~P_1_st~0 0) (<= ~P_1_ev~0 0) (= ~max_loop~0 2) (<= ~C_1_ev~0 0) (= ~P_1_pc~0 0) (= ~C_1_pc~0 0) (= ~num~0 0) (= ~C_1_i~0 1)) [2023-11-06 23:05:49,765 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 160) no Hoare annotation was computed. [2023-11-06 23:05:49,765 INFO L895 garLoopResultBuilder]: At program point L158(lines 158 168) the Hoare annotation is: (let ((.cse0 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (= ~max_loop~0 2)) (.cse4 (= ~num~0 1)) (.cse5 (not (= ~C_1_st~0 0))) (.cse6 (= ~C_1_i~0 1)) (.cse7 (not (= ~P_1_st~0 0)))) (or (and (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= 2 ~C_1_pc~0) .cse0 .cse1 .cse2 .cse3 (= ~i~0 1) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= ~i~0 0) .cse1 .cse2 (<= ~P_1_ev~0 0) .cse3 (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) .cse4 .cse5 .cse6 .cse7))) [2023-11-06 23:05:49,766 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-11-06 23:05:49,766 INFO L895 garLoopResultBuilder]: At program point L241-1(lines 232 249) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2023-11-06 23:05:49,766 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2023-11-06 23:05:49,766 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2023-11-06 23:05:49,767 INFO L895 garLoopResultBuilder]: At program point L440-1(line 440) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2023-11-06 23:05:49,767 INFO L899 garLoopResultBuilder]: For program point L308(lines 308 315) no Hoare annotation was computed. [2023-11-06 23:05:49,767 INFO L895 garLoopResultBuilder]: At program point $Ultimate##32(lines 93 104) the Hoare annotation is: (let ((.cse17 (= ~C_1_st~0 0))) (let ((.cse10 (= ~C_1_pc~0 1)) (.cse11 (not .cse17)) (.cse16 (= ~i~0 1)) (.cse14 (<= ~P_1_ev~0 0)) (.cse15 (<= ~C_1_ev~0 0)) (.cse12 (= ~P_1_pc~0 0)) (.cse0 (<= 1 ~i~0)) (.cse1 (<= 2 ~C_1_ev~0)) (.cse2 (<= 2 ~P_1_ev~0)) (.cse3 (= 2 ~C_1_pc~0)) (.cse4 (<= ~e~0 0)) (.cse5 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse6 (<= ~max_loop~0 ~i~0)) (.cse7 (<= 1 ~P_1_pc~0)) (.cse13 (= ~num~0 0)) (.cse8 (= ~C_1_i~0 1)) (.cse9 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~num~0 1) .cse8 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse7 .cse11 (<= 1 ~num~0) .cse8 .cse9) (and .cse10 (or (and .cse0 .cse2 .cse4 .cse5 .cse12 .cse13 .cse11 .cse9) (and .cse4 .cse5 .cse14 .cse15 .cse16 .cse12 .cse13 .cse11 .cse9)) .cse8) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse7 .cse13 .cse11 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse17 (= ~P_1_pc~0 1) .cse4 .cse5 (<= ~max_loop~0 2) .cse16 .cse13 .cse8 .cse9) (and .cse17 (= ~i~0 0) .cse4 .cse5 .cse14 (= ~max_loop~0 2) .cse15 .cse12 (= ~C_1_pc~0 0) .cse13 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse13 .cse8 .cse9)))) [2023-11-06 23:05:49,768 INFO L895 garLoopResultBuilder]: At program point L457(line 457) the Hoare annotation is: (let ((.cse18 (<= ~P_1_ev~0 0)) (.cse19 (<= ~C_1_ev~0 0)) (.cse20 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse21 (= ~P_1_pc~0 1)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse16 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse16 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse17 .cse11 .cse18 .cse19 .cse20 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse20 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse2 .cse3 .cse15 .cse4)) .cse21 (<= ~max_loop~0 2)) (and .cse16 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 (<= ~i~0 2147483646) .cse13 .cse2 (not .cse21) .cse3 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse16 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,768 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 499 520) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-06 23:05:49,768 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 179) no Hoare annotation was computed. [2023-11-06 23:05:49,769 INFO L895 garLoopResultBuilder]: At program point L457-1(line 457) the Hoare annotation is: (let ((.cse18 (<= ~P_1_ev~0 0)) (.cse19 (<= ~C_1_ev~0 0)) (.cse20 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse21 (= ~P_1_pc~0 1)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse16 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse16 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse17 .cse11 .cse18 .cse19 .cse20 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse20 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse2 .cse3 .cse15 .cse4)) .cse21 (<= ~max_loop~0 2)) (and .cse16 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 (<= ~i~0 2147483646) .cse13 .cse2 (not .cse21) .cse3 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse16 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,769 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2023-11-06 23:05:49,769 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2023-11-06 23:05:49,769 INFO L899 garLoopResultBuilder]: For program point L160-1(line 160) no Hoare annotation was computed. [2023-11-06 23:05:49,770 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-06 23:05:49,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 23:05:49,770 INFO L895 garLoopResultBuilder]: At program point L441(line 441) the Hoare annotation is: (let ((.cse4 (= ~C_1_st~0 0)) (.cse0 (= ~i~0 0)) (.cse6 (<= ~e~0 0)) (.cse7 (<= ~P_1_ev~0 0)) (.cse8 (<= ~C_1_ev~0 0)) (.cse1 (= ~P_1_pc~0 0)) (.cse2 (= ~C_1_pc~0 0)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (not .cse4) .cse5) (and .cse4 .cse0 .cse6 .cse7 (= ~max_loop~0 2) .cse8 .cse1 .cse2 .cse3 (= ~C_1_i~0 1)) (and .cse0 .cse6 .cse7 .cse8 .cse1 .cse2 .cse3 .cse5))) [2023-11-06 23:05:49,770 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2023-11-06 23:05:49,771 INFO L895 garLoopResultBuilder]: At program point L458(line 458) the Hoare annotation is: (let ((.cse23 (= ~P_1_pc~0 1))) (let ((.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~C_1_ev~0 0)) (.cse22 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse16 (<= ~i~0 2147483646)) (.cse17 (not .cse23)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse19 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse18 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 .cse16 .cse13 .cse2 .cse17 (= ~C_1_ev~0 1) .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse18 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse19 .cse11 .cse20 .cse21 .cse22 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse22 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse20 .cse21 .cse22 .cse2 .cse3 .cse15 .cse4)) .cse23 (<= ~max_loop~0 2)) (and .cse18 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse19 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse20 .cse21 .cse22 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 .cse16 .cse13 .cse2 .cse17 .cse3 .cse4) (and .cse7 .cse9 .cse19 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse18 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4)))) [2023-11-06 23:05:49,771 INFO L899 garLoopResultBuilder]: For program point L293(lines 293 300) no Hoare annotation was computed. [2023-11-06 23:05:49,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 97) no Hoare annotation was computed. [2023-11-06 23:05:49,771 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 68) no Hoare annotation was computed. [2023-11-06 23:05:49,771 INFO L895 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-06 23:05:49,772 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-11-06 23:05:49,772 INFO L895 garLoopResultBuilder]: At program point L459(line 459) the Hoare annotation is: (let ((.cse23 (= ~P_1_pc~0 1))) (let ((.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~C_1_ev~0 0)) (.cse22 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse16 (<= ~i~0 2147483646)) (.cse17 (not .cse23)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse19 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse18 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 .cse16 .cse13 .cse2 .cse17 (= ~C_1_ev~0 1) .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse18 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse19 .cse11 .cse20 .cse21 .cse22 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse22 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse20 .cse21 .cse22 .cse2 .cse3 .cse15 .cse4)) .cse23 (<= ~max_loop~0 2)) (and .cse18 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse19 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse20 .cse21 .cse22 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 .cse16 .cse13 .cse2 .cse17 .cse3 .cse4) (and .cse7 .cse9 .cse19 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse18 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4)))) [2023-11-06 23:05:49,773 INFO L895 garLoopResultBuilder]: At program point L426(lines 415 428) the Hoare annotation is: (let ((.cse25 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse21 (= ~C_1_pc~0 1)) (.cse3 (<= ~i~0 2147483646)) (.cse20 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse19 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse24 (= ~num~0 1)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse25)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse21 .cse2 .cse22 .cse23 .cse17 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse20 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse10 .cse11 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse5 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse19 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse10 .cse11 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse5 .cse10 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse24 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse24 .cse18) (and (= ~i~0 0) .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,773 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 23:05:49,773 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 364) no Hoare annotation was computed. [2023-11-06 23:05:49,773 INFO L899 garLoopResultBuilder]: For program point L360-2(lines 359 372) no Hoare annotation was computed. [2023-11-06 23:05:49,773 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2023-11-06 23:05:49,774 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2023-11-06 23:05:49,774 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-06 23:05:49,774 INFO L899 garLoopResultBuilder]: For program point L97-1(line 97) no Hoare annotation was computed. [2023-11-06 23:05:49,774 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 271 325) the Hoare annotation is: (let ((.cse18 (<= ~P_1_ev~0 0)) (.cse19 (<= ~C_1_ev~0 0)) (.cse20 (= ~i~0 1)) (.cse14 (= ~num~0 1)) (.cse8 (<= 2 ~C_1_ev~0)) (.cse12 (<= ~max_loop~0 ~i~0)) (.cse10 (= 2 ~C_1_pc~0)) (.cse21 (= ~P_1_pc~0 1)) (.cse7 (<= 1 ~i~0)) (.cse9 (<= 2 ~P_1_ev~0)) (.cse17 (= ~C_1_pc~0 1)) (.cse13 (<= 1 ~P_1_pc~0)) (.cse15 (= ~C_1_i~0 1)) (.cse16 (<= ~C_1_pc~0 1)) (.cse3 (not (= ~C_1_st~0 0))) (.cse5 (<= 1 ~num~0)) (.cse6 (<= 2 ~P_1_pc~0)) (.cse11 (<= ~e~0 0)) (.cse0 (= ~P_1_pc~0 0)) (.cse1 (= ~C_1_pc~0 0)) (.cse2 (= ~num~0 0)) (.cse4 (not (= ~P_1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse3 .cse5 .cse6 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse1 .cse2 .cse3 .cse6 .cse4) (and .cse16 .cse11 .cse0 .cse2 .cse3 .cse4) (and .cse17 .cse11 .cse18 .cse19 .cse20 .cse13 .cse14 .cse3 .cse15 .cse4) (and (or (and .cse8 .cse9 .cse10 .cse11 .cse20 .cse2 .cse3 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse2 .cse3 .cse15 .cse4)) .cse21 (<= ~max_loop~0 2)) (and .cse16 .cse11 .cse2 .cse3 .cse6 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse3 .cse5 .cse15 .cse4) (and .cse10 .cse11 .cse18 .cse19 .cse20 .cse12 .cse13 .cse14 .cse3 .cse15 .cse4) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse7 .cse10 .cse11 (<= ~i~0 2147483646) .cse13 .cse2 (not .cse21) .cse3 .cse4) (and .cse7 .cse9 .cse17 .cse11 .cse13 .cse2 .cse3 .cse15 .cse4) (and .cse16 .cse11 .cse3 .cse5 .cse6 .cse4) (and (= ~i~0 0) .cse11 .cse0 .cse1 .cse2 .cse4))) [2023-11-06 23:05:49,775 INFO L899 garLoopResultBuilder]: For program point L477(lines 477 481) no Hoare annotation was computed. [2023-11-06 23:05:49,775 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2023-11-06 23:05:49,775 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 23:05:49,775 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2023-11-06 23:05:49,776 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 445 482) the Hoare annotation is: (let ((.cse26 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse24 (= ~C_1_pc~0 1)) (.cse3 (<= ~i~0 2147483646)) (.cse23 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse22 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse25 (= ~num~0 1)) (.cse19 (= ~i~0 0)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse21 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse26)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse15 .cse19 .cse2 .cse20 (= ~max_loop~0 2) .cse21 .cse8 .cse9 .cse5 .cse18) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse22 .cse4 .cse5 .cse18 .cse7) (and .cse23 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse24 .cse2 .cse20 .cse21 .cse17 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse23 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse14 .cse24 .cse2 .cse4 .cse10 .cse11 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse22 .cse4 .cse5 .cse18) (and .cse0 .cse14 .cse24 .cse2 .cse26 .cse4 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse20 .cse21 .cse17 .cse22 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse24 .cse2 .cse26 .cse4 .cse10 .cse11 .cse18) (and .cse0 .cse14 .cse24 .cse2 .cse4 .cse5 .cse10 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse23 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse22 .cse4 .cse25 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse22 .cse4 .cse25 .cse18) (and .cse19 .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse20 .cse21 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,776 INFO L895 garLoopResultBuilder]: At program point L280(line 280) the Hoare annotation is: (let ((.cse24 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse27 (= ~C_1_pc~0 1)) (.cse28 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse3 (<= ~i~0 2147483646)) (.cse26 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse23 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse21 (= ~max_loop~0 2)) (.cse25 (= ~num~0 1)) (.cse19 (= ~i~0 0)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse20 (<= ~P_1_ev~0 0)) (.cse22 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse24)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse15 .cse19 .cse2 .cse20 .cse21 .cse22 .cse8 .cse9 .cse5 .cse18) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse23 .cse4 .cse5 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse24 .cse23 .cse4 .cse25 .cse18) (and .cse26 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse27 .cse2 .cse20 .cse22 .cse17 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse27 .cse2 .cse4 .cse10 (<= 0 ~num~0) .cse18) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse24 .cse23 .cse4 .cse5 .cse18) (and .cse26 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse27 .cse2 .cse28 .cse20 .cse22 .cse17 .cse8 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse20 .cse22 .cse17 .cse23 .cse4 .cse25 .cse10 .cse18 .cse7) (and .cse15 .cse6 .cse19 .cse2 .cse28 .cse20 .cse21 .cse22 .cse9 .cse25 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse26 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse23 .cse4 .cse25 .cse18 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse21 .cse17 .cse25 .cse18 .cse7) (and .cse19 .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse20 .cse22 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,776 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 90) no Hoare annotation was computed. [2023-11-06 23:05:49,777 INFO L899 garLoopResultBuilder]: For program point L462(line 462) no Hoare annotation was computed. [2023-11-06 23:05:49,777 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (or (< 0 ~P_1_pc~0) (= ~P_1_pc~0 0)) [2023-11-06 23:05:49,777 INFO L895 garLoopResultBuilder]: At program point L66-1(lines 55 73) the Hoare annotation is: (let ((.cse1 (= ~C_1_st~0 0)) (.cse11 (= ~P_1_pc~0 0))) (let ((.cse9 (<= ~P_1_ev~0 0)) (.cse10 (<= ~C_1_ev~0 0)) (.cse5 (= ~i~0 1)) (.cse6 (= ~num~0 0)) (.cse4 (<= ~num~0 |ULTIMATE.start_write_data_~i___0#1|)) (.cse13 (<= 1 ~i~0)) (.cse14 (or (< 0 ~P_1_pc~0) .cse11)) (.cse0 (<= 2 ~P_1_ev~0)) (.cse12 (= ~C_1_pc~0 1)) (.cse2 (<= ~e~0 0)) (.cse3 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse15 (not .cse1)) (.cse7 (= ~C_1_i~0 1)) (.cse8 (not (= ~P_1_st~0 0)))) (or (and (<= 2 ~C_1_ev~0) .cse0 (= 2 ~C_1_pc~0) .cse1 (= ~P_1_pc~0 1) .cse2 .cse3 (<= (+ ~i~0 1) ~max_loop~0) (<= ~max_loop~0 2) .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 (= ~i~0 0) .cse2 .cse3 .cse9 (= ~max_loop~0 2) .cse4 .cse10 .cse11 (= ~C_1_pc~0 0) .cse6 .cse7 .cse8) (and .cse12 (or (and .cse13 .cse14 .cse0 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse2 .cse3 .cse9 .cse10 .cse5 .cse11 .cse6 .cse15 .cse8)) .cse4 .cse7) (and .cse13 .cse14 .cse0 .cse12 .cse2 .cse3 (<= 1 |ULTIMATE.start_write_data_~i___0#1|) (= ~num~0 1) .cse15 .cse7 .cse8)))) [2023-11-06 23:05:49,777 INFO L899 garLoopResultBuilder]: For program point L446(line 446) no Hoare annotation was computed. [2023-11-06 23:05:49,778 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 169) no Hoare annotation was computed. [2023-11-06 23:05:49,778 INFO L899 garLoopResultBuilder]: For program point L282(line 282) no Hoare annotation was computed. [2023-11-06 23:05:49,778 INFO L895 garLoopResultBuilder]: At program point L51(lines 36 53) the Hoare annotation is: (let ((.cse0 (= 2 ~C_1_pc~0)) (.cse4 (= ~P_1_pc~0 1)) (.cse1 (<= ~e~0 0)) (.cse2 (<= 1 |ULTIMATE.start_eval_~tmp___2~0#1|)) (.cse7 (= ~max_loop~0 2)) (.cse3 (= ~num~0 0)) (.cse5 (not (= ~C_1_st~0 0))) (.cse8 (= ~C_1_i~0 1)) (.cse6 (not (= ~P_1_st~0 0)))) (or (and (<= 1 ~i~0) .cse0 .cse1 .cse2 (<= ~i~0 2147483645) (<= 1 ~P_1_pc~0) .cse3 (not .cse4) .cse5 .cse6) (and .cse4 (= ~i~0 0) .cse1 (= |ULTIMATE.start_read_data_~i___0#1| 0) .cse2 (<= ~P_1_ev~0 0) .cse7 (<= ~C_1_ev~0 0) (= ~C_1_pc~0 0) .cse3 .cse5 .cse8 .cse6) (and (<= 2 ~C_1_ev~0) (<= 2 ~P_1_ev~0) (= ~num~0 |ULTIMATE.start_read_data_~i___0#1|) .cse0 .cse4 .cse1 .cse2 .cse7 (= ~i~0 1) .cse3 .cse5 .cse8 .cse6))) [2023-11-06 23:05:49,779 INFO L895 garLoopResultBuilder]: At program point stop_simulation_returnLabel#1(lines 411 429) the Hoare annotation is: (let ((.cse25 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse21 (= ~C_1_pc~0 1)) (.cse3 (<= ~i~0 2147483646)) (.cse20 (<= ~C_1_pc~0 1)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse19 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse24 (= ~num~0 1)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse6 (= ~P_1_pc~0 1)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse2 (<= ~e~0 0)) (.cse22 (<= ~P_1_ev~0 0)) (.cse23 (<= ~C_1_ev~0 0)) (.cse17 (= ~i~0 1)) (.cse5 (= ~num~0 0)) (.cse10 (not .cse15)) (.cse18 (= ~C_1_i~0 1)) (.cse7 (not .cse25)) (.cse16 (<= ~max_loop~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 .cse16 .cse17 .cse5 .cse18) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse21 .cse2 .cse22 .cse23 .cse17 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse20 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse10 .cse11 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse5 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse5 .cse10 .cse18) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse19 .cse4 .cse24 .cse10 .cse18 .cse7) (and .cse0 .cse14 .cse21 .cse2 .cse25 .cse4 .cse10 .cse11 .cse18) (and .cse0 .cse14 .cse21 .cse2 .cse4 .cse5 .cse10 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7) (and .cse20 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse2 .cse19 .cse4 .cse24 .cse18 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse24 .cse18) (and (= ~i~0 0) .cse2 .cse8 .cse9 .cse5 .cse7) (and .cse6 (or (and .cse13 .cse14 .cse1 .cse2 .cse17 .cse5 .cse18 .cse7) (and .cse1 .cse2 .cse22 .cse23 .cse17 .cse5 .cse10 .cse18 .cse7)) .cse16)))) [2023-11-06 23:05:49,779 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 473) no Hoare annotation was computed. [2023-11-06 23:05:49,779 INFO L899 garLoopResultBuilder]: For program point L464-2(lines 464 473) no Hoare annotation was computed. [2023-11-06 23:05:49,780 INFO L895 garLoopResultBuilder]: At program point L365-1(lines 356 373) the Hoare annotation is: (let ((.cse20 (= ~P_1_st~0 0)) (.cse15 (= ~C_1_st~0 0))) (let ((.cse6 (= ~P_1_pc~0 1)) (.cse18 (= ~C_1_pc~0 1)) (.cse3 (<= ~i~0 2147483646)) (.cse17 (<= ~C_1_pc~0 1)) (.cse10 (not .cse15)) (.cse11 (<= 1 ~num~0)) (.cse12 (<= 2 ~P_1_pc~0)) (.cse0 (<= 1 ~i~0)) (.cse13 (<= 2 ~C_1_ev~0)) (.cse14 (<= 2 ~P_1_ev~0)) (.cse1 (= 2 ~C_1_pc~0)) (.cse19 (<= ~max_loop~0 ~i~0)) (.cse4 (<= 1 ~P_1_pc~0)) (.cse16 (= ~C_1_i~0 1)) (.cse2 (<= ~e~0 0)) (.cse8 (= ~P_1_pc~0 0)) (.cse9 (= ~C_1_pc~0 0)) (.cse5 (= ~num~0 0)) (.cse7 (not .cse20))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7) (and .cse8 .cse9 .cse5 .cse10 .cse7) (and .cse9 .cse10 .cse11 .cse12 .cse7) (and .cse13 .cse14 .cse1 .cse15 .cse6 .cse2 (<= ~max_loop~0 2) (= ~i~0 1) .cse5 .cse16) (and .cse9 .cse5 .cse10 .cse12 .cse7) (and .cse17 .cse2 .cse8 .cse5 .cse10 .cse7) (and .cse17 .cse2 .cse5 .cse10 .cse12 .cse7) (and .cse0 .cse14 .cse18 .cse2 .cse4 .cse10 .cse11 .cse16 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 .cse5 .cse16) (and .cse0 .cse14 .cse18 .cse2 .cse20 .cse4 .cse5 .cse10 .cse16) (and .cse0 .cse14 .cse18 .cse2 .cse20 .cse4 .cse10 .cse11 .cse16) (and .cse0 .cse14 .cse18 .cse2 .cse4 .cse5 .cse10 .cse16 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse3 .cse4 .cse5 .cse16 .cse7) (and .cse17 .cse2 .cse10 .cse11 .cse12 .cse7) (and .cse0 .cse13 .cse14 .cse1 .cse15 .cse2 .cse19 .cse4 (= ~num~0 1) .cse16) (and (= ~i~0 0) .cse2 .cse8 .cse9 .cse5 .cse7)))) [2023-11-06 23:05:49,780 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2023-11-06 23:05:49,780 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2023-11-06 23:05:49,780 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2023-11-06 23:05:49,780 INFO L899 garLoopResultBuilder]: For program point errorFINAL(lines 15 22) no Hoare annotation was computed. [2023-11-06 23:05:49,784 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:49,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:05:50,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:05:50 BoogieIcfgContainer [2023-11-06 23:05:50,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:05:50,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:05:50,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:05:50,050 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:05:50,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:24" (3/4) ... [2023-11-06 23:05:50,053 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 23:05:50,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2023-11-06 23:05:50,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2023-11-06 23:05:50,058 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2023-11-06 23:05:50,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2023-11-06 23:05:50,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2023-11-06 23:05:50,059 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2023-11-06 23:05:50,079 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-06 23:05:50,080 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 23:05:50,081 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 23:05:50,082 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 23:05:50,122 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((!((C_1_i == 1)) || (num < 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((\old(P_1_st) == 0)) || (((C_1_st == 0) && (P_1_st == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && (((((!((C_1_pc == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((1 < C_1_pc) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)))) || (2 < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,122 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((\old(P_1_st) == 0) || !((C_1_pc == P_1_pc))) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || ((((C_1_st == 0) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (2 < max_loop)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,125 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || (((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (2 < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (num < 1)) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) && ((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) [2023-11-06 23:05:50,126 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || ((((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) && (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))))) || !((P_1_pc == 1))) || (2 < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((\old(P_1_st) == 0) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((((!((C_1_i == 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || ((((P_1_st == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (__retres1 == 0))) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,216 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((!((C_1_i == 1)) || (num < 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((\old(P_1_st) == 0)) || (((C_1_st == 0) && (P_1_st == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && (((((!((C_1_pc == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((1 < C_1_pc) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)))) || (2 < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,217 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((\old(P_1_st) == 0) || !((C_1_pc == P_1_pc))) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || ((((C_1_st == 0) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (2 < max_loop)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,219 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || (((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (2 < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (num < 1)) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) && ((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) [2023-11-06 23:05:50,220 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || ((((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) && (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))))) || !((P_1_pc == 1))) || (2 < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((\old(P_1_st) == 0) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((((!((C_1_i == 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || ((((P_1_st == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (__retres1 == 0))) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) [2023-11-06 23:05:50,270 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:05:50,278 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 23:05:50,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:05:50,278 INFO L158 Benchmark]: Toolchain (without parser) took 146792.30ms. Allocated memory was 197.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 168.1MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 23:05:50,279 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory was 106.6MB in the beginning and 106.4MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:50,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.14ms. Allocated memory is still 197.1MB. Free memory was 167.9MB in the beginning and 157.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-06 23:05:50,281 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.17ms. Allocated memory is still 197.1MB. Free memory was 157.8MB in the beginning and 155.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:50,281 INFO L158 Benchmark]: Boogie Preprocessor took 77.36ms. Allocated memory is still 197.1MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:50,283 INFO L158 Benchmark]: RCFGBuilder took 775.45ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 152.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-06 23:05:50,284 INFO L158 Benchmark]: TraceAbstraction took 145210.56ms. Allocated memory was 197.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 151.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2023-11-06 23:05:50,284 INFO L158 Benchmark]: Witness Printer took 228.61ms. Allocated memory is still 3.7GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 23:05:50,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory was 106.6MB in the beginning and 106.4MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.14ms. Allocated memory is still 197.1MB. Free memory was 167.9MB in the beginning and 157.8MB in the end (delta: 10.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.17ms. Allocated memory is still 197.1MB. Free memory was 157.8MB in the beginning and 155.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.36ms. Allocated memory is still 197.1MB. Free memory was 155.8MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 775.45ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 152.0MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 145210.56ms. Allocated memory was 197.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 151.0MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. * Witness Printer took 228.61ms. Allocated memory is still 3.7GB. Free memory was 1.9GB in the beginning and 1.9GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 97]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 160]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 169]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 179]: 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 7 procedures, 123 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 144.9s, OverallIterations: 40, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 32.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 67.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7256 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7057 mSDsluCounter, 18406 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11064 mSDsCounter, 755 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3987 IncrementalHoareTripleChecker+Invalid, 4742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 755 mSolverCounterUnsat, 7342 mSDtfsCounter, 3987 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6695 GetRequests, 6446 SyntacticMatches, 3 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22194occurred in iteration=26, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.8s AutomataMinimizationTime, 40 MinimizatonAttempts, 14950 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 28882 PreInvPairs, 31771 NumberOfFragments, 15487 HoareAnnotationTreeSize, 28882 FomulaSimplifications, 346941 FormulaSimplificationTreeSizeReduction, 20.8s HoareSimplificationTime, 45 FomulaSimplificationsInter, 121557 FormulaSimplificationTreeSizeReductionInter, 45.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 12286 NumberOfCodeBlocks, 12286 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 12654 ConstructedInterpolants, 0 QuantifiedInterpolants, 20678 SizeOfPredicates, 9 NumberOfNonLiveVariables, 11992 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 61 InterpolantComputations, 38 PerfectInterpolantSequences, 21941/22474 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 8 specifications checked. All of them hold - InvariantResult [Line: 271]: Loop Invariant Derived loop invariant: (((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) && (P_1_pc == 1)) && (max_loop <= 2))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483645)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (i___0 == 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (num == i___0)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop == 2)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((((2 == C_1_pc) && (P_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_ev == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (P_1_ev == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_ev == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (P_1_ev == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_ev == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (C_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_ev == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (C_1_pc == 1)) && (e <= 0)) && (P_1_ev == 1)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (C_1_ev == 1)) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || (((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((((((1 <= __retres1) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) || !((P_1_ev == 1))) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (((1 <= __retres1) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (2 < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0))))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (num < 1)) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) && ((((((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || !((C_1_pc == 1))) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)) && !((P_1_st == 0)))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || ((((((((1 <= i) && (e <= 0)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st))) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && (C_1_ev == 1)))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483645)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (i___0 == 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (num == i___0)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop == 2)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((\old(P_1_st) == 0) || !((C_1_pc == P_1_pc))) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || ((((C_1_st == 0) && (P_1_st == 0)) && (\result == 0)) && (__retres1 == 0))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) || (2 < max_loop)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || ((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && (\result == 0)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (P_1_pc < 1))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || ((\result == 0) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || ((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((num == 0))) || (P_1_pc < 1))) - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: ((0 < P_1_pc) || (P_1_pc == 0)) - InvariantResult [Line: 195]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((!((\old(P_1_st) == 0)) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || ((((((tmp == 0) && (C_1_st == 0)) && (P_1_st == 0)) && (\result == 0)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0))) && (((((((((((2147483646 < i) || (P_1_pc == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (C_1_ev == 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) && (((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))))) || !((P_1_pc == 1))) || (2 < max_loop))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((\old(P_1_st) == 0) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((((!((C_1_i == 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (\old(P_1_st) == P_1_st)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || !((P_1_pc == 1))) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((1 < C_1_pc) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && ((((((((((2147483646 < i) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((1 <= __retres1) && (1 <= \result)) && (P_1_st == 0)) && (C_1_st == \old(C_1_st)))) || !((2 == C_1_pc))) || ((((1 <= __retres1) && (1 <= \result)) && (C_1_st == \old(C_1_st))) && (\old(P_1_st) == P_1_st))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((!((C_1_pc == 0)) || (\old(P_1_st) == 0)) || ((((((tmp == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (\result == 0)) && (__retres1 == 0))) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || ((((P_1_st == 0) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (__retres1 == 0))) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || (num < 1)) || (((((((((1 <= i) && (e <= 0)) && (C_1_st == \old(C_1_st))) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (__retres1 == 0)) && !((P_1_st == 0)))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || ((((C_1_st == \old(C_1_st)) && (\result == 0)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!((C_1_i == 1)) || (num < 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (1 < num)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((\old(P_1_st) == 0)) || (((C_1_st == 0) && (P_1_st == 0)) && (__retres1 == 0))) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((\old(C_1_st) == 0))) || !((i == 0)))) && (((((!((C_1_pc == 0)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && ((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (num < 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((1 < C_1_pc) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (0 < e)) || !((P_1_pc == 0))) || (\old(C_1_st) == 0)) || !((num == 0)))) && (((((((P_1_pc == 1) || (num < 1)) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (num < 1)) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((P_1_pc == 1) || (1 < C_1_pc)) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && ((((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (__retres1 == 0)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)) && ((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1)))) || (2 < max_loop))) && (((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (2 < max_loop)) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((!((C_1_i == 1)) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || !((C_1_pc == 1))) || (\old(P_1_st) == 0)) || (num < 0)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1))) && ((((((((((((!((C_1_i == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (1 < i)) || (0 < P_1_ev)) || (\old(P_1_st) == 0)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((((!((P_1_ev == 1)) || !((C_1_i == 1))) || ((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st))) || !((2 == C_1_pc))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || (\old(C_1_st) == 0)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && ((((((((((2147483646 < i) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0))) || (\old(P_1_st) == 0)) || !((C_1_ev == 1))) || (i < 1)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1))) && (((((((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (__retres1 == 0)) || (\old(P_1_st) == 0)) || !((C_1_pc == P_1_pc))) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((i == 0)))) && (((((((P_1_pc == 1) || !((C_1_pc == 0))) || (\old(P_1_st) == 0)) || (((((C_1_st == \old(C_1_st)) && (\old(P_1_st) == P_1_st)) && (1 <= P_1_pc)) && !((P_1_pc == 1))) && (__retres1 == 0))) || (\old(C_1_st) == 0)) || !((num == 0))) || (P_1_pc < 1))) - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0))) || (((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: (((((((((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((C_1_pc == 1) && (((((((((1 <= i) && (2 <= P_1_ev)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((e <= 0) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))))) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: ((((((((((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= 2)) && (i == 1)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((((i == 0) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: (((((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop == 2)) && (i == 1)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0)))) || ((((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((((C_1_pc == 1) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0))) || (((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_st == 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((1 <= __retres1) || !((C_1_i == 1))) || (2147483646 < i)) || !((2 == C_1_pc))) || (P_1_st == 0)) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || !((C_1_st == 0))) || !((num == 0))) || (P_1_pc < 1)) && (((((((((((1 <= __retres1) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || !((C_1_st == 0))) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop))) && (((((((((((1 <= __retres1) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1)) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((((((((1 <= __retres1) || !((C_1_i == 1))) || (num < 1)) || !((2 == C_1_pc))) || (P_1_st == 0)) || (C_1_ev < 2)) || (1 < num)) || (i < 1)) || !((P_1_pc == 1))) || (P_1_ev < 2)) || (0 < e)) || (2 < max_loop)) || !((C_1_st == 0)))) && (((((((((!((C_1_i == 1)) || (C_1_st == 0)) || !((C_1_pc == 1))) || ((((((1 <= i) && (1 <= __retres1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0)))) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || !((num == 0))) || (P_1_pc < 1)) || !((P_1_st == 0)))) && ((((((((((((1 <= __retres1) || !((C_1_i == 1))) || (0 < P_1_ev)) || !((C_1_pc == P_1_pc))) || (0 < C_1_ev)) || !((max_loop == 2))) || (0 < e)) || !((P_1_pc == 0))) || !((C_1_st == 0))) || !((num == 0))) || !((P_1_st == 0))) || !((i == 0)))) && ((((((((((((1 <= __retres1) || !((C_1_i == 1))) || (C_1_st == 0)) || (1 < i)) || !((C_1_pc == 1))) || (0 < P_1_ev)) || (0 < C_1_ev)) || (i < 1)) || (0 < e)) || !((P_1_pc == 0))) || !((num == 0))) || !((P_1_st == 0)))) && (((((((((((((1 <= __retres1) || !((C_1_i == 1))) || (num < 1)) || !((C_1_pc == 0))) || (P_1_st == 0)) || (0 < P_1_ev)) || (0 < C_1_ev)) || (1 < num)) || !((P_1_pc == 1))) || !((max_loop == 2))) || (0 < e)) || !((C_1_st == 0))) || !((i == 0)))) && ((((((((((1 <= __retres1) || (2147483646 < i)) || (P_1_pc == 1)) || !((2 == C_1_pc))) || (P_1_st == 0)) || (i < 1)) || (0 < e)) || !((C_1_st == 0))) || !((num == 0))) || (P_1_pc < 1))) && (((((((((((1 <= __retres1) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (C_1_ev < 2)) || (i < 1)) || !((P_1_pc == 1))) || (P_1_ev < 2)) || (0 < e)) || (2 < max_loop)) || !((C_1_st == 0))) || !((num == 0)))) && (((((((((((1 <= __retres1) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop)) || !((P_1_st == 0)))) && (((((((((((1 <= __retres1) || !((C_1_i == 1))) || !((2 == C_1_pc))) || (C_1_ev < 2)) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || !((C_1_st == 0))) || (P_1_pc < 1)) || !((num == 1))) || (i < max_loop))) && (((((((((!((C_1_i == 1)) || (C_1_st == 0)) || (num < 1)) || !((C_1_pc == 1))) || ((((((1 <= i) && (1 <= __retres1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0)))) || (i < 1)) || (P_1_ev < 2)) || (0 < e)) || (P_1_pc < 1)) || !((P_1_st == 0)))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && ((i + 1) <= max_loop)) && (max_loop <= 2)) && (num <= i___0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (num <= i___0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((C_1_pc == 1) && (((((((((1 <= i) && ((0 < P_1_pc) || (P_1_pc == 0))) && (2 <= P_1_ev)) && (e <= 0)) && (1 <= tmp___2)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((((((e <= 0) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))))) && (num <= i___0)) && (C_1_i == 1))) || (((((((((((1 <= i) && ((0 < P_1_pc) || (P_1_pc == 0))) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= i___0)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((0 < P_1_pc) || (P_1_pc == 0)) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((((i == 0) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((((((((i == 0) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) - InvariantResult [Line: 411]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0))) || (((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0))) || (((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (P_1_st == 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (1 <= num)) && (C_1_i == 1))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((P_1_st == 0))) || (((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop <= 2)) && (i == 1)) && (num == 0)) && (C_1_i == 1))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((C_1_st == 0) && (i == 0)) && (e <= 0)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (P_1_st == 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= P_1_pc)) && !((C_1_st == 0))) && (0 <= num)) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (P_1_st == 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((((((((C_1_st == 0) && (P_1_pc == 1)) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (e <= 0)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (C_1_st == 0)) && (P_1_pc == 1)) && (e <= 0)) && (max_loop == 2)) && (i == 1)) && (num == 1)) && (C_1_i == 1)) && !((P_1_st == 0)))) || ((((((i == 0) && (e <= 0)) && (P_1_pc == 0)) && (C_1_pc == 0)) && (num == 0)) && !((P_1_st == 0)))) || (((P_1_pc == 1) && (((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (i == 1)) && (num == 0)) && (C_1_i == 1)) && !((P_1_st == 0))) || (((((((((2 == C_1_pc) && (e <= 0)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))))) && (max_loop <= 2))) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((((P_1_pc == 0) && (C_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0))) || (((((C_1_pc == 0) && !((C_1_st == 0))) && (1 <= num)) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || (((((C_1_pc == 0) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((C_1_pc <= 1) && (e <= 0)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && !((P_1_st == 0)))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((((((((((1 <= i) && (2 <= C_1_ev)) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || (((P_1_pc == 1) && (max_loop <= 2)) && (((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))) || ((((((((((2 == C_1_pc) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))))) || ((((((C_1_pc <= 1) && (e <= 0)) && (num == 0)) && !((C_1_st == 0))) && (2 <= P_1_pc)) && !((P_1_st == 0)))) || ((((((((((C_1_pc == 1) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (P_1_pc == 0)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) || ((((((((((1 <= i) && (2 == C_1_pc)) && (e <= 0)) && (1 <= tmp___2)) && (i <= 2147483646)) && (1 <= P_1_pc)) && (num == 0)) && !((P_1_pc == 1))) && !((C_1_st == 0))) && !((P_1_st == 0)))) || ((((((((((((2 == C_1_pc) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (C_1_ev <= 0)) && (i == 1)) && (max_loop <= i)) && (1 <= P_1_pc)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) || (((((((((1 <= i) && (2 <= P_1_ev)) && (C_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (1 <= P_1_pc)) && (num == 0)) && !((C_1_st == 0))) && (C_1_i == 1))) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: (((((((((((((2 <= C_1_ev) && (2 <= P_1_ev)) && (2 == C_1_pc)) && (P_1_pc == 1)) && (e <= 0)) && (1 <= tmp___2)) && (max_loop == 2)) && (i == 1)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0))) || ((((((((((((P_1_pc == 1) && (i == 0)) && (e <= 0)) && (1 <= tmp___2)) && (P_1_ev <= 0)) && (max_loop == 2)) && (C_1_ev <= 0)) && (C_1_pc == 0)) && (num == 1)) && !((C_1_st == 0))) && (C_1_i == 1)) && !((P_1_st == 0)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 23:05:50,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9fb7637b-5045-47dd-8c69-da6453610d9d/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE