./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2cc22fce Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/circular_buffer_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-2cc22fc-m [2024-07-22 22:36:57,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-22 22:36:57,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-22 22:36:57,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-22 22:36:57,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-22 22:36:57,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-22 22:36:57,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-22 22:36:57,383 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-22 22:36:57,384 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-22 22:36:57,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-22 22:36:57,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-22 22:36:57,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-22 22:36:57,391 INFO L153 SettingsManager]: * Use SBE=true [2024-07-22 22:36:57,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-22 22:36:57,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-22 22:36:57,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-22 22:36:57,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-22 22:36:57,393 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-22 22:36:57,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-22 22:36:57,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-22 22:36:57,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-22 22:36:57,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-22 22:36:57,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-22 22:36:57,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-22 22:36:57,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-22 22:36:57,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-22 22:36:57,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-22 22:36:57,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-22 22:36:57,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-22 22:36:57,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-22 22:36:57,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 22:36:57,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-22 22:36:57,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-22 22:36:57,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-22 22:36:57,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-22 22:36:57,398 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-22 22:36:57,399 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-22 22:36:57,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-07-22 22:36:57,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-22 22:36:57,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-22 22:36:57,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-22 22:36:57,665 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-22 22:36:57,666 INFO L274 PluginConnector]: CDTParser initialized [2024-07-22 22:36:57,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-07-22 22:36:58,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-22 22:36:59,042 INFO L384 CDTParser]: Found 1 translation units. [2024-07-22 22:36:59,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-07-22 22:36:59,067 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c8928877/b5314e2b255f4f8d9aaca85505ccf205/FLAGfeb3b9915 [2024-07-22 22:36:59,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1c8928877/b5314e2b255f4f8d9aaca85505ccf205 [2024-07-22 22:36:59,090 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-07-22 22:36:59,091 INFO L274 PluginConnector]: Witness Parser initialized [2024-07-22 22:36:59,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/circular_buffer_ok.yml/witness.yml [2024-07-22 22:36:59,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-22 22:36:59,255 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-07-22 22:36:59,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-22 22:36:59,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-22 22:36:59,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-22 22:36:59,276 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:36:59" (1/2) ... [2024-07-22 22:36:59,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a9bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:36:59, skipping insertion in model container [2024-07-22 22:36:59,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:36:59" (1/2) ... [2024-07-22 22:36:59,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4021fac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:36:59, skipping insertion in model container [2024-07-22 22:36:59,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 10:36:59" (2/2) ... [2024-07-22 22:36:59,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a9bcd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59, skipping insertion in model container [2024-07-22 22:36:59,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 10:36:59" (2/2) ... [2024-07-22 22:36:59,280 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-07-22 22:36:59,319 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-07-22 22:36:59,320 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] (! multithreaded || (0 <= value && value <= 6)) && (! multithreaded || (m_locked || (0 <= value && value <= 7))) [2024-07-22 22:36:59,336 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] (! multithreaded || (0 <= value && value <= 6)) && (! multithreaded || (m_locked || (0 <= value && value <= 7))) [2024-07-22 22:36:59,336 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-07-22 22:36:59,336 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-07-22 22:36:59,337 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-07-22 22:36:59,337 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-07-22 22:36:59,337 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-07-22 22:36:59,337 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-07-22 22:36:59,337 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-07-22 22:36:59,389 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-22 22:36:59,753 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 22:36:59,771 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-07-22 22:36:59,892 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-22 22:36:59,928 INFO L206 MainTranslator]: Completed translation [2024-07-22 22:36:59,930 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59 WrapperNode [2024-07-22 22:36:59,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-22 22:36:59,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-22 22:36:59,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-22 22:36:59,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-22 22:36:59,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:36:59,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:36:59,995 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-07-22 22:36:59,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-22 22:36:59,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-22 22:36:59,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-22 22:36:59,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-22 22:37:00,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,026 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-22 22:37:00,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-22 22:37:00,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-22 22:37:00,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-22 22:37:00,052 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (1/1) ... [2024-07-22 22:37:00,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-22 22:37:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:37:00,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-07-22 22:37:00,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-07-22 22:37:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-07-22 22:37:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-07-22 22:37:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-07-22 22:37:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-07-22 22:37:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-07-22 22:37:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-07-22 22:37:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-07-22 22:37:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-22 22:37:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-07-22 22:37:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-22 22:37:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-07-22 22:37:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-22 22:37:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-22 22:37:00,117 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-22 22:37:00,256 INFO L244 CfgBuilder]: Building ICFG [2024-07-22 22:37:00,259 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-22 22:37:00,490 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-22 22:37:00,490 INFO L293 CfgBuilder]: Performing block encoding [2024-07-22 22:37:00,707 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-22 22:37:00,708 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-07-22 22:37:00,708 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:37:00 BoogieIcfgContainer [2024-07-22 22:37:00,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-22 22:37:00,710 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-22 22:37:00,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-22 22:37:00,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-22 22:37:00,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:36:59" (1/4) ... [2024-07-22 22:37:00,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d62b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:37:00, skipping insertion in model container [2024-07-22 22:37:00,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 22.07 10:36:59" (2/4) ... [2024-07-22 22:37:00,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d62b68 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.07 10:37:00, skipping insertion in model container [2024-07-22 22:37:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 22.07 10:36:59" (3/4) ... [2024-07-22 22:37:00,714 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d62b68 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 22.07 10:37:00, skipping insertion in model container [2024-07-22 22:37:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:37:00" (4/4) ... [2024-07-22 22:37:00,715 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-07-22 22:37:00,729 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-22 22:37:00,729 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-07-22 22:37:00,729 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-22 22:37:00,799 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-07-22 22:37:00,909 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 22:37:00,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-22 22:37:00,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:37:00,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-07-22 22:37:00,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-07-22 22:37:00,944 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-22 22:37:00,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-22 22:37:00,962 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=false, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@18bf93b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-22 22:37:00,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-07-22 22:37:01,058 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:37:01,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:37:01,062 INFO L85 PathProgramCache]: Analyzing trace with hash -289999504, now seen corresponding path program 1 times [2024-07-22 22:37:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:37:01,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404502061] [2024-07-22 22:37:01,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:37:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 22:37:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:37:01,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404502061] [2024-07-22 22:37:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404502061] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 22:37:01,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 22:37:01,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-07-22 22:37:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238350996] [2024-07-22 22:37:01,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 22:37:01,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-07-22 22:37:01,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:37:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-07-22 22:37:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-07-22 22:37:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:01,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:37:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2024-07-22 22:37:01,379 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:01,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-22 22:37:01,518 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:37:01,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:37:01,519 INFO L85 PathProgramCache]: Analyzing trace with hash 781068561, now seen corresponding path program 1 times [2024-07-22 22:37:01,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:37:01,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59340020] [2024-07-22 22:37:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:37:01,538 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:37:01,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1896759645] [2024-07-22 22:37:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:37:01,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:37:01,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:37:01,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-07-22 22:37:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 22:37:01,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2024-07-22 22:37:01,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:37:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:01,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-22 22:37:01,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:37:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59340020] [2024-07-22 22:37:01,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:37:01,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896759645] [2024-07-22 22:37:01,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896759645] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 22:37:01,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 22:37:01,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-07-22 22:37:01,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113243098] [2024-07-22 22:37:01,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 22:37:01,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-07-22 22:37:01,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:37:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-07-22 22:37:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-07-22 22:37:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:01,964 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:37:01,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-07-22 22:37:01,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:01,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:02,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:37:02,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-07-22 22:37:02,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-07-22 22:37:02,346 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:37:02,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:37:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1217110952, now seen corresponding path program 1 times [2024-07-22 22:37:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:37:02,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244579581] [2024-07-22 22:37:02,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:02,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:37:02,372 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:37:02,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [498070704] [2024-07-22 22:37:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:02,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:37:02,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:37:02,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:37:02,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-07-22 22:37:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 22:37:02,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2024-07-22 22:37:02,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:37:02,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:02,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:02,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:02,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 22:37:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:04,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:37:04,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244579581] [2024-07-22 22:37:04,029 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:37:04,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498070704] [2024-07-22 22:37:04,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498070704] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 22:37:04,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-07-22 22:37:04,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-07-22 22:37:04,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893237485] [2024-07-22 22:37:04,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-07-22 22:37:04,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-22 22:37:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:37:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-22 22:37:04,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-07-22 22:37:04,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:04,039 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:37:04,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 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) [2024-07-22 22:37:04,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:04,039 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:37:04,040 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:04,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:37:04,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:37:04,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-07-22 22:37:04,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:37:04,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:37:04,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:37:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -987812698, now seen corresponding path program 2 times [2024-07-22 22:37:04,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:37:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972688273] [2024-07-22 22:37:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:37:04,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:37:04,572 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:37:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1780775538] [2024-07-22 22:37:04,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-22 22:37:04,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:37:04,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:37:04,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:37:04,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-07-22 22:37:04,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-07-22 22:37:04,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 22:37:04,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 23 conjunts are in the unsatisfiable core [2024-07-22 22:37:04,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:37:04,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:04,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:05,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:05,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:05,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:37:05,951 INFO L378 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 11 treesize of output 3 [2024-07-22 22:37:05,955 INFO L378 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 12 treesize of output 3 [2024-07-22 22:37:08,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:08,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:37:09,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:37:09,045 INFO L378 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 11 treesize of output 3 [2024-07-22 22:37:09,054 INFO L378 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 12 treesize of output 3 [2024-07-22 22:37:14,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 [2024-07-22 22:37:14,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 12 treesize of output 3 [2024-07-22 22:37:14,127 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:14,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 22:37:16,118 INFO L378 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 11 treesize of output 4 [2024-07-22 22:37:16,125 INFO L378 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 10 treesize of output 4 [2024-07-22 22:37:20,353 INFO L378 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 10 treesize of output 4 [2024-07-22 22:37:20,363 INFO L378 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 11 treesize of output 4 [2024-07-22 22:37:33,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-07-22 22:37:34,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 4 [2024-07-22 22:37:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:37:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:37:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972688273] [2024-07-22 22:37:35,864 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:37:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780775538] [2024-07-22 22:37:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780775538] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 22:37:35,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-07-22 22:37:35,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2024-07-22 22:37:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445696268] [2024-07-22 22:37:35,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-07-22 22:37:35,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-07-22 22:37:35,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:37:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-07-22 22:37:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2024-07-22 22:37:35,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:35,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:37:35,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8666666666666667) internal successors, (86), 30 states have internal predecessors, (86), 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) [2024-07-22 22:37:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:37:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:37:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:37:35,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:37:54,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:37:57,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=true, quantifiers [0] [2024-07-22 22:37:59,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:38:02,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:38:04,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:38:18,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-07-22 22:38:24,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-07-22 22:38:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:38:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:38:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:38:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-07-22 22:38:31,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-07-22 22:38:31,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:38:31,661 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:38:31,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:38:31,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1710642463, now seen corresponding path program 3 times [2024-07-22 22:38:31,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:38:31,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712638058] [2024-07-22 22:38:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:38:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:38:31,718 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:38:31,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [290099872] [2024-07-22 22:38:31,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-07-22 22:38:31,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:38:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:38:31,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:38:31,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-07-22 22:38:31,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-07-22 22:38:31,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 22:38:31,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjunts are in the unsatisfiable core [2024-07-22 22:38:31,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:38:31,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-07-22 22:38:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 389 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-07-22 22:38:31,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-22 22:38:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:38:31,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712638058] [2024-07-22 22:38:31,990 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:38:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290099872] [2024-07-22 22:38:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290099872] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 22:38:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 22:38:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-07-22 22:38:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788824611] [2024-07-22 22:38:31,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 22:38:31,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-07-22 22:38:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:38:31,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-07-22 22:38:31,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-07-22 22:38:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:38:31,997 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:38:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-07-22 22:38:31,997 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:38:31,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:38:31,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:38:31,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-07-22 22:38:31,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:38:34,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:38:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:38:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:38:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:38:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:38:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:38:34,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-07-22 22:38:34,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:38:34,816 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:38:34,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:38:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1847333647, now seen corresponding path program 4 times [2024-07-22 22:38:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:38:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656343966] [2024-07-22 22:38:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:38:34,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:38:34,850 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:38:34,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961801080] [2024-07-22 22:38:34,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-07-22 22:38:34,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:38:34,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:38:34,852 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:38:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-07-22 22:38:35,037 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-07-22 22:38:35,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 22:38:35,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 34 conjunts are in the unsatisfiable core [2024-07-22 22:38:35,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:38:35,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:35,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:35,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:36,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:36,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:38:36,557 INFO L378 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 11 treesize of output 3 [2024-07-22 22:38:36,563 INFO L378 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 12 treesize of output 3 [2024-07-22 22:38:36,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:39,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:40,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:40,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:38:40,248 INFO L378 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 11 treesize of output 3 [2024-07-22 22:38:40,256 INFO L378 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 12 treesize of output 3 [2024-07-22 22:38:46,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:38:47,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:38:47,309 INFO L378 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 12 treesize of output 3 [2024-07-22 22:38:47,316 INFO L378 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 11 treesize of output 3 [2024-07-22 22:38:47,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:39:02,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:39:02,513 INFO L378 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 11 treesize of output 3 [2024-07-22 22:39:02,533 INFO L378 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 12 treesize of output 3 [2024-07-22 22:39:02,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:39:02,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:39:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-07-22 22:39:29,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 22:39:31,423 INFO L378 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 10 treesize of output 4 [2024-07-22 22:39:31,431 INFO L378 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 11 treesize of output 4 [2024-07-22 22:39:39,433 INFO L378 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 10 treesize of output 4 [2024-07-22 22:39:39,445 INFO L378 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 11 treesize of output 4 [2024-07-22 22:39:54,736 INFO L378 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 11 treesize of output 4 [2024-07-22 22:39:54,996 INFO L378 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 10 treesize of output 4 [2024-07-22 22:40:30,502 INFO L378 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 11 treesize of output 4 [2024-07-22 22:40:30,686 INFO L378 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 10 treesize of output 4 [2024-07-22 22:40:50,291 WARN L293 SmtUtils]: Spent 11.25s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:41:32,515 WARN L293 SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 157 DAG size of output: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:41:56,578 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:42:00,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-07-22 22:42:00,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-07-22 22:42:00,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-07-22 22:42:01,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-07-22 22:42:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 1 proven. 131 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-22 22:42:43,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:42:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656343966] [2024-07-22 22:42:43,274 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:42:43,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961801080] [2024-07-22 22:42:43,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961801080] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 22:42:43,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-07-22 22:42:43,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 39 [2024-07-22 22:42:43,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939649412] [2024-07-22 22:42:43,274 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-07-22 22:42:43,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-07-22 22:42:43,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:42:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-07-22 22:42:43,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1274, Unknown=3, NotChecked=0, Total=1640 [2024-07-22 22:42:43,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:42:43,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:42:43,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 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) [2024-07-22 22:42:43,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:42:43,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:42:43,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:42:43,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:42:43,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:42:43,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:43:03,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:43:28,276 WARN L293 SmtUtils]: Spent 15.43s on a formula simplification. DAG size of input: 185 DAG size of output: 134 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:44:01,679 WARN L293 SmtUtils]: Spent 31.07s on a formula simplification. DAG size of input: 265 DAG size of output: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:44:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:44:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:44:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:44:02,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:44:02,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-07-22 22:44:03,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:44:03,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:44:03,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:44:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash 51601549, now seen corresponding path program 5 times [2024-07-22 22:44:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:44:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547160478] [2024-07-22 22:44:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:44:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:44:03,128 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:44:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78217558] [2024-07-22 22:44:03,128 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-07-22 22:44:03,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:44:03,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:44:03,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:44:03,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-07-22 22:44:54,470 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-07-22 22:44:54,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 22:44:54,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 10 conjunts are in the unsatisfiable core [2024-07-22 22:44:54,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:44:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-07-22 22:44:54,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-22 22:44:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:44:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547160478] [2024-07-22 22:44:54,680 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:44:54,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78217558] [2024-07-22 22:44:54,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78217558] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 22:44:54,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 22:44:54,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-07-22 22:44:54,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804691453] [2024-07-22 22:44:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 22:44:54,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-07-22 22:44:54,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:44:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-07-22 22:44:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-07-22 22:44:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:44:54,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:44:54,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 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) [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:44:54,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:44:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:44:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:44:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:44:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:44:55,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:44:55,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-07-22 22:44:55,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-07-22 22:44:55,625 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:44:55,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:44:55,625 INFO L85 PathProgramCache]: Analyzing trace with hash 442959368, now seen corresponding path program 1 times [2024-07-22 22:44:55,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:44:55,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200178663] [2024-07-22 22:44:55,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:44:55,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:44:55,672 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:44:55,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [442361428] [2024-07-22 22:44:55,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:44:55,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:44:55,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:44:55,684 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:44:55,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-07-22 22:44:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 22:44:55,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 9 conjunts are in the unsatisfiable core [2024-07-22 22:44:55,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:44:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-07-22 22:44:56,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-07-22 22:44:56,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:44:56,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200178663] [2024-07-22 22:44:56,061 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:44:56,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442361428] [2024-07-22 22:44:56,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442361428] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-22 22:44:56,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-22 22:44:56,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-07-22 22:44:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080354417] [2024-07-22 22:44:56,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-22 22:44:56,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-07-22 22:44:56,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:44:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-07-22 22:44:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-07-22 22:44:56,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:44:56,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:44:56,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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) [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:44:56,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:44:59,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:45:02,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:45:05,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:45:07,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:45:21,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-07-22 22:45:30,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-07-22 22:45:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:45:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:45:47,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:45:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-07-22 22:45:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:45:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:45:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:45:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:45:47,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-07-22 22:45:47,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:45:47,883 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:45:47,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:45:47,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1541568185, now seen corresponding path program 6 times [2024-07-22 22:45:47,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:45:47,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379471658] [2024-07-22 22:45:47,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:45:47,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:45:47,905 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:45:47,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392424494] [2024-07-22 22:45:47,906 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-07-22 22:45:47,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:45:47,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:45:47,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:45:47,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-07-22 22:45:49,080 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-07-22 22:45:49,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-22 22:45:49,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 29 conjunts are in the unsatisfiable core [2024-07-22 22:45:49,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:45:49,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:49,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:49,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:50,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:50,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:50,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:45:50,361 INFO L378 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 12 treesize of output 3 [2024-07-22 22:45:50,368 INFO L378 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 11 treesize of output 3 [2024-07-22 22:45:53,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:53,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:45:53,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:45:53,918 INFO L378 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 12 treesize of output 3 [2024-07-22 22:45:53,925 INFO L378 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 11 treesize of output 3 [2024-07-22 22:45:59,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:46:00,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:46:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:46:00,267 INFO L378 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 12 treesize of output 3 [2024-07-22 22:46:00,276 INFO L378 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 11 treesize of output 3 [2024-07-22 22:46:18,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:46:18,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:46:19,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 40 [2024-07-22 22:46:19,904 INFO L378 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 11 treesize of output 3 [2024-07-22 22:46:19,913 INFO L378 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 12 treesize of output 3 [2024-07-22 22:46:46,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 3 [2024-07-22 22:46:46,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 3 [2024-07-22 22:46:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 22 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:46:47,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 22:46:49,711 INFO L378 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 11 treesize of output 4 [2024-07-22 22:46:49,747 INFO L378 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 10 treesize of output 4 [2024-07-22 22:46:53,541 INFO L378 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 10 treesize of output 4 [2024-07-22 22:46:53,557 INFO L378 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 11 treesize of output 4 [2024-07-22 22:47:00,131 INFO L378 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 11 treesize of output 4 [2024-07-22 22:47:00,159 INFO L378 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 10 treesize of output 4 [2024-07-22 22:47:16,122 INFO L378 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 11 treesize of output 4 [2024-07-22 22:47:16,145 INFO L378 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 10 treesize of output 4 [2024-07-22 22:48:03,240 INFO L378 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 10 treesize of output 4 [2024-07-22 22:48:03,293 INFO L378 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 11 treesize of output 4 [2024-07-22 22:48:18,997 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 158 DAG size of output: 157 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:48:37,165 WARN L293 SmtUtils]: Spent 5.36s on a formula simplification. DAG size of input: 155 DAG size of output: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:48:52,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-07-22 22:48:52,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 4 [2024-07-22 22:48:52,627 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-07-22 22:48:52,645 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-07-22 22:48:52,650 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-07-22 22:49:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 74 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:49:48,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:49:48,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379471658] [2024-07-22 22:49:48,713 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:49:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392424494] [2024-07-22 22:49:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392424494] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 22:49:48,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-07-22 22:49:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2024-07-22 22:49:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501771860] [2024-07-22 22:49:48,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-07-22 22:49:48,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-07-22 22:49:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:49:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-07-22 22:49:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=1503, Unknown=1, NotChecked=0, Total=2070 [2024-07-22 22:49:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:49:48,725 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:49:48,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 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) [2024-07-22 22:49:48,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:49:48,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:49:48,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:49:48,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-07-22 22:49:48,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:49:48,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-07-22 22:49:48,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:49:48,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:49:48,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:50:26,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-07-22 22:50:26,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse32 (mod c_~next~0 4294967296)) (.cse29 (mod c_~buffer_size~0 4294967296)) (.cse44 (+ .cse45 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse26 (mod (+ c_~next~0 1) 4294967296)) (.cse39 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse29 .cse44)) (.cse33 (< .cse32 1)) (.cse36 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse19 (and (or (and (<= 1 .cse32) (<= .cse44 .cse29)) .cse39) (or .cse18 .cse33 (and (or (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))))) (< .cse45 2147483648)) (or (< 2147483647 .cse45) (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45))))))))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse31 (mod .cse26 .cse29)) (.cse22 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse6)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse7 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (and (or .cse6 .cse22) (or .cse2 .cse23 .cse3))) (.cse16 (< .cse31 1)) (.cse21 (or .cse19 .cse11 .cse12 .cse13 .cse22)) (.cse10 (and (or .cse33 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse35 (* v_y_362 4294967296))) (let ((.cse34 (+ v_z_362 .cse35 (* v_y_361 4294967296)))) (or (< .cse29 v_z_362) (< .cse34 0) (< .cse29 (+ v_z_362 .cse35 4)) (< 4294967295 .cse34) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse35) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse38 (* v_y_362 4294967296))) (let ((.cse37 (+ v_z_362 .cse38 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse37 0) (< .cse29 (+ v_z_362 .cse38 4)) (< 4294967295 .cse37) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse38) 0) (= v_z_362 0))))))) (or .cse39 (< 0 .cse32)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse29 v_z_363) (< .cse29 (+ v_z_363 4 .cse40)) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse40) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse43 (* v_y_361 4294967296)) (.cse42 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse42 1 .cse43)) (< (+ v_z_363 .cse42 .cse43) 0) (< .cse29 (+ v_z_363 4 .cse42)) (< (+ v_z_363 .cse42) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse33))) (.cse1 (not .cse12)) (.cse5 (< .cse29 (+ .cse32 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse8 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse30 (mod (+ (* v_y_350 (- 4294967296)) .cse31 (* v_y_354 (- 4294967296)) 1) .cse29))) (let ((.cse25 (mod (mod (+ .cse30 1) 4294967296) .cse29)) (.cse27 (* v_y_354 4294967296)) (.cse28 (* v_y_350 4294967296))) (or (< .cse25 1) (< .cse26 (+ .cse27 .cse28)) (< (mod (mod (+ .cse25 1) 4294967296) .cse29) 1) (< (+ .cse27 4294967295 .cse28) .cse26) (< (+ .cse28 .cse29) (+ .cse26 1)) (< .cse26 .cse28) (< .cse30 1)))))) (.cse9 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9))) (or .cse0 (and (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse5 .cse9) (not (= .cse14 0))) .cse6 .cse15 (< 0 .cse14))) (or .cse2 .cse3)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (<= (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse2) .cse7) (or .cse1 .cse2 .cse4))) (or .cse0 .cse3) (or (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse16 .cse17 .cse5 .cse18 .cse6 .cse9) (or (and (or .cse17 .cse19 .cse11 .cse12 .cse13) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse20) .cse21)) (= |c_#ghost~multithreaded| 1) (= c_~receive~0 0) (= c_~send~0 1) (or .cse0 .cse20) (or .cse0 (and (or .cse16 .cse5 .cse18 .cse6 .cse15 .cse22 .cse9) (or .cse2 (and (or .cse1 .cse23 .cse3) .cse21)))) (or (let ((.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse10 .cse11 .cse12 .cse5 .cse24 .cse15 .cse13 .cse8 .cse9) (or .cse1 (and (or .cse5 .cse24 .cse6 .cse15 .cse8 .cse9) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:50:27,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse32 (mod c_~next~0 4294967296)) (.cse29 (mod c_~buffer_size~0 4294967296)) (.cse44 (+ .cse45 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse26 (mod (+ c_~next~0 1) 4294967296)) (.cse39 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse29 .cse44)) (.cse33 (< .cse32 1)) (.cse36 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse19 (and (or (and (<= 1 .cse32) (<= .cse44 .cse29)) .cse39) (or .cse18 .cse33 (and (or (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))))) (< .cse45 2147483648)) (or (< 2147483647 .cse45) (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45))))))))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse31 (mod .cse26 .cse29)) (.cse22 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse6)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse7 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (and (or .cse6 .cse22) (or .cse2 .cse23 .cse3))) (.cse16 (< .cse31 1)) (.cse21 (or .cse19 .cse11 .cse12 .cse13 .cse22)) (.cse10 (and (or .cse33 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse35 (* v_y_362 4294967296))) (let ((.cse34 (+ v_z_362 .cse35 (* v_y_361 4294967296)))) (or (< .cse29 v_z_362) (< .cse34 0) (< .cse29 (+ v_z_362 .cse35 4)) (< 4294967295 .cse34) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse35) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse38 (* v_y_362 4294967296))) (let ((.cse37 (+ v_z_362 .cse38 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse37 0) (< .cse29 (+ v_z_362 .cse38 4)) (< 4294967295 .cse37) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse38) 0) (= v_z_362 0))))))) (or .cse39 (< 0 .cse32)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse29 v_z_363) (< .cse29 (+ v_z_363 4 .cse40)) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse40) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse43 (* v_y_361 4294967296)) (.cse42 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse42 1 .cse43)) (< (+ v_z_363 .cse42 .cse43) 0) (< .cse29 (+ v_z_363 4 .cse42)) (< (+ v_z_363 .cse42) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse33))) (.cse1 (not .cse12)) (.cse5 (< .cse29 (+ .cse32 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse8 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse30 (mod (+ (* v_y_350 (- 4294967296)) .cse31 (* v_y_354 (- 4294967296)) 1) .cse29))) (let ((.cse25 (mod (mod (+ .cse30 1) 4294967296) .cse29)) (.cse27 (* v_y_354 4294967296)) (.cse28 (* v_y_350 4294967296))) (or (< .cse25 1) (< .cse26 (+ .cse27 .cse28)) (< (mod (mod (+ .cse25 1) 4294967296) .cse29) 1) (< (+ .cse27 4294967295 .cse28) .cse26) (< (+ .cse28 .cse29) (+ .cse26 1)) (< .cse26 .cse28) (< .cse30 1)))))) (.cse9 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9))) (or .cse0 (and (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse5 .cse9) (not (= .cse14 0))) .cse6 .cse15 (< 0 .cse14))) (or .cse2 .cse3)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (<= (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse2) .cse7) (or .cse1 .cse2 .cse4))) (or (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse16 .cse17 .cse5 .cse18 .cse6 .cse9) (or (and (or .cse17 .cse19 .cse11 .cse12 .cse13) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse20) .cse21)) (or .cse0 .cse20) (or .cse0 (and (or .cse16 .cse5 .cse18 .cse6 .cse15 .cse22 .cse9) (or .cse2 (and (or .cse1 .cse23 .cse3) .cse21)))) (or (let ((.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse10 .cse11 .cse12 .cse5 .cse24 .cse15 .cse13 .cse8 .cse9) (or .cse1 (and (or .cse5 .cse24 .cse6 .cse15 .cse8 .cse9) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:50:27,652 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod (+ c_~next~0 1) 4294967296)) (.cse4 (= (mod c_~send~0 256) 0)) (.cse14 (mod c_~buffer_size~0 4294967296)) (.cse20 (= (mod c_~receive~0 256) 0)) (.cse12 (mod c_~next~0 4294967296))) (let ((.cse15 (not (= (+ c_~value~0 1) 0))) (.cse17 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse16 (< .cse12 1)) (.cse19 (< (+ c_~value~0 2147483648) 0)) (.cse21 (< 2147483647 c_~value~0)) (.cse11 (not .cse20)) (.cse1 (< .cse14 (+ .cse12 1))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (< c_~buffer_size~0 1)) (.cse6 (not .cse4)) (.cse7 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse8 (mod .cse33 .cse14)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (let ((.cse3 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse1 .cse2) (not (= .cse3 0))) .cse4 .cse5 (< 0 .cse3))) (or .cse6 .cse7)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (let ((.cse18 (mod c_~first~0 4294967296))) (let ((.cse13 (+ .cse18 1))) (let ((.cse9 (< .cse14 .cse13)) (.cse10 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or (< .cse8 1) .cse1 .cse9 .cse4 .cse5 .cse10 .cse2) (or .cse6 (and (or .cse11 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7) (or (and (or (and (<= 1 .cse12) (<= .cse13 .cse14)) .cse15) (or .cse9 .cse16 (and (or (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse18 (- 4294967296))))) (< .cse18 2147483648)) (or (< 2147483647 .cse18) (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse18)))))))) .cse19 .cse20 .cse21 .cse10)))))))) (or (let ((.cse30 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6))) (.cse31 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse36 (mod (+ (* v_y_350 (- 4294967296)) .cse8 (* v_y_354 (- 4294967296)) 1) .cse14))) (let ((.cse32 (mod (mod (+ .cse36 1) 4294967296) .cse14)) (.cse34 (* v_y_354 4294967296)) (.cse35 (* v_y_350 4294967296))) (or (< .cse32 1) (< .cse33 (+ .cse34 .cse35)) (< (mod (mod (+ .cse32 1) 4294967296) .cse14) 1) (< (+ .cse34 4294967295 .cse35) .cse33) (< (+ .cse35 .cse14) (+ .cse33 1)) (< .cse33 .cse35) (< .cse36 1))))))) (and (or (and (or .cse16 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse23 (* v_y_362 4294967296))) (let ((.cse22 (+ v_z_362 .cse23 (* v_y_361 4294967296)))) (or (< .cse14 v_z_362) (< .cse22 0) (< .cse14 (+ v_z_362 .cse23 4)) (< 4294967295 .cse22) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse23) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse25 (* v_y_362 4294967296))) (let ((.cse24 (+ v_z_362 .cse25 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse24 0) (< .cse14 (+ v_z_362 .cse25 4)) (< 4294967295 .cse24) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse25) 0) (= v_z_362 0))))))) (or .cse15 (< 0 .cse12)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse27 (* v_y_361 4294967296)) (.cse26 (* v_y_363 4294967296))) (or (< .cse14 (+ v_z_363 .cse26 1 .cse27)) (< (+ v_z_363 .cse26 .cse27) 0) (< .cse14 v_z_363) (< .cse14 (+ v_z_363 4 .cse26)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse26) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse29 (* v_y_361 4294967296)) (.cse28 (* v_y_363 4294967296))) (or (< .cse14 (+ v_z_363 .cse28 1 .cse29)) (< (+ v_z_363 .cse28 .cse29) 0) (< .cse14 (+ v_z_363 4 .cse28)) (< (+ v_z_363 .cse28) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse16)) .cse19 .cse20 .cse1 .cse30 .cse5 .cse21 .cse31 .cse2) (or .cse11 (and (or .cse1 .cse30 .cse4 .cse5 .cse31 .cse2) (or .cse6 .cse7 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0)))) is different from false [2024-07-22 22:50:29,328 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (mod c_~next~0 4294967296)) (.cse26 (mod (+ c_~next~0 1) 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse13 (mod .cse26 .cse18)) (.cse11 (= (mod c_~receive~0 256) 0)) (.cse19 (not (= (+ c_~value~0 1) 0))) (.cse21 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse20 (< .cse16 1))) (let ((.cse9 (and (or .cse20 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse31 (* v_y_362 4294967296))) (let ((.cse30 (+ v_z_362 .cse31 (* v_y_361 4294967296)))) (or (< .cse18 v_z_362) (< .cse30 0) (< .cse18 (+ v_z_362 .cse31 4)) (< 4294967295 .cse30) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse31) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse33 (* v_y_362 4294967296))) (let ((.cse32 (+ v_z_362 .cse33 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse32 0) (< .cse18 (+ v_z_362 .cse33 4)) (< 4294967295 .cse32) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse33) 0) (= v_z_362 0))))))) (or .cse19 (< 0 .cse16)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse35 (* v_y_361 4294967296)) (.cse34 (* v_y_363 4294967296))) (or (< .cse18 (+ v_z_363 .cse34 1 .cse35)) (< (+ v_z_363 .cse34 .cse35) 0) (< .cse18 v_z_363) (< .cse18 (+ v_z_363 4 .cse34)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse34) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse37 (* v_y_361 4294967296)) (.cse36 (* v_y_363 4294967296))) (or (< .cse18 (+ v_z_363 .cse36 1 .cse37)) (< (+ v_z_363 .cse36 .cse37) 0) (< .cse18 (+ v_z_363 4 .cse36)) (< (+ v_z_363 .cse36) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse20))) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse1 (not .cse11)) (.cse4 (< .cse18 (+ .cse16 1))) (.cse7 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse29 (mod (+ (* v_y_350 (- 4294967296)) .cse13 (* v_y_354 (- 4294967296)) 1) .cse18))) (let ((.cse25 (mod (mod (+ .cse29 1) 4294967296) .cse18)) (.cse27 (* v_y_354 4294967296)) (.cse28 (* v_y_350 4294967296))) (or (< .cse25 1) (< .cse26 (+ .cse27 .cse28)) (< (mod (mod (+ .cse25 1) 4294967296) .cse18) 1) (< (+ .cse27 4294967295 .cse28) .cse26) (< (+ .cse28 .cse18) (+ .cse26 1)) (< .cse26 .cse28) (< .cse29 1)))))) (.cse8 (< c_~buffer_size~0 1)) (.cse2 (not .cse5)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (let ((.cse6 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse1 (and (or .cse2 .cse3 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 .cse5 .cse6 .cse7 .cse8))) (or .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse7 .cse8)))) (or (let ((.cse22 (mod c_~first~0 4294967296))) (let ((.cse17 (+ .cse22 1))) (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse15 (< .cse18 .cse17))) (and (or (< .cse13 1) .cse14 .cse4 .cse15 .cse5 .cse8) (or (and (or .cse14 (and (or (and (<= 1 .cse16) (<= .cse17 .cse18)) .cse19) (or .cse15 .cse20 (and (or (not (= c_~value~0 (select .cse21 (+ |c_~#buffer~0.offset| .cse22 (- 4294967296))))) (< .cse22 2147483648)) (or (< 2147483647 .cse22) (not (= c_~value~0 (select .cse21 (+ |c_~#buffer~0.offset| .cse22)))))))) .cse10 .cse11 .cse12) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))))) .cse0) (or (let ((.cse23 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse9 .cse10 .cse11 .cse4 .cse23 .cse24 .cse12 .cse7 .cse8) (or .cse1 (and (or .cse4 .cse23 .cse5 .cse24 .cse7 .cse8) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))) is different from false [2024-07-22 22:50:37,365 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse32 (mod c_~next~0 4294967296)) (.cse29 (mod c_~buffer_size~0 4294967296)) (.cse44 (+ .cse45 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse26 (mod (+ c_~next~0 1) 4294967296)) (.cse39 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse29 .cse44)) (.cse33 (< .cse32 1)) (.cse36 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse19 (and (or (and (<= 1 .cse32) (<= .cse44 .cse29)) .cse39) (or .cse18 .cse33 (and (or (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))))) (< .cse45 2147483648)) (or (< 2147483647 .cse45) (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45))))))))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse31 (mod .cse26 .cse29)) (.cse22 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse6)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse7 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (and (or .cse6 .cse22) (or .cse2 .cse23 .cse3))) (.cse16 (< .cse31 1)) (.cse21 (or .cse19 .cse11 .cse12 .cse13 .cse22)) (.cse10 (and (or .cse33 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse35 (* v_y_362 4294967296))) (let ((.cse34 (+ v_z_362 .cse35 (* v_y_361 4294967296)))) (or (< .cse29 v_z_362) (< .cse34 0) (< .cse29 (+ v_z_362 .cse35 4)) (< 4294967295 .cse34) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse35) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse38 (* v_y_362 4294967296))) (let ((.cse37 (+ v_z_362 .cse38 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse37 0) (< .cse29 (+ v_z_362 .cse38 4)) (< 4294967295 .cse37) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse38) 0) (= v_z_362 0))))))) (or .cse39 (< 0 .cse32)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse29 v_z_363) (< .cse29 (+ v_z_363 4 .cse40)) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse40) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse43 (* v_y_361 4294967296)) (.cse42 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse42 1 .cse43)) (< (+ v_z_363 .cse42 .cse43) 0) (< .cse29 (+ v_z_363 4 .cse42)) (< (+ v_z_363 .cse42) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse33))) (.cse1 (not .cse12)) (.cse5 (< .cse29 (+ .cse32 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse8 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse30 (mod (+ (* v_y_350 (- 4294967296)) .cse31 (* v_y_354 (- 4294967296)) 1) .cse29))) (let ((.cse25 (mod (mod (+ .cse30 1) 4294967296) .cse29)) (.cse27 (* v_y_354 4294967296)) (.cse28 (* v_y_350 4294967296))) (or (< .cse25 1) (< .cse26 (+ .cse27 .cse28)) (< (mod (mod (+ .cse25 1) 4294967296) .cse29) 1) (< (+ .cse27 4294967295 .cse28) .cse26) (< (+ .cse28 .cse29) (+ .cse26 1)) (< .cse26 .cse28) (< .cse30 1)))))) (.cse9 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9))) (or .cse0 (and (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse5 .cse9) (not (= .cse14 0))) .cse6 .cse15 (< 0 .cse14))) (or .cse2 .cse3)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (<= (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse2) .cse7) (or .cse1 .cse2 .cse4))) (or .cse1 .cse2) (or .cse0 .cse3) (or (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse16 .cse17 .cse5 .cse18 .cse6 .cse9) (or (and (or .cse17 .cse19 .cse11 .cse12 .cse13) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse20) .cse21)) (or .cse0 .cse20) (or .cse0 (and (or .cse16 .cse5 .cse18 .cse6 .cse15 .cse22 .cse9) (or .cse2 (and (or .cse1 .cse23 .cse3) .cse21)))) (or (let ((.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse10 .cse11 .cse12 .cse5 .cse24 .cse15 .cse13 .cse8 .cse9) (or .cse1 (and (or .cse5 .cse24 .cse6 .cse15 .cse8 .cse9) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:50:37,411 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse44 (mod c_~first~0 4294967296))) (let ((.cse31 (mod c_~next~0 4294967296)) (.cse28 (mod c_~buffer_size~0 4294967296)) (.cse43 (+ .cse44 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse25 (mod (+ c_~next~0 1) 4294967296)) (.cse38 (not (= (+ c_~value~0 1) 0))) (.cse16 (< .cse28 .cse43)) (.cse32 (< .cse31 1)) (.cse35 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse17 (and (or (and (<= 1 .cse31) (<= .cse43 .cse28)) .cse38) (or .cse16 .cse32 (and (or (not (= c_~value~0 (select .cse35 (+ |c_~#buffer~0.offset| .cse44 (- 4294967296))))) (< .cse44 2147483648)) (or (< 2147483647 .cse44) (not (= c_~value~0 (select .cse35 (+ |c_~#buffer~0.offset| .cse44))))))))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse30 (mod .cse25 .cse28)) (.cse21 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse6)) (.cse22 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse7 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (and (or .cse6 .cse21) (or .cse2 .cse22 .cse3))) (.cse14 (< .cse30 1)) (.cse19 (or .cse17 .cse11 .cse12 .cse13 .cse21)) (.cse10 (and (or .cse32 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse34 (* v_y_362 4294967296))) (let ((.cse33 (+ v_z_362 .cse34 (* v_y_361 4294967296)))) (or (< .cse28 v_z_362) (< .cse33 0) (< .cse28 (+ v_z_362 .cse34 4)) (< 4294967295 .cse33) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse34) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse37 (* v_y_362 4294967296))) (let ((.cse36 (+ v_z_362 .cse37 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse36 0) (< .cse28 (+ v_z_362 .cse37 4)) (< 4294967295 .cse36) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse37) 0) (= v_z_362 0))))))) (or .cse38 (< 0 .cse31)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse40 (* v_y_361 4294967296)) (.cse39 (* v_y_363 4294967296))) (or (< .cse28 (+ v_z_363 .cse39 1 .cse40)) (< (+ v_z_363 .cse39 .cse40) 0) (< .cse28 v_z_363) (< .cse28 (+ v_z_363 4 .cse39)) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse39) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse42 (* v_y_361 4294967296)) (.cse41 (* v_y_363 4294967296))) (or (< .cse28 (+ v_z_363 .cse41 1 .cse42)) (< (+ v_z_363 .cse41 .cse42) 0) (< .cse28 (+ v_z_363 4 .cse41)) (< (+ v_z_363 .cse41) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse32))) (.cse1 (not .cse12)) (.cse5 (< .cse28 (+ .cse31 1))) (.cse20 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse8 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse29 (mod (+ (* v_y_350 (- 4294967296)) .cse30 (* v_y_354 (- 4294967296)) 1) .cse28))) (let ((.cse24 (mod (mod (+ .cse29 1) 4294967296) .cse28)) (.cse26 (* v_y_354 4294967296)) (.cse27 (* v_y_350 4294967296))) (or (< .cse24 1) (< .cse25 (+ .cse26 .cse27)) (< (mod (mod (+ .cse24 1) 4294967296) .cse28) 1) (< (+ .cse26 4294967295 .cse27) .cse25) (< (+ .cse27 .cse28) (+ .cse25 1)) (< .cse25 .cse27) (< .cse29 1)))))) (.cse9 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9))) (or .cse0 (and (or (and (<= (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse2) .cse7) (or .cse1 .cse2 .cse4))) (or .cse1 .cse2) (or .cse0 .cse3) (or (let ((.cse15 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse14 .cse15 .cse5 .cse16 .cse6 .cse9) (or (and (or .cse15 .cse17 .cse11 .cse12 .cse13) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse18) .cse19)) (or .cse0 .cse18) (or .cse0 (and (or .cse14 .cse5 .cse16 .cse6 .cse20 .cse21 .cse9) (or .cse2 (and (or .cse1 .cse22 .cse3) .cse19)))) (or (let ((.cse23 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse10 .cse11 .cse12 .cse5 .cse23 .cse20 .cse13 .cse8 .cse9) (or .cse1 (and (or .cse5 .cse23 .cse6 .cse20 .cse8 .cse9) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:50:38,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse43 (mod c_~first~0 4294967296))) (let ((.cse30 (mod c_~next~0 4294967296)) (.cse27 (mod c_~buffer_size~0 4294967296)) (.cse42 (+ .cse43 1))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse24 (mod (+ c_~next~0 1) 4294967296)) (.cse37 (not (= (+ c_~value~0 1) 0))) (.cse15 (< .cse27 .cse42)) (.cse31 (< .cse30 1)) (.cse34 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse16 (and (or (and (<= 1 .cse30) (<= .cse42 .cse27)) .cse37) (or .cse15 .cse31 (and (or (not (= c_~value~0 (select .cse34 (+ |c_~#buffer~0.offset| .cse43 (- 4294967296))))) (< .cse43 2147483648)) (or (< 2147483647 .cse43) (not (= c_~value~0 (select .cse34 (+ |c_~#buffer~0.offset| .cse43))))))))) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (= (mod c_~receive~0 256) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse29 (mod .cse24 .cse27)) (.cse20 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse5)) (.cse21 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse17 (and (or .cse5 .cse20) (or .cse2 .cse21 .cse3))) (.cse13 (< .cse29 1)) (.cse18 (or .cse16 .cse10 .cse11 .cse12 .cse20)) (.cse9 (and (or .cse31 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse33 (* v_y_362 4294967296))) (let ((.cse32 (+ v_z_362 .cse33 (* v_y_361 4294967296)))) (or (< .cse27 v_z_362) (< .cse32 0) (< .cse27 (+ v_z_362 .cse33 4)) (< 4294967295 .cse32) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse33) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse36 (* v_y_362 4294967296))) (let ((.cse35 (+ v_z_362 .cse36 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse35 0) (< .cse27 (+ v_z_362 .cse36 4)) (< 4294967295 .cse35) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse36) 0) (= v_z_362 0))))))) (or .cse37 (< 0 .cse30)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse39 (* v_y_361 4294967296)) (.cse38 (* v_y_363 4294967296))) (or (< .cse27 (+ v_z_363 .cse38 1 .cse39)) (< (+ v_z_363 .cse38 .cse39) 0) (< .cse27 v_z_363) (< .cse27 (+ v_z_363 4 .cse38)) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse38) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse27 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse27 (+ v_z_363 4 .cse40)) (< (+ v_z_363 .cse40) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse31))) (.cse1 (not .cse11)) (.cse4 (< .cse27 (+ .cse30 1))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse28 (mod (+ (* v_y_350 (- 4294967296)) .cse29 (* v_y_354 (- 4294967296)) 1) .cse27))) (let ((.cse23 (mod (mod (+ .cse28 1) 4294967296) .cse27)) (.cse25 (* v_y_354 4294967296)) (.cse26 (* v_y_350 4294967296))) (or (< .cse23 1) (< .cse24 (+ .cse25 .cse26)) (< (mod (mod (+ .cse23 1) 4294967296) .cse27) 1) (< (+ .cse25 4294967295 .cse26) .cse24) (< (+ .cse26 .cse27) (+ .cse24 1)) (< .cse24 .cse26) (< .cse28 1)))))) (.cse8 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (let ((.cse6 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse1 (and (or .cse2 .cse3 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 .cse5 .cse6 .cse7 .cse8))) (or .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse7 .cse8)))) (or (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse13 .cse14 .cse4 .cse15 .cse5 .cse8) (or (and (or .cse14 .cse16 .cse10 .cse11 .cse12) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse17) .cse18)) (or .cse0 .cse17) (or .cse0 (and (or .cse13 .cse4 .cse15 .cse5 .cse19 .cse20 .cse8) (or .cse2 (and (or .cse1 .cse21 .cse3) .cse18)))) (or (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse9 .cse10 .cse11 .cse4 .cse22 .cse19 .cse12 .cse7 .cse8) (or .cse1 (and (or .cse4 .cse22 .cse5 .cse19 .cse7 .cse8) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:50:59,158 WARN L293 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 205 DAG size of output: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:51:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:51:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-07-22 22:51:03,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-07-22 22:51:03,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:51:03,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-07-22 22:51:03,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-22 22:51:03,893 INFO L85 PathProgramCache]: Analyzing trace with hash 713275065, now seen corresponding path program 7 times [2024-07-22 22:51:03,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-22 22:51:03,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999554210] [2024-07-22 22:51:03,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-22 22:51:03,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-22 22:51:03,913 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-07-22 22:51:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912402317] [2024-07-22 22:51:03,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-07-22 22:51:03,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-22 22:51:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-22 22:51:03,915 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-07-22 22:51:03,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-07-22 22:51:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-22 22:51:04,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 25 conjunts are in the unsatisfiable core [2024-07-22 22:51:04,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-22 22:51:04,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:04,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:04,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:04,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:04,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:04,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:06,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:06,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:06,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:08,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:08,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:08,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-07-22 22:51:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:51:10,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-22 22:51:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-22 22:51:16,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-22 22:51:16,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999554210] [2024-07-22 22:51:16,291 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-07-22 22:51:16,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912402317] [2024-07-22 22:51:16,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912402317] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-22 22:51:16,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-07-22 22:51:16,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2024-07-22 22:51:16,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678897278] [2024-07-22 22:51:16,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-07-22 22:51:16,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-07-22 22:51:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-22 22:51:16,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-07-22 22:51:16,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2024-07-22 22:51:16,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:51:16,292 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-22 22:51:16,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.6) internal successors, (138), 30 states have internal predecessors, (138), 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) [2024-07-22 22:51:16,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:51:16,292 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-07-22 22:51:16,293 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-22 22:51:25,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-07-22 22:51:26,671 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse43 (mod c_~first~0 4294967296))) (let ((.cse30 (mod c_~next~0 4294967296)) (.cse27 (mod c_~buffer_size~0 4294967296)) (.cse42 (+ .cse43 1))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse24 (mod (+ c_~next~0 1) 4294967296)) (.cse37 (not (= (+ c_~value~0 1) 0))) (.cse15 (< .cse27 .cse42)) (.cse31 (< .cse30 1)) (.cse34 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse16 (and (or (and (<= 1 .cse30) (<= .cse42 .cse27)) .cse37) (or .cse15 .cse31 (and (or (not (= c_~value~0 (select .cse34 (+ |c_~#buffer~0.offset| .cse43 (- 4294967296))))) (< .cse43 2147483648)) (or (< 2147483647 .cse43) (not (= c_~value~0 (select .cse34 (+ |c_~#buffer~0.offset| .cse43))))))))) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (= (mod c_~receive~0 256) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse29 (mod .cse24 .cse27)) (.cse20 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse5)) (.cse21 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse17 (and (or .cse5 .cse20) (or .cse2 .cse21 .cse3))) (.cse13 (< .cse29 1)) (.cse18 (or .cse16 .cse10 .cse11 .cse12 .cse20)) (.cse9 (and (or .cse31 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse33 (* v_y_362 4294967296))) (let ((.cse32 (+ v_z_362 .cse33 (* v_y_361 4294967296)))) (or (< .cse27 v_z_362) (< .cse32 0) (< .cse27 (+ v_z_362 .cse33 4)) (< 4294967295 .cse32) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse33) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse36 (* v_y_362 4294967296))) (let ((.cse35 (+ v_z_362 .cse36 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse35 0) (< .cse27 (+ v_z_362 .cse36 4)) (< 4294967295 .cse35) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse36) 0) (= v_z_362 0))))))) (or .cse37 (< 0 .cse30)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse39 (* v_y_361 4294967296)) (.cse38 (* v_y_363 4294967296))) (or (< .cse27 (+ v_z_363 .cse38 1 .cse39)) (< (+ v_z_363 .cse38 .cse39) 0) (< .cse27 v_z_363) (< .cse27 (+ v_z_363 4 .cse38)) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse38) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse27 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse27 (+ v_z_363 4 .cse40)) (< (+ v_z_363 .cse40) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse34 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse31))) (.cse1 (not .cse11)) (.cse4 (< .cse27 (+ .cse30 1))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse28 (mod (+ (* v_y_350 (- 4294967296)) .cse29 (* v_y_354 (- 4294967296)) 1) .cse27))) (let ((.cse23 (mod (mod (+ .cse28 1) 4294967296) .cse27)) (.cse25 (* v_y_354 4294967296)) (.cse26 (* v_y_350 4294967296))) (or (< .cse23 1) (< .cse24 (+ .cse25 .cse26)) (< (mod (mod (+ .cse23 1) 4294967296) .cse27) 1) (< (+ .cse25 4294967295 .cse26) .cse24) (< (+ .cse26 .cse27) (+ .cse24 1)) (< .cse24 .cse26) (< .cse28 1)))))) (.cse8 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (let ((.cse6 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse1 (and (or .cse2 .cse3 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 .cse5 .cse6 .cse7 .cse8))) (or .cse9 .cse10 .cse11 .cse4 .cse12 .cse6 .cse7 .cse8)))) (or .cse0 .cse3) (or (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse13 .cse14 .cse4 .cse15 .cse5 .cse8) (or (and (or .cse14 .cse16 .cse10 .cse11 .cse12) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse17) .cse18)) (or .cse0 .cse17) (or .cse0 (and (or .cse13 .cse4 .cse15 .cse5 .cse19 .cse20 .cse8) (or .cse2 (and (or .cse1 .cse21 .cse3) .cse18)))) (or (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse9 .cse10 .cse11 .cse4 .cse22 .cse19 .cse12 .cse7 .cse8) (or .cse1 (and (or .cse4 .cse22 .cse5 .cse19 .cse7 .cse8) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false [2024-07-22 22:51:26,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse32 (mod c_~next~0 4294967296)) (.cse29 (mod c_~buffer_size~0 4294967296)) (.cse44 (+ .cse45 1))) (let ((.cse6 (= (mod c_~send~0 256) 0)) (.cse26 (mod (+ c_~next~0 1) 4294967296)) (.cse39 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse29 .cse44)) (.cse33 (< .cse32 1)) (.cse36 (select |c_#memory_int| |c_~#buffer~0.base|))) (let ((.cse19 (and (or (and (<= 1 .cse32) (<= .cse44 .cse29)) .cse39) (or .cse18 .cse33 (and (or (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))))) (< .cse45 2147483648)) (or (< 2147483647 .cse45) (not (= c_~value~0 (select .cse36 (+ |c_~#buffer~0.offset| .cse45))))))))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse31 (mod .cse26 .cse29)) (.cse22 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse2 (not .cse6)) (.cse23 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (let ((.cse7 (< 0 (+ 7 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse4 (< 0 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (and (or .cse6 .cse22) (or .cse2 .cse23 .cse3))) (.cse16 (< .cse31 1)) (.cse21 (or .cse19 .cse11 .cse12 .cse13 .cse22)) (.cse10 (and (or .cse33 (and (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse35 (* v_y_362 4294967296))) (let ((.cse34 (+ v_z_362 .cse35 (* v_y_361 4294967296)))) (or (< .cse29 v_z_362) (< .cse34 0) (< .cse29 (+ v_z_362 .cse35 4)) (< 4294967295 .cse34) (< v_z_362 2147483649) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_362 (- 4294967297))))) (< (+ v_z_362 .cse35) 0))))) (forall ((v_z_362 Int) (v_y_361 Int) (|~#buffer~0.offset| Int) (v_y_362 Int)) (let ((.cse38 (* v_y_362 4294967296))) (let ((.cse37 (+ v_z_362 .cse38 (* v_y_361 4294967296)))) (or (< v_z_362 0) (< 2147483648 v_z_362) (< .cse37 0) (< .cse29 (+ v_z_362 .cse38 4)) (< 4294967295 .cse37) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_362)))) (< (+ v_z_362 .cse38) 0) (= v_z_362 0))))))) (or .cse39 (< 0 .cse32)) (or (and (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse41 (* v_y_361 4294967296)) (.cse40 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse40 1 .cse41)) (< (+ v_z_363 .cse40 .cse41) 0) (< .cse29 v_z_363) (< .cse29 (+ v_z_363 4 .cse40)) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| v_z_363 (- 4294967297))))) (< (+ v_z_363 .cse40) 0) (< v_z_363 2147483649)))) (forall ((v_y_361 Int) (v_z_363 Int) (|~#buffer~0.offset| Int) (v_y_363 Int)) (let ((.cse43 (* v_y_361 4294967296)) (.cse42 (* v_y_363 4294967296))) (or (< .cse29 (+ v_z_363 .cse42 1 .cse43)) (< (+ v_z_363 .cse42 .cse43) 0) (< .cse29 (+ v_z_363 4 .cse42)) (< (+ v_z_363 .cse42) 0) (= v_z_363 0) (< v_z_363 0) (not (= c_~value~0 (select .cse36 (+ |~#buffer~0.offset| (- 1) v_z_363)))) (< 2147483648 v_z_363))))) .cse33))) (.cse1 (not .cse12)) (.cse5 (< .cse29 (+ .cse32 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse8 (forall ((v_y_350 Int) (v_y_354 Int)) (let ((.cse30 (mod (+ (* v_y_350 (- 4294967296)) .cse31 (* v_y_354 (- 4294967296)) 1) .cse29))) (let ((.cse25 (mod (mod (+ .cse30 1) 4294967296) .cse29)) (.cse27 (* v_y_354 4294967296)) (.cse28 (* v_y_350 4294967296))) (or (< .cse25 1) (< .cse26 (+ .cse27 .cse28)) (< (mod (mod (+ .cse25 1) 4294967296) .cse29) 1) (< (+ .cse27 4294967295 .cse28) .cse26) (< (+ .cse28 .cse29) (+ .cse26 1)) (< .cse26 .cse28) (< .cse30 1)))))) (.cse9 (< c_~buffer_size~0 1)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 (and (or .cse1 (and (or .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse8 .cse9))) (or .cse10 .cse11 .cse12 .cse5 .cse13 .cse7 .cse8 .cse9))) (or .cse0 (and (let ((.cse14 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse5 .cse9) (not (= .cse14 0))) .cse6 .cse15 (< 0 .cse14))) (or .cse2 .cse3)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or (and (<= (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse2) .cse7) (or .cse1 .cse2 .cse4))) (or .cse0 .cse3) (or (let ((.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse16 .cse17 .cse5 .cse18 .cse6 .cse9) (or (and (or .cse17 .cse19 .cse11 .cse12 .cse13) (or .cse1 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse2))) .cse0) (or .cse0 (and (or .cse1 .cse20) .cse21)) (or .cse0 .cse20) (or .cse0 (and (or .cse16 .cse5 .cse18 .cse6 .cse15 .cse22 .cse9) (or .cse2 (and (or .cse1 .cse23 .cse3) .cse21)))) (or (let ((.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 6)))) (and (or .cse10 .cse11 .cse12 .cse5 .cse24 .cse15 .cse13 .cse8 .cse9) (or .cse1 (and (or .cse5 .cse24 .cse6 .cse15 .cse8 .cse9) (or .cse2 .cse3 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)))))) .cse0))))))) is different from false Killed by 15