./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d2ba6107 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/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-d2ba610-m [2023-11-21 20:52:38,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:52:38,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-21 20:52:38,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:52:38,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:52:38,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:52:38,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:52:38,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:52:38,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:52:38,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:52:38,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:52:38,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:52:38,971 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:52:38,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:52:38,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:52:38,972 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:52:38,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:52:38,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:52:38,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:52:38,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:52:38,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:52:38,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:52:38,974 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:52:38,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:52:38,974 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:52:38,975 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:52:38,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:52:38,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 20:52:38,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:52:38,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:52:38,976 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:52:38,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:52:38,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-21 20:52:38,978 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:52:38,978 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-21 20:52:38,978 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-21 20:52:38,978 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8fcb457b1bed8494a9a3b58e82500f367f4337ac38b5a41a5dad0da896f97e40 [2023-11-21 20:52:39,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:52:39,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:52:39,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:52:39,212 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:52:39,214 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:52:39,215 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 [2023-11-21 20:52:40,206 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:52:40,404 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:52:40,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-11-21 20:52:40,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1b0b85904/4f575c7a57044b9b902a7ef0e332ba63/FLAG00ab208f8 [2023-11-21 20:52:40,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1b0b85904/4f575c7a57044b9b902a7ef0e332ba63 [2023-11-21 20:52:40,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:52:40,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:52:40,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:52:40,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:52:40,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:52:40,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:52:40" (1/1) ... [2023-11-21 20:52:40,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acc8d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:40, skipping insertion in model container [2023-11-21 20:52:40,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:52:40" (1/1) ... [2023-11-21 20:52:40,854 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:52:41,099 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2023-11-21 20:52:41,105 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2023-11-21 20:52:41,108 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2023-11-21 20:52:41,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:52:41,119 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:52:41,159 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2023-11-21 20:52:41,167 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2023-11-21 20:52:41,171 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2023-11-21 20:52:41,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:52:41,207 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:52:41,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41 WrapperNode [2023-11-21 20:52:41,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:52:41,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:52:41,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:52:41,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:52:41,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,250 INFO L138 Inliner]: procedures = 169, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-11-21 20:52:41,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:52:41,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:52:41,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:52:41,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:52:41,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,275 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:52:41,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:52:41,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:52:41,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:52:41,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (1/1) ... [2023-11-21 20:52:41,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:52:41,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:41,330 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) [2023-11-21 20:52:41,336 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 [2023-11-21 20:52:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 20:52:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-21 20:52:41,365 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-21 20:52:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-21 20:52:41,365 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 20:52:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-21 20:52:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:52:41,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:52:41,369 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 20:52:41,505 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:52:41,506 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:52:41,737 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:52:41,924 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:52:41,925 INFO L308 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-21 20:52:41,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:52:41 BoogieIcfgContainer [2023-11-21 20:52:41,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:52:41,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:52:41,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:52:41,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:52:41,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:52:40" (1/3) ... [2023-11-21 20:52:41,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eae8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:52:41, skipping insertion in model container [2023-11-21 20:52:41,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:52:41" (2/3) ... [2023-11-21 20:52:41,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17eae8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:52:41, skipping insertion in model container [2023-11-21 20:52:41,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:52:41" (3/3) ... [2023-11-21 20:52:41,940 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2023-11-21 20:52:41,946 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 20:52:41,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:52:41,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-21 20:52:41,955 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 20:52:42,005 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-21 20:52:42,036 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:42,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 20:52:42,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:42,040 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) [2023-11-21 20:52:42,041 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 [2023-11-21 20:52:42,065 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 20:52:42,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2023-11-21 20:52:42,079 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@43392ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:42,082 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 20:52:43,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:43,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1807394834, now seen corresponding path program 1 times [2023-11-21 20:52:43,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:43,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289427095] [2023-11-21 20:52:43,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:43,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:43,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289427095] [2023-11-21 20:52:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289427095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:43,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963530624] [2023-11-21 20:52:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:43,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:43,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:43,779 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:43,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:43,779 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:43,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:52:43,905 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:43,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:43,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1791929901, now seen corresponding path program 1 times [2023-11-21 20:52:43,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769316011] [2023-11-21 20:52:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-21 20:52:44,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:44,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769316011] [2023-11-21 20:52:44,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769316011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:44,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:44,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:44,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079741102] [2023-11-21 20:52:44,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:44,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:44,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:44,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,029 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:44,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:44,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:52:44,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:44,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2045830047, now seen corresponding path program 1 times [2023-11-21 20:52:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49414847] [2023-11-21 20:52:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:44,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:44,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:44,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49414847] [2023-11-21 20:52:44,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49414847] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:44,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:44,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:52:44,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423043515] [2023-11-21 20:52:44,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:52:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:44,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:52:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:52:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:44,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:44,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,296 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:44,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:52:44,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:44,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 71512693, now seen corresponding path program 1 times [2023-11-21 20:52:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458260462] [2023-11-21 20:52:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:44,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:44,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:44,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458260462] [2023-11-21 20:52:44,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458260462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:44,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:44,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:52:44,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999277429] [2023-11-21 20:52:44,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:44,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:44,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:44,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,547 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:44,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:44,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:44,548 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:52:44,645 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:44,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:44,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1077743245, now seen corresponding path program 1 times [2023-11-21 20:52:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213761063] [2023-11-21 20:52:44,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:44,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:44,668 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 20:52:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796988238] [2023-11-21 20:52:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:44,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:44,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:44,670 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) [2023-11-21 20:52:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 20:52:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:44,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:52:44,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:52:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-21 20:52:44,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:52:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213761063] [2023-11-21 20:52:44,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 20:52:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796988238] [2023-11-21 20:52:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796988238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:44,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:44,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:52:44,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393367238] [2023-11-21 20:52:44,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:44,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:52:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:44,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:52:44,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:52:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:44,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:44,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:44,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:44,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-21 20:52:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:45,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:45,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1915268919, now seen corresponding path program 1 times [2023-11-21 20:52:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271776179] [2023-11-21 20:52:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:45,210 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 20:52:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830943689] [2023-11-21 20:52:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:45,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:45,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:45,215 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) [2023-11-21 20:52:45,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 20:52:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:45,389 INFO L262 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:52:45,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:52:45,427 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 [2023-11-21 20:52:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-11-21 20:52:45,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:52:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271776179] [2023-11-21 20:52:45,448 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 20:52:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830943689] [2023-11-21 20:52:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830943689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:45,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:45,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:45,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715777765] [2023-11-21 20:52:45,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:45,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:45,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:45,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:45,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:45,452 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:45,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:45,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,453 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-21 20:52:45,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:45,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:45,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash -29667548, now seen corresponding path program 2 times [2023-11-21 20:52:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:45,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938362899] [2023-11-21 20:52:45,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:45,731 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 20:52:45,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819945199] [2023-11-21 20:52:45,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 20:52:45,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:45,732 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) [2023-11-21 20:52:45,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 20:52:45,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-21 20:52:45,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 20:52:45,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-21 20:52:45,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:52:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 20:52:45,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:52:45,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938362899] [2023-11-21 20:52:45,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 20:52:45,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819945199] [2023-11-21 20:52:45,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819945199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:45,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:45,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:52:45,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467141388] [2023-11-21 20:52:45,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:45,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:52:45,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:45,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:52:45,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:52:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:45,852 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:45,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:45,853 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:50,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:50,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:52:50,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-21 20:52:50,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-21 20:52:50,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-21 20:52:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:50,658 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-21 20:52:50,659 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE,SAFE (1/3) [2023-11-21 20:52:50,661 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:50,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 20:52:50,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:50,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 20:52:50,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2023-11-21 20:52:50,668 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 20:52:50,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-21 20:52:50,668 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@43392ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:50,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 20:52:52,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-11-21 20:52:52,956 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-11-21 20:52:52,957 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-11-21 20:52:52,957 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2023-11-21 20:52:52,958 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-21 20:52:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:52,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-21 20:52:52,995 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-21 20:52:52,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2023-11-21 20:52:52,996 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@43392ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:52:52,996 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-21 20:52:53,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2023-11-21 20:52:54,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -815220810, now seen corresponding path program 1 times [2023-11-21 20:52:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421574305] [2023-11-21 20:52:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421574305] [2023-11-21 20:52:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421574305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:54,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:52:54,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288463346] [2023-11-21 20:52:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:54,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:54,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:54,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:54,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:54,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:52:54,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,309 INFO L85 PathProgramCache]: Analyzing trace with hash 186410603, now seen corresponding path program 1 times [2023-11-21 20:52:54,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621307798] [2023-11-21 20:52:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-21 20:52:54,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:54,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621307798] [2023-11-21 20:52:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621307798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648317769] [2023-11-21 20:52:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:54,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:54,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,414 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:54,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:54,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:52:54,451 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1467656430, now seen corresponding path program 1 times [2023-11-21 20:52:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091259084] [2023-11-21 20:52:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 20:52:54,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091259084] [2023-11-21 20:52:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091259084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249201320] [2023-11-21 20:52:54,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:54,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:54,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:54,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,502 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:54,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:52:54,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -725410803, now seen corresponding path program 1 times [2023-11-21 20:52:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970941157] [2023-11-21 20:52:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 20:52:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:54,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970941157] [2023-11-21 20:52:54,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970941157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:54,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 20:52:54,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292091879] [2023-11-21 20:52:54,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:54,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:52:54,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:52:54,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:52:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:54,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:54,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:52:54,691 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -137100289, now seen corresponding path program 1 times [2023-11-21 20:52:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392908124] [2023-11-21 20:52:54,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:54,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:54,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:54,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392908124] [2023-11-21 20:52:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392908124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:52:54,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345409579] [2023-11-21 20:52:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:54,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 20:52:54,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:54,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 20:52:54,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 20:52:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,782 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:54,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:54,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:52:54,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:54,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1125336516, now seen corresponding path program 1 times [2023-11-21 20:52:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117691466] [2023-11-21 20:52:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:54,876 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 20:52:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546430645] [2023-11-21 20:52:54,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:54,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:54,877 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) [2023-11-21 20:52:54,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-21 20:52:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:55,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 20:52:55,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:52:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:55,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 20:52:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:52:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117691466] [2023-11-21 20:52:55,069 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 20:52:55,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546430645] [2023-11-21 20:52:55,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546430645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:52:55,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:52:55,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 20:52:55,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537837064] [2023-11-21 20:52:55,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:52:55,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 20:52:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:52:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 20:52:55,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-21 20:52:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:55,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:52:55,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:52:55,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:55,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:52:55,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:52:55,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-21 20:52:55,313 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,SelfDestructingSolverStorable12 [2023-11-21 20:52:55,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 20:52:55,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:52:55,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1664668833, now seen corresponding path program 1 times [2023-11-21 20:52:55,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:52:55,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762522491] [2023-11-21 20:52:55,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:55,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:52:55,329 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 20:52:55,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587028041] [2023-11-21 20:52:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:52:55,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 20:52:55,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-21 20:52:55,356 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) [2023-11-21 20:52:55,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-21 20:52:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:52:55,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-21 20:52:55,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 20:52:55,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-21 20:52:55,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2023-11-21 20:52:55,755 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-21 20:52:55,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-21 20:52:55,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-11-21 20:52:55,932 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 22 treesize of output 17 [2023-11-21 20:52:56,226 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 23 treesize of output 18 [2023-11-21 20:52:56,352 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 24 treesize of output 20 [2023-11-21 20:52:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:52:56,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 20:53:26,948 WARN L293 SmtUtils]: Spent 7.29s on a formula simplification. DAG size of input: 465 DAG size of output: 456 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 20:53:59,746 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse12 (mod c_~next~0 4294967296))) (or (let ((.cse45 (mod (mod (+ c_~next~0 1) 4294967296) .cse0))) (let ((.cse31 (mod (mod (mod (+ .cse45 1) 4294967296) .cse0) 4294967296)) (.cse7 (mod c_~first~0 4294967296))) (let ((.cse4 (< 2147483647 .cse7)) (.cse14 (< 2147483647 .cse12)) (.cse13 (< .cse12 2147483648)) (.cse21 (< .cse7 2147483648)) (.cse32 (<= 1 .cse31)) (.cse8 (mod .cse45 4294967296)) (.cse11 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse1 (+ .cse7 1))) (and (or (< .cse0 .cse1) (let ((.cse10 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse5 (< .cse10 2147483648)) (.cse18 (< 2147483647 .cse10)) (.cse25 (< .cse8 2147483648)) (.cse29 (< 2147483647 .cse8)) (.cse2 (mod .cse11 256))) (and (or (< .cse2 128) (let ((.cse30 (+ .cse10 1))) (let ((.cse23 (= (+ 2 |c_t1Thread1of1ForFork1_~i~0#1|) 0)) (.cse24 (and .cse32 (<= .cse30 .cse0))) (.cse3 (< .cse31 1)) (.cse9 (+ (- 256) .cse2)) (.cse22 (< .cse0 .cse30))) (and (or (and (or .cse3 (and (or .cse4 (and (or .cse5 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_24 Int) (|~#buffer~0.offset| Int)) (let ((.cse6 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_24))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse6 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse6 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11)))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_25 Int) (|~#buffer~0.offset| Int)) (let ((.cse15 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_25))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse15 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse15 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_22 Int) (|~#buffer~0.offset| Int)) (let ((.cse16 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_22))) (or (not (= (select .cse16 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse11 (select (store .cse16 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_23 Int) (|~#buffer~0.offset| Int)) (let ((.cse17 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_23))) (or (not (= (select .cse17 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse17 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10)) .cse11)))) .cse13)) .cse18))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_26 Int)) (let ((.cse19 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_26))) (or (= (select (store .cse19 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse19 (+ |~#buffer~0.offset| .cse7 (- 4294967296))))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_27 Int)) (let ((.cse20 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_27))) (or (not (= (select .cse20 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse11 (select (store .cse20 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))))))) .cse13)) .cse21)) .cse22) (or .cse23 (and (or .cse4 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_21 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_21) (+ |~#buffer~0.offset| .cse7))))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_20 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_20) (+ |~#buffer~0.offset| .cse7)))))))) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_18 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_18) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_19 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_19) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13)) .cse21)) .cse24)) .cse25) (or (and (or .cse23 (and (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_16 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_16) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_15 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_15) (+ |~#buffer~0.offset| .cse7 (- 4294967296)))))) .cse21)) .cse24) (or .cse3 (and (or .cse5 (and (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_14 Int) (|~#buffer~0.offset| Int)) (let ((.cse26 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_14))) (or (not (= (select .cse26 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse26 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_12 Int) (|~#buffer~0.offset| Int)) (let ((.cse27 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_12))) (or (= (select (store .cse27 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse27 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse21))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_9 Int)) (let ((.cse28 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_9))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse28 (+ |~#buffer~0.offset| .cse7)))) (= (select (store .cse28 (+ |~#buffer~0.offset| .cse8) .cse9) (+ |~#buffer~0.offset| .cse10)) .cse11)))) .cse18)) .cse22)) .cse29))))) (or (let ((.cse36 (< 0 .cse31)) (.cse34 (< .cse10 .cse0))) (and (or .cse4 (and (or (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_44 Int) (|~#buffer~0.offset| Int)) (let ((.cse33 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_44))) (or (= .cse11 (select (store .cse33 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10))) (not (= (select .cse33 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse18) (or .cse34 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_49 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_49) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or .cse5 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_47 Int) (|~#buffer~0.offset| Int)) (let ((.cse35 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_47))) (or (not (= (select .cse35 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse35 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_45 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_45) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse36)) .cse29) (or .cse25 (and (or .cse36 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_41 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_41) (+ |~#buffer~0.offset| .cse7))))) .cse14) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_42 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_42) (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13))) (or .cse5 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_38 Int)) (let ((.cse37 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_38))) (or (= (select (store .cse37 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse37 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_37 Int)) (let ((.cse38 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_37))) (or (= (select (store .cse38 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse38 (+ |~#buffer~0.offset| .cse7)))))))))) (or (and (or .cse13 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_39 Int)) (let ((.cse39 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_39))) (or (not (= (select .cse39 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse39 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10)) .cse11))))) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_40 Int)) (let ((.cse40 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_40))) (or (= .cse11 (select (store .cse40 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10))) (not (= (select .cse40 (+ |~#buffer~0.offset| .cse7)) |c_t1Thread1of1ForFork1_~i~0#1|))))))) .cse18))))) (or (and (or .cse25 (and (or .cse34 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_33 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_33) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse13) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_32 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_32) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))))) (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_29 Int)) (let ((.cse41 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_29))) (or (= .cse11 (select (store .cse41 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296)))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse41 (+ |~#buffer~0.offset| .cse7 (- 4294967296))))))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_28 Int)) (let ((.cse42 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_28))) (or (= (select (store .cse42 (+ |~#buffer~0.offset| .cse8 (- 4294967296)) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse42 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse13) (or (and (or .cse14 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_30 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_30) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_31 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_31) (+ |~#buffer~0.offset| .cse7 (- 4294967296)))))) .cse13)) .cse36))) (or (and (or .cse34 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_34 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_34) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_36 Int) (|~#buffer~0.offset| Int)) (let ((.cse43 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_36))) (or (= (select (store .cse43 (+ |~#buffer~0.offset| .cse8) .cse2) (+ |~#buffer~0.offset| .cse10 (- 4294967296))) .cse11) (not (= (select .cse43 (+ |~#buffer~0.offset| .cse7 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))))) .cse29)) .cse21))) (< 127 .cse2))))) (< .cse8 1)) (let ((.cse44 (<= .cse1 .cse0))) (or (and (or .cse4 (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_7 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12) v_DerPreprocessor_7) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7)) 0)) .cse14) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_8 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_8) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7)) 0)) .cse13))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_4 Int)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse12 (- 4294967296)) v_DerPreprocessor_4) (+ |~#buffer~0.offset| .cse8) 0) (+ |~#buffer~0.offset| .cse7 (- 4294967296))) 0)) .cse21) .cse32 .cse44) (and (<= 1 .cse8) .cse44) (not (= .cse11 0)))))))) (< .cse0 (+ .cse12 1)) (= (mod c_~send~0 256) 0))) is different from false [2023-11-21 20:54:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:54:04,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:54:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762522491] [2023-11-21 20:54:04,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 20:54:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587028041] [2023-11-21 20:54:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587028041] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 20:54:04,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 20:54:04,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2023-11-21 20:54:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679020255] [2023-11-21 20:54:04,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 20:54:04,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-21 20:54:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:54:04,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-21 20:54:04,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=616, Unknown=1, NotChecked=52, Total=812 [2023-11-21 20:54:04,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:54:04,300 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-21 20:54:04,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 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) [2023-11-21 20:54:04,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:54:04,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:54:04,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:54:04,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:54:04,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-21 20:54:04,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:54:04,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-21 20:54:27,261 WARN L293 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 798 DAG size of output: 467 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 20:54:29,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-11-21 20:54:39,608 WARN L293 SmtUtils]: Spent 5.27s on a formula simplification. DAG size of input: 336 DAG size of output: 395 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 20:54:57,971 WARN L293 SmtUtils]: Spent 16.56s on a formula simplification. DAG size of input: 713 DAG size of output: 906 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 20:55:00,843 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] [2023-11-21 20:55:18,612 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 [1] [2023-11-21 20:55:21,628 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 [1] [2023-11-21 20:55:35,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse88 (mod c_~buffer_size~0 4294967296))) (let ((.cse11 (mod (+ c_~first~0 1) 4294967296)) (.cse57 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse96 (mod (mod (+ c_~next~0 1) 4294967296) .cse88)) (.cse6 (mod c_~first~0 4294967296))) (let ((.cse89 (+ .cse6 1)) (.cse10 (mod .cse96 4294967296)) (.cse87 (mod |c_t1Thread1of1ForFork1_~i~0#1| 256)) (.cse5 (mod c_~next~0 4294967296)) (.cse72 (mod .cse57 256)) (.cse95 (+ .cse11 1))) (let ((.cse38 (<= .cse95 .cse88)) (.cse56 (+ (- 256) .cse72)) (.cse83 (+ |c_~#buffer~0.offset| .cse6)) (.cse82 (+ |c_~#buffer~0.offset| .cse6 (- 4294967296))) (.cse49 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse86 (+ .cse5 |c_~#buffer~0.offset|)) (.cse91 (+ (- 256) .cse87)) (.cse36 (<= 1 .cse10)) (.cse51 (<= .cse89 .cse88))) (let ((.cse52 (and .cse36 .cse51)) (.cse40 (store .cse49 .cse86 .cse91)) (.cse45 (= .cse57 0)) (.cse39 (store .cse49 .cse86 .cse87)) (.cse68 (mod (mod (mod (+ .cse96 1) 4294967296) .cse88) 4294967296)) (.cse48 (select .cse49 .cse82)) (.cse24 (< .cse6 2147483648)) (.cse3 (< 2147483647 .cse6)) (.cse47 (select .cse49 .cse83)) (.cse84 (store .cse49 .cse86 .cse72)) (.cse70 (< 127 .cse72)) (.cse90 (+ .cse5 |c_~#buffer~0.offset| (- 4294967296))) (.cse17 (< .cse5 2147483648)) (.cse18 (< 2147483647 .cse5)) (.cse35 (+ |c_~#buffer~0.offset| .cse11)) (.cse12 (< 2147483647 .cse11)) (.cse8 (< .cse11 2147483648)) (.cse81 (store .cse49 .cse86 .cse56)) (.cse37 (+ |c_~#buffer~0.offset| .cse11 (- 4294967296))) (.cse2 (< .cse10 1)) (.cse41 (< .cse88 .cse95)) (.cse44 (and .cse36 .cse38)) (.cse63 (= (+ 2 |c_t1Thread1of1ForFork1_~i~0#1|) 0)) (.cse69 (< .cse72 128))) (let ((.cse32 (< .cse5 1)) (.cse46 (and (or (and (or (let ((.cse92 (store .cse49 .cse90 .cse72))) (and (or (= (select .cse92 .cse35) .cse57) .cse12) .cse36 .cse38 (or .cse8 (= .cse57 (select .cse92 .cse37))))) .cse17) (or (and (or (= .cse57 (select .cse84 .cse35)) .cse12) (or .cse8 (= .cse57 (select .cse84 .cse37))) .cse36 .cse38) .cse18)) .cse70) (or (let ((.cse93 (or .cse44 .cse63))) (and (or (and .cse93 (or (let ((.cse94 (store .cse49 .cse90 .cse56))) (and (or (= (select .cse94 .cse35) .cse57) .cse12) (or .cse8 (= .cse57 (select .cse94 .cse37))))) .cse2 .cse41)) .cse17) (or .cse18 (and .cse93 (or (and (or (= (select .cse81 .cse35) .cse57) .cse12) (or .cse8 (= .cse57 (select .cse81 .cse37)))) .cse2 .cse41))))) .cse69))) (.cse33 (and (or (not (= c_~value~0 .cse48)) .cse24) (or .cse3 (not (= c_~value~0 .cse47))))) (.cse0 (< .cse88 (+ .cse5 1))) (.cse14 (< 2147483647 .cse10)) (.cse7 (< 0 .cse68)) (.cse4 (< .cse11 .cse88)) (.cse15 (< .cse10 2147483648)) (.cse31 (not (= (+ c_~value~0 1) 0))) (.cse34 (store .cse49 .cse90 .cse87)) (.cse30 (and (or .cse3 (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse39 .cse83))) .cse36 (or (= (select .cse39 .cse82) |c_t1Thread1of1ForFork1_~i~0#1|) .cse24) .cse51)) (.cse29 (< 127 .cse87)) (.cse25 (and (<= 1 .cse5) .cse51)) (.cse53 (not .cse45)) (.cse43 (store .cse49 .cse90 .cse91)) (.cse1 (< .cse88 .cse89)) (.cse27 (and (or .cse3 (= (select .cse40 .cse83) |c_t1Thread1of1ForFork1_~i~0#1|)) (or .cse24 (= (select .cse40 .cse82) |c_t1Thread1of1ForFork1_~i~0#1|)))) (.cse28 (or .cse52 .cse45)) (.cse26 (< .cse87 128))) (and (or .cse0 .cse1 (= (mod c_~send~0 256) 0) .cse2 (and (or .cse3 (and (or (and (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_49 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_49) (+ |~#buffer~0.offset| .cse6)) 0)))) (or .cse7 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_45 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_45) (+ |~#buffer~0.offset| .cse6)) 0)))) (or .cse8 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_47 Int) (|~#buffer~0.offset| Int)) (let ((.cse9 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_47))) (or (not (= (select .cse9 (+ |~#buffer~0.offset| .cse6)) 0)) (= (select (store .cse9 (+ |~#buffer~0.offset| .cse10) 1) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) 1))))) (or .cse12 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_44 Int) (|~#buffer~0.offset| Int)) (let ((.cse13 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_44))) (or (= (select (store .cse13 (+ |~#buffer~0.offset| .cse10) 1) (+ |~#buffer~0.offset| .cse11)) 1) (not (= (select .cse13 (+ |~#buffer~0.offset| .cse6)) 0))))))) .cse14) (or .cse15 (and (or (and (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_39 Int)) (let ((.cse16 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_39))) (or (not (= (select .cse16 (+ |~#buffer~0.offset| .cse6)) 0)) (= (select (store .cse16 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) 1) (+ |~#buffer~0.offset| .cse11)) 1)))) .cse17) (or .cse18 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_40 Int)) (let ((.cse19 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_40))) (or (= (select (store .cse19 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) 1) (+ |~#buffer~0.offset| .cse11)) 1) (not (= (select .cse19 (+ |~#buffer~0.offset| .cse6)) 0))))))) .cse12) (or (and (or .cse18 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_41 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_41) (+ |~#buffer~0.offset| .cse6)) 0)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_42 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_42) (+ |~#buffer~0.offset| .cse6)) 0))) .cse17)) .cse7) (or .cse8 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_38 Int)) (let ((.cse20 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_38))) (or (= (select (store .cse20 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) 1) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) 1) (not (= (select .cse20 (+ |~#buffer~0.offset| .cse6)) 0)))))))))) (or (and (or (and (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_36 Int) (|~#buffer~0.offset| Int)) (let ((.cse21 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_36))) (or (= (select (store .cse21 (+ |~#buffer~0.offset| .cse10) 1) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) 1) (not (= (select .cse21 (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0))))) (or .cse4 (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_34 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_34) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0))))) .cse14) (or .cse15 (and (or .cse4 (and (or .cse18 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_32 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_32) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (v_DerPreprocessor_33 Int) (|~#buffer~0.offset| Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_33) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0))) .cse17))) (or .cse18 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_29 Int)) (let ((.cse22 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_29))) (or (not (= (select .cse22 (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0)) (= (select (store .cse22 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) 1) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) 1))))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_28 Int)) (let ((.cse23 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_28))) (or (= (select (store .cse23 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) 1) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) 1) (not (= (select .cse23 (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0))))) .cse17) (or .cse7 (and (or .cse18 (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_30 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_30) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0)))) (or (forall ((v_ArrVal_832 (Array Int Int)) (|~#buffer~0.offset| Int) (v_DerPreprocessor_31 Int)) (not (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_832) |c_~#buffer~0.base|) (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_31) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0))) .cse17)))))) .cse24))) (or .cse25 (and (or .cse26 (and (or .cse1 .cse27) .cse28)) (or .cse29 .cse30)) .cse31) (or .cse1 .cse32 .cse33 (and (or (and (or (and (or (= (select .cse34 .cse35) |c_t1Thread1of1ForFork1_~i~0#1|) .cse12) .cse36 (or .cse8 (= (select .cse34 .cse37) |c_t1Thread1of1ForFork1_~i~0#1|)) .cse38) .cse17) (or .cse18 (and (or .cse8 (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse39 .cse37))) (or (= (select .cse39 .cse35) |c_t1Thread1of1ForFork1_~i~0#1|) .cse12) .cse36 .cse38))) .cse29) (or (let ((.cse42 (or .cse44 .cse45))) (and (or .cse18 (and (or .cse2 (and (or .cse8 (= (select .cse40 .cse37) |c_t1Thread1of1ForFork1_~i~0#1|)) (or (= (select .cse40 .cse35) |c_t1Thread1of1ForFork1_~i~0#1|) .cse12)) .cse41) .cse42)) (or (and (or (and (or (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse35)) .cse12) (or .cse8 (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse37)))) .cse2 .cse41) .cse42) .cse17))) .cse26))) (or .cse1 .cse32 .cse46 (and (or .cse3 (not (= .cse47 |c_t1Thread1of1ForFork1_~i~0#1|))) (or (not (= .cse48 |c_t1Thread1of1ForFork1_~i~0#1|)) .cse24))) (or .cse1 .cse32 .cse46 .cse33) (or .cse0 (let ((.cse50 (<= 1 .cse68))) (and (or (and (or .cse3 (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_7 Int)) (= (select (store (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_7) (+ |~#buffer~0.offset| .cse10) 0) (+ |~#buffer~0.offset| .cse6)) 0))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_8 Int)) (= (select (store (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_8) (+ |~#buffer~0.offset| .cse10) 0) (+ |~#buffer~0.offset| .cse6)) 0)) .cse17))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_4 Int)) (= (select (store (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_4) (+ |~#buffer~0.offset| .cse10) 0) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) 0)) .cse24) .cse50 .cse51) .cse52 .cse53) (or (and (or (let ((.cse54 (< .cse68 1)) (.cse64 (and .cse50 .cse38))) (and (or (and (or .cse54 (and (or .cse3 (and (or (and (or (forall ((v_DerPreprocessor_22 Int) (|~#buffer~0.offset| Int)) (let ((.cse55 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_22))) (or (= (select (store .cse55 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11)) .cse57) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse55 (+ |~#buffer~0.offset| .cse6))))))) .cse18) (or (forall ((v_DerPreprocessor_23 Int) (|~#buffer~0.offset| Int)) (let ((.cse58 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_23))) (or (not (= (select .cse58 (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse58 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11)) .cse57)))) .cse17)) .cse12) (or .cse8 (and (or (forall ((v_DerPreprocessor_24 Int) (|~#buffer~0.offset| Int)) (let ((.cse59 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_24))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse59 (+ |~#buffer~0.offset| .cse6)))) (= (select (store .cse59 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57)))) .cse17) (or .cse18 (forall ((v_DerPreprocessor_25 Int) (|~#buffer~0.offset| Int)) (let ((.cse60 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_25))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse60 (+ |~#buffer~0.offset| .cse6)))) (= (select (store .cse60 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57))))))))) (or (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_26 Int)) (let ((.cse61 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_26))) (or (= .cse57 (select (store .cse61 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296)))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse61 (+ |~#buffer~0.offset| .cse6 (- 4294967296))))))))) (or .cse17 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_27 Int)) (let ((.cse62 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_27))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse62 (+ |~#buffer~0.offset| .cse6 (- 4294967296))))) (= (select (store .cse62 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57)))))) .cse24)) .cse41) (or (and (or .cse3 (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_20 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_20) (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_21 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_21) (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse17))) (or .cse24 (and (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_19 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_19) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse17) (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_18 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_18) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))))) .cse63 .cse64)) .cse15) (or (and (or .cse54 (and (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_9 Int)) (let ((.cse65 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_9))) (or (= (select (store .cse65 (+ |~#buffer~0.offset| .cse10) .cse56) (+ |~#buffer~0.offset| .cse11)) .cse57) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse65 (+ |~#buffer~0.offset| .cse6))))))) .cse12) (or .cse8 (and (or (forall ((v_DerPreprocessor_12 Int) (|~#buffer~0.offset| Int)) (let ((.cse66 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_12))) (or (not (= (select .cse66 (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse57 (select (store .cse66 (+ |~#buffer~0.offset| .cse10) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296))))))) .cse24) (or .cse3 (forall ((v_DerPreprocessor_14 Int) (|~#buffer~0.offset| Int)) (let ((.cse67 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_14))) (or (= (select (store .cse67 (+ |~#buffer~0.offset| .cse10) .cse56) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse67 (+ |~#buffer~0.offset| .cse6))))))))))) .cse41) (or .cse63 .cse64 (and (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_15 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_15) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse24) (or .cse3 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_16 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_16) (+ |~#buffer~0.offset| .cse6))))))))) .cse14))) .cse69) (or .cse70 (and (or .cse3 (and (or (and (or (forall ((v_DerPreprocessor_45 Int) (|~#buffer~0.offset| Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_45) (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse7) (or .cse4 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_49 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_49) (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or .cse8 (forall ((v_DerPreprocessor_47 Int) (|~#buffer~0.offset| Int)) (let ((.cse71 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_47))) (or (= (select (store .cse71 (+ |~#buffer~0.offset| .cse10) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57) (not (= (select .cse71 (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)))))) (or .cse12 (forall ((v_DerPreprocessor_44 Int) (|~#buffer~0.offset| Int)) (let ((.cse73 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_44))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse73 (+ |~#buffer~0.offset| .cse6)))) (= (select (store .cse73 (+ |~#buffer~0.offset| .cse10) .cse72) (+ |~#buffer~0.offset| .cse11)) .cse57)))))) .cse14) (or (and (or (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_37 Int)) (let ((.cse74 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_37))) (or (= (select (store .cse74 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57) (not (= (select .cse74 (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)))))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_38 Int)) (let ((.cse75 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_38))) (or (= (select (store .cse75 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse75 (+ |~#buffer~0.offset| .cse6))))))) .cse17)) .cse8) (or (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_40 Int)) (let ((.cse76 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_40))) (or (not (= (select .cse76 (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse57 (select (store .cse76 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11))))))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_39 Int)) (let ((.cse77 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_39))) (or (= .cse57 (select (store .cse77 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11))) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse77 (+ |~#buffer~0.offset| .cse6))))))) .cse17)) .cse12) (or .cse7 (and (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_42 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_42) (+ |~#buffer~0.offset| .cse6)) |c_t1Thread1of1ForFork1_~i~0#1|))) .cse17) (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_41 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_41) (+ |~#buffer~0.offset| .cse6))))))))) .cse15))) (or (and (or (and (forall ((v_DerPreprocessor_36 Int) (|~#buffer~0.offset| Int)) (let ((.cse78 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_36))) (or (not (= (select .cse78 (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)) (= (select (store .cse78 (+ |~#buffer~0.offset| .cse10) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57)))) (or .cse4 (forall ((v_DerPreprocessor_34 Int) (|~#buffer~0.offset| Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_34) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|))))) .cse14) (or (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_29 Int)) (let ((.cse79 (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_29))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse79 (+ |~#buffer~0.offset| .cse6 (- 4294967296))))) (= (select (store .cse79 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))) .cse57))))) (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_28 Int)) (let ((.cse80 (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_28))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse80 (+ |~#buffer~0.offset| .cse6 (- 4294967296))))) (= .cse57 (select (store .cse80 (+ |~#buffer~0.offset| .cse10 (- 4294967296)) .cse72) (+ |~#buffer~0.offset| .cse11 (- 4294967296))))))) .cse17) (or .cse7 (and (or (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_31 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_31) (+ |~#buffer~0.offset| .cse6 (- 4294967296)))))) .cse17) (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_30 Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_30) (+ |~#buffer~0.offset| .cse6 (- 4294967296))))))))) (or .cse4 (and (or .cse18 (forall ((|~#buffer~0.offset| Int) (v_DerPreprocessor_32 Int)) (not (= (select (store .cse49 (+ |~#buffer~0.offset| .cse5) v_DerPreprocessor_32) (+ |~#buffer~0.offset| .cse6 (- 4294967296))) |c_t1Thread1of1ForFork1_~i~0#1|)))) (or (forall ((v_DerPreprocessor_33 Int) (|~#buffer~0.offset| Int)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select (store .cse49 (+ |~#buffer~0.offset| .cse5 (- 4294967296)) v_DerPreprocessor_33) (+ |~#buffer~0.offset| .cse6 (- 4294967296)))))) .cse17)))) .cse15)) .cse24)))) .cse1 .cse2)))) (or .cse25 (and (or (and (or (and (or (= (select .cse81 .cse82) .cse57) .cse24) (or .cse3 (= (select .cse81 .cse83) .cse57))) .cse1) (or .cse63 .cse52)) .cse69) (or (and (or (= .cse57 (select .cse84 .cse82)) .cse24) .cse36 (or .cse3 (= (select .cse84 .cse83) .cse57)) .cse51) .cse70)) .cse31) (= c_~value~0 1) (or (and (or (and .cse36 (or .cse3 (= (select .cse34 .cse83) |c_t1Thread1of1ForFork1_~i~0#1|)) .cse51 (or (= (select .cse34 .cse82) |c_t1Thread1of1ForFork1_~i~0#1|) .cse24)) .cse17) (or .cse18 .cse30)) .cse29) (or (let ((.cse85 (store .cse49 .cse86 0))) (and (or (= (select .cse85 .cse82) 0) .cse24) .cse36 (or .cse3 (= (select .cse85 .cse83) 0)) .cse51)) .cse25 .cse53) (or (and (or (and (or .cse1 (and (or (= (select .cse43 .cse82) |c_t1Thread1of1ForFork1_~i~0#1|) .cse24) (or .cse3 (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse83)))) .cse2) .cse28) .cse17) (or .cse18 (and (or .cse1 .cse27 .cse2) .cse28))) .cse26) (= |c_t2Thread1of1ForFork0_#t~ret9#1| 1)))))))) is different from false [2023-11-21 20:56:21,790 WARN L293 SmtUtils]: Spent 23.89s on a formula simplification. DAG size of input: 805 DAG size of output: 882 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-21 20:56:47,647 WARN L293 SmtUtils]: Spent 24.85s on a formula simplification. DAG size of input: 805 DAG size of output: 882 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15