./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loops-crafted-1/discover_list.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_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/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_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/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_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/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 b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:31:40,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:31:40,342 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:31:40,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:31:40,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:31:40,399 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:31:40,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:31:40,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:31:40,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:31:40,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:31:40,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:31:40,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:31:40,404 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:31:40,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:31:40,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:31:40,405 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:31:40,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:31:40,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:31:40,407 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:31:40,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:31:40,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:31:40,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:31:40,409 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:31:40,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:31:40,410 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:31:40,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:31:40,411 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:31:40,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:31:40,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:31:40,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:31:40,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:40,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:31:40,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:31:40,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:31:40,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:31:40,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:31:40,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:31:40,436 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:31:40,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:31:40,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:31:40,437 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:31:40,438 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_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/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_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/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 -> b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 [2023-11-06 22:31:40,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:31:40,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:31:40,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:31:40,805 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:31:40,805 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:31:40,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loops-crafted-1/discover_list.c [2023-11-06 22:31:43,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:31:44,234 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:31:44,235 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/sv-benchmarks/c/loops-crafted-1/discover_list.c [2023-11-06 22:31:44,248 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/data/42fcf82f3/0ddfc86de4c6491dbf896cf815d1630a/FLAG400c21111 [2023-11-06 22:31:44,551 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/data/42fcf82f3/0ddfc86de4c6491dbf896cf815d1630a [2023-11-06 22:31:44,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:31:44,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:31:44,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:44,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:31:44,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:31:44,563 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:44" (1/1) ... [2023-11-06 22:31:44,564 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57ba5a57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:44, skipping insertion in model container [2023-11-06 22:31:44,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:31:44" (1/1) ... [2023-11-06 22:31:44,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:31:44,944 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:44,969 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:31:45,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:31:45,105 WARN L672 CHandler]: The function smp_send_req is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:31:45,106 WARN L672 CHandler]: The function toupper is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:31:45,106 WARN L672 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:31:45,114 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:31:45,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45 WrapperNode [2023-11-06 22:31:45,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:31:45,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:45,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:31:45,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:31:45,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,219 INFO L138 Inliner]: procedures = 36, calls = 643, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 569 [2023-11-06 22:31:45,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:31:45,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:31:45,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:31:45,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:31:45,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:31:45,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:31:45,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:31:45,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:31:45,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (1/1) ... [2023-11-06 22:31:45,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:45,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:45,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:31:45,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:31:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:31:45,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:31:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-06 22:31:45,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:31:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:31:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2023-11-06 22:31:45,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-06 22:31:45,424 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-06 22:31:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:31:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:31:45,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:31:45,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:31:45,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:31:45,427 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:31:45,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:31:45,615 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:31:45,618 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:31:46,399 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:31:46,408 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:31:46,408 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:31:46,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:46 BoogieIcfgContainer [2023-11-06 22:31:46,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:31:46,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:31:46,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:31:46,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:31:46,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:31:44" (1/3) ... [2023-11-06 22:31:46,424 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d20ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:46, skipping insertion in model container [2023-11-06 22:31:46,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:31:45" (2/3) ... [2023-11-06 22:31:46,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d20ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:31:46, skipping insertion in model container [2023-11-06 22:31:46,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:31:46" (3/3) ... [2023-11-06 22:31:46,429 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2023-11-06 22:31:46,451 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:31:46,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-06 22:31:46,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:31:46,515 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;@1f5c5139, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:31:46,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-06 22:31:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 148 states have internal predecessors, (185), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:31:46,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:46,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:31:46,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:46,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:46,533 INFO L85 PathProgramCache]: Analyzing trace with hash 37800, now seen corresponding path program 1 times [2023-11-06 22:31:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997986308] [2023-11-06 22:31:46,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,097 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 22:31:47,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:47,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997986308] [2023-11-06 22:31:47,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997986308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:47,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:47,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:31:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835800991] [2023-11-06 22:31:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:47,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:31:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:31:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:47,139 INFO L87 Difference]: Start difference. First operand has 159 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 148 states have internal predecessors, (185), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:47,237 INFO L93 Difference]: Finished difference Result 300 states and 384 transitions. [2023-11-06 22:31:47,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:31:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:31:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:47,249 INFO L225 Difference]: With dead ends: 300 [2023-11-06 22:31:47,249 INFO L226 Difference]: Without dead ends: 140 [2023-11-06 22:31:47,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:31:47,256 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:47,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:31:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-06 22:31:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-06 22:31:47,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 129 states have internal predecessors, (149), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:47,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2023-11-06 22:31:47,305 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 3 [2023-11-06 22:31:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:47,305 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2023-11-06 22:31:47,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:31:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2023-11-06 22:31:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:31:47,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:47,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:47,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:31:47,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:47,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash -68542022, now seen corresponding path program 1 times [2023-11-06 22:31:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760326526] [2023-11-06 22:31:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:47,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:47,585 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 22:31:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760326526] [2023-11-06 22:31:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760326526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:47,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:31:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129192125] [2023-11-06 22:31:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:31:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:31:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:31:47,591 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:47,915 INFO L93 Difference]: Finished difference Result 277 states and 329 transitions. [2023-11-06 22:31:47,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:31:47,916 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-06 22:31:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:47,924 INFO L225 Difference]: With dead ends: 277 [2023-11-06 22:31:47,925 INFO L226 Difference]: Without dead ends: 146 [2023-11-06 22:31:47,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:47,935 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:47,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 666 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-06 22:31:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-11-06 22:31:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 131 states have internal predecessors, (151), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:47,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2023-11-06 22:31:47,971 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 25 [2023-11-06 22:31:47,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:47,972 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2023-11-06 22:31:47,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:47,972 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2023-11-06 22:31:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 22:31:47,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:47,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:31:47,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:31:47,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:47,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:47,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1656889924, now seen corresponding path program 1 times [2023-11-06 22:31:47,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:47,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639670116] [2023-11-06 22:31:47,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,248 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 22:31:48,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:48,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639670116] [2023-11-06 22:31:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639670116] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:31:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776077147] [2023-11-06 22:31:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:48,258 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:48,459 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2023-11-06 22:31:48,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:48,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-06 22:31:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:48,463 INFO L225 Difference]: With dead ends: 151 [2023-11-06 22:31:48,469 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 22:31:48,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:48,474 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 132 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:48,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 376 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:31:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 22:31:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2023-11-06 22:31:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 133 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-06 22:31:48,492 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 25 [2023-11-06 22:31:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-06 22:31:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-06 22:31:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:31:48,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:48,495 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] [2023-11-06 22:31:48,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:31:48,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:48,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:48,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1066852143, now seen corresponding path program 1 times [2023-11-06 22:31:48,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:48,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077270414] [2023-11-06 22:31:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:48,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,637 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 22:31:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:48,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077270414] [2023-11-06 22:31:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077270414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:31:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365043298] [2023-11-06 22:31:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:48,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:31:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:31:48,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:48,640 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:48,777 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2023-11-06 22:31:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:31:48,778 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-06 22:31:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:48,779 INFO L225 Difference]: With dead ends: 153 [2023-11-06 22:31:48,780 INFO L226 Difference]: Without dead ends: 151 [2023-11-06 22:31:48,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:31:48,781 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:48,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 416 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-06 22:31:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2023-11-06 22:31:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 133 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-06 22:31:48,807 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 31 [2023-11-06 22:31:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:48,808 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-06 22:31:48,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-06 22:31:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:31:48,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:48,811 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] [2023-11-06 22:31:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:31:48,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:48,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1066854065, now seen corresponding path program 1 times [2023-11-06 22:31:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397632406] [2023-11-06 22:31:48,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:48,934 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 22:31:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397632406] [2023-11-06 22:31:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397632406] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:48,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819710635] [2023-11-06 22:31:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:48,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:48,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:48,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:48,936 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:49,108 INFO L93 Difference]: Finished difference Result 355 states and 415 transitions. [2023-11-06 22:31:49,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:49,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-06 22:31:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:49,111 INFO L225 Difference]: With dead ends: 355 [2023-11-06 22:31:49,111 INFO L226 Difference]: Without dead ends: 247 [2023-11-06 22:31:49,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 22:31:49,113 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:49,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 621 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-06 22:31:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 146. [2023-11-06 22:31:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.55) internal successors, (155), 135 states have internal predecessors, (155), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2023-11-06 22:31:49,129 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 31 [2023-11-06 22:31:49,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:49,129 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2023-11-06 22:31:49,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2023-11-06 22:31:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-06 22:31:49,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:49,131 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] [2023-11-06 22:31:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:31:49,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:49,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1116724199, now seen corresponding path program 1 times [2023-11-06 22:31:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095066600] [2023-11-06 22:31:49,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:49,457 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 22:31:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:49,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095066600] [2023-11-06 22:31:49,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095066600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:31:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:31:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:31:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905737352] [2023-11-06 22:31:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:31:49,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:31:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:49,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:31:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:31:49,462 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:31:49,601 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2023-11-06 22:31:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:31:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-06 22:31:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:31:49,603 INFO L225 Difference]: With dead ends: 277 [2023-11-06 22:31:49,603 INFO L226 Difference]: Without dead ends: 147 [2023-11-06 22:31:49,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:31:49,605 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:31:49,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 578 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:31:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-06 22:31:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-11-06 22:31:49,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 136 states have internal predecessors, (156), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:31:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2023-11-06 22:31:49,616 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 31 [2023-11-06 22:31:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:31:49,616 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2023-11-06 22:31:49,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:31:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2023-11-06 22:31:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:31:49,618 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:31:49,618 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] [2023-11-06 22:31:49,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:31:49,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:31:49,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:31:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -764469213, now seen corresponding path program 1 times [2023-11-06 22:31:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:31:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625174597] [2023-11-06 22:31:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:31:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:49,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:31:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:31:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625174597] [2023-11-06 22:31:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625174597] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502434188] [2023-11-06 22:31:49,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:31:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:31:49,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:31:49,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:31:49,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:31:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:31:50,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:31:50,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:31:50,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:31:50,393 INFO L322 Elim1Store]: treesize reduction 25, result has 49.0 percent of original size [2023-11-06 22:31:50,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 107 [2023-11-06 22:31:50,678 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:31:50,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:31:50,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:31:51,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-06 22:31:51,377 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:31:51,377 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 17 [2023-11-06 22:31:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:31:51,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:31:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502434188] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:31:51,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:31:51,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 17 [2023-11-06 22:31:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646855942] [2023-11-06 22:31:51,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:31:51,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:31:51,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:31:51,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:31:51,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=472, Unknown=5, NotChecked=0, Total=552 [2023-11-06 22:31:51,795 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:31:53,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:31:55,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:31:57,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:31:59,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:02,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:04,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:06,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:07,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:09,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:11,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:12,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:12,785 INFO L93 Difference]: Finished difference Result 386 states and 451 transitions. [2023-11-06 22:32:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:32:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2023-11-06 22:32:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:12,788 INFO L225 Difference]: With dead ends: 386 [2023-11-06 22:32:12,789 INFO L226 Difference]: Without dead ends: 253 [2023-11-06 22:32:12,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=131, Invalid=855, Unknown=6, NotChecked=0, Total=992 [2023-11-06 22:32:12,790 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 139 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 21 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:12,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 2607 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 546 Invalid, 30 Unknown, 0 Unchecked, 20.6s Time] [2023-11-06 22:32:12,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2023-11-06 22:32:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2023-11-06 22:32:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.5392156862745099) internal successors, (157), 137 states have internal predecessors, (157), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:32:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2023-11-06 22:32:12,806 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 32 [2023-11-06 22:32:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:12,806 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2023-11-06 22:32:12,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2023-11-06 22:32:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-06 22:32:12,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:12,809 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:32:12,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:13,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:32:13,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:32:13,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:13,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1048077159, now seen corresponding path program 2 times [2023-11-06 22:32:13,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:13,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368855042] [2023-11-06 22:32:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:32:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368855042] [2023-11-06 22:32:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368855042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:13,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774564701] [2023-11-06 22:32:13,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:32:13,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:32:13,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:13,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:32:13,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:32:14,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:32:14,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:32:14,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 22:32:14,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:14,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:32:14,193 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-06 22:32:14,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1425 treesize of output 1401 [2023-11-06 22:32:14,501 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:32:14,654 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:32:14,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-06 22:32:15,232 INFO L322 Elim1Store]: treesize reduction 244, result has 15.3 percent of original size [2023-11-06 22:32:15,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 82 treesize of output 112 [2023-11-06 22:32:15,360 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 22:32:15,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 67 [2023-11-06 22:32:15,374 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:32:15,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-06 22:32:15,406 INFO L322 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-06 22:32:15,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 36 [2023-11-06 22:32:15,679 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:32:15,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 17 [2023-11-06 22:32:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:15,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:32:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774564701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:16,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:32:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 19 [2023-11-06 22:32:16,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73824069] [2023-11-06 22:32:16,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:16,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:32:16,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:16,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:32:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:32:16,230 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:18,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:20,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:22,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:24,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:26,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:28,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:29,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:31,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:33,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:35,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:32:37,051 INFO L93 Difference]: Finished difference Result 389 states and 454 transitions. [2023-11-06 22:32:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:32:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2023-11-06 22:32:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:32:37,053 INFO L225 Difference]: With dead ends: 389 [2023-11-06 22:32:37,053 INFO L226 Difference]: Without dead ends: 255 [2023-11-06 22:32:37,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:32:37,055 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 133 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 20 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 3481 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:32:37,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 3481 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 762 Invalid, 13 Unknown, 0 Unchecked, 20.3s Time] [2023-11-06 22:32:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-11-06 22:32:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 149. [2023-11-06 22:32:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 138 states have internal predecessors, (158), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:32:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2023-11-06 22:32:37,067 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 33 [2023-11-06 22:32:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:32:37,068 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2023-11-06 22:32:37,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.263157894736842) internal successors, (62), 17 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2023-11-06 22:32:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:32:37,069 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:32:37,069 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-11-06 22:32:37,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:37,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:32:37,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:32:37,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:37,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1402439843, now seen corresponding path program 3 times [2023-11-06 22:32:37,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:37,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414836446] [2023-11-06 22:32:37,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:37,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:32:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414836446] [2023-11-06 22:32:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414836446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705133685] [2023-11-06 22:32:37,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:32:37,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:32:37,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:37,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:32:37,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:32:39,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:32:39,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:32:39,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:32:39,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:39,965 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:32:39,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 30 [2023-11-06 22:32:40,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:32:40,147 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:32:41,986 INFO L322 Elim1Store]: treesize reduction 1061, result has 12.0 percent of original size [2023-11-06 22:32:41,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 204 treesize of output 336 [2023-11-06 22:32:42,832 INFO L322 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-11-06 22:32:42,832 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 156 [2023-11-06 22:32:42,889 INFO L322 Elim1Store]: treesize reduction 13, result has 61.8 percent of original size [2023-11-06 22:32:42,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 60 [2023-11-06 22:32:42,913 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:32:42,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-06 22:32:42,949 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-06 22:32:42,977 INFO L322 Elim1Store]: treesize reduction 30, result has 3.2 percent of original size [2023-11-06 22:32:42,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 23 [2023-11-06 22:32:43,040 INFO L322 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2023-11-06 22:32:43,041 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 52 [2023-11-06 22:32:43,105 INFO L322 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2023-11-06 22:32:43,106 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 50 treesize of output 36 [2023-11-06 22:32:43,671 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:32:43,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 20 [2023-11-06 22:32:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:43,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:32:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705133685] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:32:48,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:32:48,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14] total 22 [2023-11-06 22:32:48,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613235242] [2023-11-06 22:32:48,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:32:48,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 22:32:48,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:48,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 22:32:48,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=709, Unknown=1, NotChecked=0, Total=812 [2023-11-06 22:32:48,280 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:32:50,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:52,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:54,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:56,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:32:58,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:00,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:02,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:04,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:06,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:08,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:33:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:33:12,580 INFO L93 Difference]: Finished difference Result 392 states and 457 transitions. [2023-11-06 22:33:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:33:12,581 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2023-11-06 22:33:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:33:12,584 INFO L225 Difference]: With dead ends: 392 [2023-11-06 22:33:12,584 INFO L226 Difference]: Without dead ends: 257 [2023-11-06 22:33:12,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=166, Invalid=1239, Unknown=1, NotChecked=0, Total=1406 [2023-11-06 22:33:12,588 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 120 mSDsluCounter, 2612 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 15 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:33:12,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 2869 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 610 Invalid, 15 Unknown, 0 Unchecked, 23.0s Time] [2023-11-06 22:33:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-06 22:33:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 150. [2023-11-06 22:33:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 104 states have (on average 1.5288461538461537) internal successors, (159), 139 states have internal predecessors, (159), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-06 22:33:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2023-11-06 22:33:12,607 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 34 [2023-11-06 22:33:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:33:12,608 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2023-11-06 22:33:12,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 20 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-06 22:33:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2023-11-06 22:33:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-06 22:33:12,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:33:12,613 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:33:12,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:33:12,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:12,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-06 22:33:12,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:33:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -497218841, now seen corresponding path program 4 times [2023-11-06 22:33:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:33:12,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038913386] [2023-11-06 22:33:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:33:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:33:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:13,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-06 22:33:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:33:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:33:13,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:33:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038913386] [2023-11-06 22:33:13,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038913386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:33:13,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654795656] [2023-11-06 22:33:13,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:33:13,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:33:13,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:33:13,321 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:33:13,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb0e9210-b7e6-4a0c-a9d8-e400fb6cb370/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:33:13,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:33:13,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:33:13,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:33:13,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:33:13,711 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:33:13,711 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 30 [2023-11-06 22:33:13,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:33:13,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-06 22:33:17,353 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_~#smp_def_rrlen_arr~0.offset| 0) (= 12 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse0 (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|)) (.cse2 (select |c_#memory_int| |c_#Ultimate.C_memset_#ptr.base|))) (or (exists ((|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int) (|v_#Ultimate.C_memset_#t~loopctr203_39| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr203_39| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse1 (select .cse2 .cse1))) .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))))) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_41|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_39| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_38|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_39| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_41|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse5 (select .cse2 .cse5))) .cse6 (select .cse2 .cse6)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_41|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse9 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse7 (select .cse2 .cse7))) .cse8 (select .cse2 .cse8))) .cse9 (select .cse2 .cse9)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_41|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_41| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| 0) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse11 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse10 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse10 (select .cse2 .cse10))) .cse11 (select .cse2 .cse11)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse12 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse12 (select .cse2 .cse12)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| 0))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_39| Int)) (let ((.cse13 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1))) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_39| .cse13) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| .cse13) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_41|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_39| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse16 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse15 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse14 (+ |v_#Ultimate.C_memset_#t~loopctr203_39| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse14 (select .cse2 .cse14))) .cse15 (select .cse2 .cse15))) .cse16 (select .cse2 .cse16)))) |c_#memory_int|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int) (|v_#Ultimate.C_memset_#t~loopctr203_39| Int)) (and (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse19 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse18 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse17 (+ |v_#Ultimate.C_memset_#t~loopctr203_39| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse17 (select .cse2 .cse17))) .cse18 (select .cse2 .cse18))) .cse19 (select .cse2 .cse19)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_38|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_39| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_39| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_40| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse21 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse20 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse20 (select .cse2 .cse20))) .cse21 (select .cse2 .cse21)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_39| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_39| (+ |v_#Ultimate.C_memset_#t~loopctr203_41| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_41|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_39| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| 0) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse23 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse22 (+ |v_#Ultimate.C_memset_#t~loopctr203_39| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse22 (select .cse2 .cse22))) .cse23 (select .cse2 .cse23)))) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_41| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse26 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse25 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse24 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse24 (select .cse2 .cse24))) .cse25 (select .cse2 .cse25))) .cse26 (select .cse2 .cse26)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_41|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int) (|v_#Ultimate.C_memset_#t~loopctr203_38| Int) (|v_#Ultimate.C_memset_#t~loopctr203_39| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse30 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse29 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse28 (+ |v_#Ultimate.C_memset_#t~loopctr203_39| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse27 (+ |v_#Ultimate.C_memset_#t~loopctr203_38| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse27 (select .cse2 .cse27))) .cse28 (select .cse2 .cse28))) .cse29 (select .cse2 .cse29))) .cse30 (select .cse2 .cse30)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_41|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_39| |v_#Ultimate.C_memset_#t~loopctr203_38|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_39| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_39| (+ |v_#Ultimate.C_memset_#t~loopctr203_38| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_38| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_38| |v_#Ultimate.C_memset_#t~loopctr203_41|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_40| Int) (|v_#Ultimate.C_memset_#t~loopctr203_41| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_40| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_41| (+ |v_#Ultimate.C_memset_#t~loopctr203_40| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_40| (+ |v_#Ultimate.C_memset_#t~loopctr203_41| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse32 (+ |v_#Ultimate.C_memset_#t~loopctr203_41| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse31 (+ |v_#Ultimate.C_memset_#t~loopctr203_40| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse31 (select .cse2 .cse31))) .cse32 (select .cse2 .cse32)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_41| |v_#Ultimate.C_memset_#t~loopctr203_40|))))))) is different from false [2023-11-06 22:33:26,716 WARN L293 SmtUtils]: Spent 7.93s on a formula simplification. DAG size of input: 855 DAG size of output: 209 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 22:33:26,717 INFO L322 Elim1Store]: treesize reduction 4351, result has 10.7 percent of original size [2023-11-06 22:33:26,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 15 new quantified variables, introduced 54 case distinctions, treesize of input 721 treesize of output 1549