./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi --witnessprinter.witness.filename witness.graphml --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 c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-04 12:06:45,032 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-04 12:06:45,039 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-04 12:06:45,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-04 12:06:45,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-04 12:06:45,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-04 12:06:45,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-04 12:06:45,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-04 12:06:45,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-04 12:06:45,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-04 12:06:45,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-04 12:06:45,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-04 12:06:45,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-04 12:06:45,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-04 12:06:45,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-04 12:06:45,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-04 12:06:45,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-04 12:06:45,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-04 12:06:45,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-04 12:06:45,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-04 12:06:45,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-04 12:06:45,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-04 12:06:45,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-04 12:06:45,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-04 12:06:45,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-04 12:06:45,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-04 12:06:45,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-04 12:06:45,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-04 12:06:45,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-04 12:06:45,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-04 12:06:45,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-04 12:06:45,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-04 12:06:45,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-04 12:06:45,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-04 12:06:45,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-04 12:06:45,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-04 12:06:45,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-04 12:06:45,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-04 12:06:45,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-04 12:06:45,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-04 12:06:45,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-04 12:06:45,143 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-11-04 12:06:45,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-04 12:06:45,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-04 12:06:45,182 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-04 12:06:45,182 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-04 12:06:45,183 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-04 12:06:45,184 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-04 12:06:45,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-04 12:06:45,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-04 12:06:45,185 INFO L138 SettingsManager]: * Use SBE=true [2022-11-04 12:06:45,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-04 12:06:45,186 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-04 12:06:45,186 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-04 12:06:45,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-04 12:06:45,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-04 12:06:45,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-04 12:06:45,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-04 12:06:45,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-04 12:06:45,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-04 12:06:45,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-04 12:06:45,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-04 12:06:45,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-04 12:06:45,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-04 12:06:45,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-04 12:06:45,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-04 12:06:45,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-04 12:06:45,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:06:45,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-04 12:06:45,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-04 12:06:45,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-04 12:06:45,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-04 12:06:45,192 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-11-04 12:06:45,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-04 12:06:45,193 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-04 12:06:45,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-04 12:06:45,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-04 12:06:45,193 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-04 12:06:45,194 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-04 12:06:45,194 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> c8af2e9e80aefb6a93651d6c869df13510f679bd9566c8571973545c9393aab5 [2022-11-04 12:06:45,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-04 12:06:45,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-04 12:06:45,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-04 12:06:45,515 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-04 12:06:45,521 INFO L275 PluginConnector]: CDTParser initialized [2022-11-04 12:06:45,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/../../sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-11-04 12:06:45,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/data/ef7fa10f8/d1cffa2c4ec04f2cb3b4ef59f0ee7c3a/FLAG2c34a0ff0 [2022-11-04 12:06:46,307 INFO L306 CDTParser]: Found 1 translation units. [2022-11-04 12:06:46,308 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2022-11-04 12:06:46,329 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/data/ef7fa10f8/d1cffa2c4ec04f2cb3b4ef59f0ee7c3a/FLAG2c34a0ff0 [2022-11-04 12:06:46,516 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/data/ef7fa10f8/d1cffa2c4ec04f2cb3b4ef59f0ee7c3a [2022-11-04 12:06:46,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-04 12:06:46,521 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-04 12:06:46,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-04 12:06:46,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-04 12:06:46,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-04 12:06:46,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:06:46" (1/1) ... [2022-11-04 12:06:46,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23560a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:46, skipping insertion in model container [2022-11-04 12:06:46,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.11 12:06:46" (1/1) ... [2022-11-04 12:06:46,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-04 12:06:46,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-04 12:06:47,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-11-04 12:06:47,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:06:47,330 INFO L203 MainTranslator]: Completed pre-run [2022-11-04 12:06:47,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/sv-benchmarks/c/goblint-regression/28-race_reach_73-funloop_hard_racefree.i[41323,41336] [2022-11-04 12:06:47,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-04 12:06:47,478 INFO L208 MainTranslator]: Completed translation [2022-11-04 12:06:47,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47 WrapperNode [2022-11-04 12:06:47,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-04 12:06:47,480 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-04 12:06:47,480 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-04 12:06:47,480 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-04 12:06:47,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,514 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,570 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 247 [2022-11-04 12:06:47,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-04 12:06:47,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-04 12:06:47,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-04 12:06:47,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-04 12:06:47,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,653 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-04 12:06:47,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-04 12:06:47,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-04 12:06:47,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-04 12:06:47,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (1/1) ... [2022-11-04 12:06:47,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-04 12:06:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:47,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-04 12:06:47,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-04 12:06:47,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-04 12:06:47,752 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-04 12:06:47,752 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-04 12:06:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-04 12:06:47,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-04 12:06:47,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-04 12:06:47,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-04 12:06:48,015 INFO L235 CfgBuilder]: Building ICFG [2022-11-04 12:06:48,029 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-04 12:06:48,477 INFO L276 CfgBuilder]: Performing block encoding [2022-11-04 12:06:48,486 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-04 12:06:48,486 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-04 12:06:48,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:06:48 BoogieIcfgContainer [2022-11-04 12:06:48,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-04 12:06:48,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-04 12:06:48,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-04 12:06:48,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-04 12:06:48,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.11 12:06:46" (1/3) ... [2022-11-04 12:06:48,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23474ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:06:48, skipping insertion in model container [2022-11-04 12:06:48,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.11 12:06:47" (2/3) ... [2022-11-04 12:06:48,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23474ab4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.11 12:06:48, skipping insertion in model container [2022-11-04 12:06:48,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.11 12:06:48" (3/3) ... [2022-11-04 12:06:48,499 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2022-11-04 12:06:48,508 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-04 12:06:48,519 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-04 12:06:48,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-11-04 12:06:48,520 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-04 12:06:48,639 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-04 12:06:48,691 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-04 12:06:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:48,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-04 12:06:48,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-04 12:06:48,740 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-04 12:06:48,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-04 12:06:48,763 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=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@265a9865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-04 12:06:48,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-04 12:06:49,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1531783902, now seen corresponding path program 1 times [2022-11-04 12:06:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:49,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598579219] [2022-11-04 12:06:49,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-04 12:06:49,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:49,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598579219] [2022-11-04 12:06:49,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598579219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:49,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:49,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-04 12:06:49,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499149561] [2022-11-04 12:06:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:49,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-04 12:06:49,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-04 12:06:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-04 12:06:49,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:49,781 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:49,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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) [2022-11-04 12:06:49,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:49,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-04 12:06:49,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:49,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash -246841348, now seen corresponding path program 1 times [2022-11-04 12:06:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:49,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343887234] [2022-11-04 12:06:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:49,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-04 12:06:50,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:50,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343887234] [2022-11-04 12:06:50,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343887234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:50,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-04 12:06:50,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-04 12:06:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316099407] [2022-11-04 12:06:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:06:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:06:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-04 12:06:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:50,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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) [2022-11-04 12:06:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-04 12:06:50,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:50,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash 212003452, now seen corresponding path program 1 times [2022-11-04 12:06:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27590966] [2022-11-04 12:06:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-11-04 12:06:50,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:50,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27590966] [2022-11-04 12:06:50,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27590966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:50,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629693935] [2022-11-04 12:06:50,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:50,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:50,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:50,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-04 12:06:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:50,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-04 12:06:50,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-04 12:06:50,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-04 12:06:50,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629693935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:50,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-04 12:06:50,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-04 12:06:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878764142] [2022-11-04 12:06:50,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:50,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:06:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:06:50,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:06:50,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:50,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2022-11-04 12:06:50,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:50,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:51,210 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1609328110, now seen corresponding path program 1 times [2022-11-04 12:06:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:51,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582118737] [2022-11-04 12:06:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:51,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:51,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582118737] [2022-11-04 12:06:51,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582118737] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:51,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400427924] [2022-11-04 12:06:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:51,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:51,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:51,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-04 12:06:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:51,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-04 12:06:51,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-04 12:06:51,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-04 12:06:51,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400427924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-04 12:06:51,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-04 12:06:51,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-04 12:06:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589220571] [2022-11-04 12:06:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-04 12:06:51,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-04 12:06:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-04 12:06:51,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-04 12:06:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:51,788 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:51,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 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) [2022-11-04 12:06:51,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:51,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:51,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:51,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-04 12:06:52,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:52,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash 357909982, now seen corresponding path program 1 times [2022-11-04 12:06:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:52,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408667602] [2022-11-04 12:06:52,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:52,294 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:52,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:52,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408667602] [2022-11-04 12:06:52,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408667602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:52,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323439696] [2022-11-04 12:06:52,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:52,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:52,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:52,297 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:52,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-04 12:06:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:52,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-04 12:06:52,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:52,558 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:52,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:52,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323439696] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:06:52,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:06:52,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-04 12:06:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458922364] [2022-11-04 12:06:52,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:06:52,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-04 12:06:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:52,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-04 12:06:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-04 12:06:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:52,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:52,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.3) internal successors, (173), 10 states have internal predecessors, (173), 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) [2022-11-04 12:06:52,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:52,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:52,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:52,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:52,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:52,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:52,924 INFO L85 PathProgramCache]: Analyzing trace with hash 621008350, now seen corresponding path program 2 times [2022-11-04 12:06:52,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:52,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860616683] [2022-11-04 12:06:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:52,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-11-04 12:06:53,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860616683] [2022-11-04 12:06:53,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860616683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:53,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054700799] [2022-11-04 12:06:53,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:06:53,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:53,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:53,229 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:53,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-04 12:06:53,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:06:53,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:06:53,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-04 12:06:53,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:53,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:53,728 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-11-04 12:06:53,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054700799] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:06:53,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:06:53,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-11-04 12:06:53,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971439787] [2022-11-04 12:06:53,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:06:53,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-04 12:06:53,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:53,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-04 12:06:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-11-04 12:06:53,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:53,731 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:53,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 11.526315789473685) internal successors, (219), 19 states have internal predecessors, (219), 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) [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:53,732 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:54,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:54,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:06:54,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:54,247 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:54,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1712114066, now seen corresponding path program 1 times [2022-11-04 12:06:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831599511] [2022-11-04 12:06:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:54,595 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:06:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:54,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831599511] [2022-11-04 12:06:54,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831599511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:54,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855715277] [2022-11-04 12:06:54,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:54,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:54,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:54,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-04 12:06:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:54,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-04 12:06:54,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:06:54,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-04 12:06:55,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855715277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:06:55,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:06:55,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-04 12:06:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516365041] [2022-11-04 12:06:55,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:06:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-04 12:06:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:06:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-04 12:06:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-04 12:06:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:55,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:06:55,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.869565217391305) internal successors, (112), 23 states have internal predecessors, (112), 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) [2022-11-04 12:06:55,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:55,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:55,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:06:55,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:06:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:06:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:06:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:06:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:06:55,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-04 12:06:55,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:55,707 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:06:55,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:06:55,708 INFO L85 PathProgramCache]: Analyzing trace with hash 848425198, now seen corresponding path program 2 times [2022-11-04 12:06:55,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:06:55,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813147541] [2022-11-04 12:06:55,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:06:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:06:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:06:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:06:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:06:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813147541] [2022-11-04 12:06:56,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813147541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:06:56,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098018885] [2022-11-04 12:06:56,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-04 12:06:56,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:06:56,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:06:56,686 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:06:56,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-04 12:06:56,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-04 12:06:56,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-04 12:06:56,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-04 12:06:56,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:06:56,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-11-04 12:06:57,325 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:06:57,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:06:57,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:06:57,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:06:57,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-11-04 12:06:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:06:57,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:06:59,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_907) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:06:59,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_907) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:06:59,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_907 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_907) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:07:00,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-04 12:07:00,550 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:07:00,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:07:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 5 not checked. [2022-11-04 12:07:00,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098018885] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:07:00,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:07:00,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 29 [2022-11-04 12:07:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790801828] [2022-11-04 12:07:00,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:07:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-04 12:07:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:07:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-04 12:07:00,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=562, Unknown=4, NotChecked=150, Total=812 [2022-11-04 12:07:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:00,568 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:07:00,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 6.0344827586206895) internal successors, (175), 29 states have internal predecessors, (175), 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) [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:07:00,569 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:07:00,570 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:12,815 WARN L234 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 37 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:07:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:07:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:07:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:07:15,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:07:15,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-04 12:07:15,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-04 12:07:15,214 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:07:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:07:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash 489511099, now seen corresponding path program 1 times [2022-11-04 12:07:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:07:15,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926431725] [2022-11-04 12:07:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:07:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:07:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:07:19,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:07:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926431725] [2022-11-04 12:07:19,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926431725] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:07:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535737996] [2022-11-04 12:07:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:07:19,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:07:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:07:19,304 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:07:19,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-04 12:07:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:07:19,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-04 12:07:19,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:07:19,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-11-04 12:07:19,933 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:07:19,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:07:20,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:07:20,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:07:20,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-11-04 12:07:20,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 25 [2022-11-04 12:07:20,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-04 12:07:20,933 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:07:20,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:07:23,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) is different from false [2022-11-04 12:07:25,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) is different from false [2022-11-04 12:07:27,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) is different from false [2022-11-04 12:07:29,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) is different from false [2022-11-04 12:07:30,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) is different from false [2022-11-04 12:07:30,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1004) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-11-04 12:07:30,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-04 12:07:30,762 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:07:30,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:07:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 239 trivial. 8 not checked. [2022-11-04 12:07:30,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535737996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:07:30,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:07:30,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17] total 50 [2022-11-04 12:07:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667683587] [2022-11-04 12:07:30,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:07:30,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-04 12:07:30,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:07:30,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-04 12:07:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1712, Unknown=7, NotChecked=534, Total=2450 [2022-11-04 12:07:30,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:30,776 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:07:30,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.46) internal successors, (273), 50 states have internal predecessors, (273), 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) [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:07:30,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:04,711 WARN L234 SmtUtils]: Spent 27.96s on a formula simplification. DAG size of input: 66 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:08:05,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse1 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse1))) (let ((.cse2 (store .cse5 .cse4 0))) (let ((.cse3 (@diff .cse2 .cse1))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= .cse1 (store .cse2 .cse3 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse1 .cse2) (<= .cse3 4)) (or (<= .cse4 4) (= .cse1 .cse5)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:08:05,903 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse0))) (let ((.cse1 (store .cse5 .cse4 0))) (let ((.cse2 (@diff .cse1 .cse0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= .cse0 (store .cse1 .cse2 0)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse1) (<= .cse2 4)) (or (<= .cse4 4) (= .cse0 .cse5)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:08:06,637 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse5 (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse5 .cse0))) (let ((.cse2 (store .cse5 .cse4 0))) (let ((.cse3 (@diff .cse2 .cse0))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (= .cse0 (store .cse2 .cse3 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (= .cse0 .cse2) (<= .cse3 4)) (or (<= .cse4 4) (= .cse0 .cse5)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (= |c_~#cache~0.base| 4))))))) is different from false [2022-11-04 12:08:15,694 WARN L234 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 34 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:08:16,061 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse1 ((as const (Array Int Int)) 0))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= |c_~#cache~0.base| 4)) is different from false [2022-11-04 12:08:16,416 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= |c_~#cache~0.base| 4))) is different from false [2022-11-04 12:08:16,781 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= (let ((.cse0 ((as const (Array Int Int)) 0))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))) (select |c_#memory_int| |c_~#cache~0.base|)) (= (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_48|) 0)) (= |c_~#cache~0.base| 4))) is different from false [2022-11-04 12:08:23,715 WARN L234 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 32 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:08:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:08:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:08:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:08:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:08:24,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:08:24,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-04 12:08:24,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:08:24,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:08:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:08:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1072308505, now seen corresponding path program 1 times [2022-11-04 12:08:24,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:08:24,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726466043] [2022-11-04 12:08:24,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:08:24,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:08:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:08:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 7 proven. 100 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:08:42,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-04 12:08:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726466043] [2022-11-04 12:08:42,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726466043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-04 12:08:42,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105524919] [2022-11-04 12:08:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:08:42,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-04 12:08:42,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 [2022-11-04 12:08:42,891 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-04 12:08:42,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-04 12:08:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-04 12:08:43,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-04 12:08:43,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-04 12:08:43,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 6 [2022-11-04 12:08:43,563 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-04 12:08:43,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-04 12:08:43,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:08:43,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 15 [2022-11-04 12:08:44,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-04 12:08:44,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 16 [2022-11-04 12:09:12,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-04 12:09:22,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 19 [2022-11-04 12:12:23,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 16 [2022-11-04 12:12:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 13 proven. 62 refuted. 32 times theorem prover too weak. 235 trivial. 0 not checked. [2022-11-04 12:12:23,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-04 12:12:28,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2022-11-04 12:12:30,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-11-04 12:12:32,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2022-11-04 12:12:34,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-11-04 12:12:36,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) is different from false [2022-11-04 12:12:38,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-11-04 12:12:39,563 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse0 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) is different from false [2022-11-04 12:12:41,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_41|)))) is different from false [2022-11-04 12:12:43,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) is different from false [2022-11-04 12:12:45,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) is different from false [2022-11-04 12:12:46,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1153 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1153))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) is different from false [2022-11-04 12:12:46,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1153 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1153))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| v_ArrVal_1157))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse1)) (< (+ |c_~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)))) is different from false [2022-11-04 12:12:46,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (v_ArrVal_1153 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| 84)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1153) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| v_ArrVal_1157) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|)))) is different from false [2022-11-04 12:12:47,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:12:47,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-04 12:12:47,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-04 12:12:47,992 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-04 12:12:47,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-04 12:12:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 107 not checked. [2022-11-04 12:12:47,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105524919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-04 12:12:47,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-04 12:12:47,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 24] total 70 [2022-11-04 12:12:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288262192] [2022-11-04 12:12:47,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-04 12:12:48,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-04 12:12:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-04 12:12:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-04 12:12:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2816, Unknown=140, NotChecked=1586, Total=4830 [2022-11-04 12:12:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:12:48,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-04 12:12:48,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 6.571428571428571) internal successors, (460), 70 states have internal predecessors, (460), 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) [2022-11-04 12:12:48,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:12:48,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:12:48,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:15:30,197 WARN L234 SmtUtils]: Spent 42.77s on a formula simplification. DAG size of input: 160 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:16:12,741 WARN L234 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 71 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:16:43,425 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse14 (store .cse1 .cse2 0))) (let ((.cse15 (@diff .cse14 .cse0))) (let ((.cse9 (store .cse14 .cse15 0))) (let ((.cse16 (@diff .cse5 .cse0)) (.cse10 (@diff .cse9 .cse0))) (let ((.cse12 (store .cse9 .cse10 0)) (.cse7 (store .cse5 .cse16 0)) (.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse6 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse11 (+ .cse3 |c_~#cache~0.offset|)) (.cse8 (@diff .cse7 .cse0)) (.cse13 (@diff .cse12 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 24) .cse3)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse4)) (< (+ |c_~#cache~0.offset| .cse4) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_1154 Int)) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1154) .cse6)) (or (= .cse0 .cse7) (<= .cse8 4)) (or (= .cse0 .cse9) (<= (+ .cse10 24) .cse3)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse11) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (and (= .cse6 (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1159)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse11))) (or (= .cse0 .cse12) (<= (+ .cse13 24) .cse3)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse0 (store .cse7 .cse8 0)) (= .cse0 (store .cse12 .cse13 0)) (or (= .cse0 .cse14) (<= (+ .cse15 24) .cse3)) (or (= .cse0 .cse5) (<= .cse16 4)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:16:44,579 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse15 (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse5 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse15 .cse5))) (let ((.cse14 (store .cse15 .cse1 0))) (let ((.cse13 (@diff .cse14 .cse5))) (let ((.cse16 (store .cse14 .cse13 0))) (let ((.cse8 (@diff .cse16 .cse5))) (let ((.cse10 (store .cse16 .cse8 0)) (.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse7 (= .cse5 .cse16)) (.cse6 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse9 (+ .cse2 |c_~#cache~0.offset|)) (.cse11 (@diff .cse10 .cse5)) (.cse0 (= .cse5 .cse15)) (.cse12 (= .cse5 .cse14))) (and (or .cse0 (<= (+ .cse1 24) .cse2)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1157 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse3)) (< (+ |c_~#cache~0.offset| .cse3) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (exists ((v_ArrVal_1154 Int)) (= (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1154) .cse6)) .cse7 (or .cse7 (<= (+ .cse8 24) .cse2)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (and (= .cse6 (store (store .cse5 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1159)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse9))) (or (= .cse5 .cse10) (<= (+ .cse11 24) .cse2)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse12 (<= .cse13 4)) (= .cse5 (store .cse10 .cse11 0)) (or (<= .cse1 4) .cse0) (or .cse12 (<= (+ .cse13 24) .cse2)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:16:45,895 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse14 .cse7))) (let ((.cse13 (store .cse14 .cse1 0))) (let ((.cse11 (@diff .cse13 .cse7))) (let ((.cse15 (store .cse13 .cse11 0))) (let ((.cse4 (@diff .cse15 .cse7))) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse8 (store .cse15 .cse4 0))) (let ((.cse3 (= .cse7 .cse15)) (.cse9 (@diff .cse8 .cse7)) (.cse0 (= .cse7 .cse14)) (.cse10 (= .cse7 .cse13)) (.cse5 (+ .cse2 |c_~#cache~0.offset|)) (.cse6 (select |c_#memory_int| |c_~#cache~0.base|))) (and (or .cse0 (<= (+ .cse1 24) .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 (or .cse3 (<= (+ .cse4 24) .cse2)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse5) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (= .cse6 (store .cse7 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse5))) (= |c_~#cache~0.offset| 0) (or (= .cse7 .cse8) (<= (+ .cse9 24) .cse2)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse10 (<= .cse11 4)) (= .cse7 (store .cse8 .cse9 0)) (or (<= .cse1 4) .cse0) (or .cse10 (<= (+ .cse11 24) .cse2)) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse5) (= .cse6 (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse5))) (= |c_~#cache~0.base| 4) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse12 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse12)) (< (+ |c_~#cache~0.offset| .cse12) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store .cse6 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))))))))))))) is different from false [2022-11-04 12:16:47,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse6 .cse3))) (let ((.cse16 (store .cse6 .cse0 0))) (let ((.cse14 (@diff .cse16 .cse3))) (let ((.cse17 (store .cse16 .cse14 0))) (let ((.cse12 (@diff .cse17 .cse3))) (let ((.cse18 (store .cse17 .cse12 0))) (let ((.cse9 (@diff .cse18 .cse3))) (let ((.cse19 (store .cse18 .cse9 0))) (let ((.cse8 (@diff .cse19 .cse3))) (let ((.cse4 (store .cse19 .cse8 0))) (let ((.cse5 (@diff .cse4 .cse3)) (.cse7 (= .cse3 .cse19)) (.cse10 (= .cse3 .cse18)) (.cse11 (= .cse3 .cse17)) (.cse2 (= .cse3 .cse6)) (.cse13 (= .cse3 .cse16)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (and (or (<= .cse0 .cse1) .cse2) (= .cse3 (store .cse4 .cse5 0)) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (= .cse6 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse7 (<= .cse8 .cse1)) (or (= .cse3 .cse4) (<= .cse5 .cse1)) (or (<= .cse9 .cse1) .cse10) (or .cse11 (<= .cse12 .cse1)) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse1) (= .cse6 (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1))) (= |c_~#cache~0.base| 4) (or (and (or .cse13 (<= .cse14 4)) .cse7 (or (<= .cse9 4) .cse10) (or (<= .cse12 4) .cse11) (<= .cse0 4)) .cse2) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse15 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse15)) (< (+ |c_~#cache~0.offset| .cse15) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store .cse6 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) (or .cse13 (<= .cse14 .cse1))))))))))))))) is different from false [2022-11-04 12:16:49,506 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 ((as const (Array Int Int)) 0))) (let ((.cse1 (@diff .cse2 .cse3))) (let ((.cse22 (store .cse2 .cse1 0))) (let ((.cse6 (@diff .cse22 .cse3))) (let ((.cse21 (store .cse22 .cse6 0))) (let ((.cse20 (@diff .cse21 .cse3))) (let ((.cse23 (store .cse21 .cse20 0))) (let ((.cse9 (@diff .cse23 .cse3))) (let ((.cse19 (store .cse23 .cse9 0))) (let ((.cse10 (= .cse3 .cse23)) (.cse8 (= .cse3 .cse19)) (.cse5 (= .cse3 .cse22)) (.cse0 (= .cse3 .cse2)) (.cse4 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse14 (= .cse3 .cse21))) (and (or .cse0 (<= .cse1 4)) (= |c_t_funThread1of1ForFork0_#t~post41#1| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (= .cse2 (store .cse3 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4))) (or .cse5 (<= .cse6 4)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (let ((.cse7 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 |c_~#cache~0.offset| .cse7)) (< (+ |c_~#cache~0.offset| .cse7) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_41|)))) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse4) (= .cse2 (store (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse4))) .cse8 (or (<= .cse9 4) .cse10) (= |c_~#cache~0.offset| 0) (let ((.cse15 (<= .cse1 .cse4)) (.cse13 (<= .cse20 .cse4)) (.cse11 (<= .cse9 .cse4)) (.cse12 (<= .cse6 .cse4))) (or (and (or .cse11 .cse10) .cse8 (or .cse5 .cse12) (or .cse13 .cse14) (or .cse15 .cse0)) (let ((.cse18 (@diff .cse19 .cse3))) (let ((.cse16 (store .cse19 .cse18 0))) (let ((.cse17 (@diff .cse16 .cse3))) (and (or (= .cse3 .cse16) (<= .cse17 .cse4)) .cse15 .cse13 (<= .cse18 .cse4) (= .cse3 (store .cse16 .cse17 0)) .cse11 .cse12)))))) (or (<= .cse20 4) .cse14) (= |c_~#cache~0.base| 4)))))))))))) is different from false [2022-11-04 12:16:51,152 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse17 ((as const (Array Int Int)) 0))) (let ((.cse4 (@diff .cse2 .cse17))) (let ((.cse23 (store .cse2 .cse4 0))) (let ((.cse10 (@diff .cse23 .cse17))) (let ((.cse22 (store .cse23 .cse10 0))) (let ((.cse8 (@diff .cse22 .cse17))) (let ((.cse21 (store .cse22 .cse8 0))) (let ((.cse6 (@diff .cse21 .cse17))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse20 (store .cse21 .cse6 0))) (let ((.cse9 (= .cse17 .cse20)) (.cse11 (= .cse17 .cse23)) (.cse7 (= .cse17 .cse22)) (.cse5 (= .cse17 .cse21)) (.cse3 (= .cse17 .cse2)) (.cse1 (+ .cse0 |c_~#cache~0.offset|))) (and (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse0 |c_~#cache~0.offset|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58|) (= (select (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (or .cse3 (and (<= (+ .cse4 24) .cse0) (or .cse5 (<= (+ .cse6 24) .cse0)) (or .cse7 (<= (+ .cse8 24) .cse0)) .cse9 (or (<= (+ .cse10 24) .cse0) .cse11))) (let ((.cse13 (<= (+ .cse8 28) .cse1)) (.cse14 (<= (+ .cse6 28) .cse1)) (.cse15 (<= (+ 28 .cse4) .cse1)) (.cse12 (<= (+ .cse10 28) .cse1))) (or (and .cse9 (or .cse11 .cse12) (or .cse13 .cse7) (or .cse14 .cse5) (or .cse3 .cse15)) (let ((.cse16 (@diff .cse20 .cse17))) (let ((.cse18 (store .cse20 .cse16 0))) (let ((.cse19 (@diff .cse18 .cse17))) (and (<= (+ .cse16 28) .cse1) .cse13 .cse14 (= .cse17 (store .cse18 .cse19 0)) (or (= .cse17 .cse18) (<= (+ .cse19 28) .cse1)) .cse15 .cse12)))))) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= .cse2 (store (store .cse17 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse1))) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= .cse2 (store .cse17 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)))) (= |c_~#cache~0.base| 4)))))))))))) is different from false [2022-11-04 12:16:53,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse0 (@diff .cse3 .cse2))) (let ((.cse24 (store .cse3 .cse0 0))) (let ((.cse23 (@diff .cse24 .cse2))) (let ((.cse25 (store .cse24 .cse23 0))) (let ((.cse26 (@diff .cse25 .cse2))) (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (store .cse25 .cse26 0))) (let ((.cse5 (@diff .cse4 .cse2)) (.cse6 (+ .cse1 |c_~#cache~0.offset|)) (.cse14 (select |c_#memory_int| |c_~#cache~0.base|))) (and (or (<= (+ .cse0 24) .cse1) (= .cse2 .cse3)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= .cse2 (store .cse4 .cse5 0)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse6) (or (<= (+ .cse5 24) .cse1) (= .cse4 .cse2)) (let ((.cse21 (@diff .cse14 .cse2))) (let ((.cse8 (store .cse14 .cse21 0))) (let ((.cse20 (@diff .cse8 .cse2))) (let ((.cse11 (store .cse8 .cse20 0))) (let ((.cse22 (@diff .cse11 .cse2))) (let ((.cse13 (store .cse11 .cse22 0))) (let ((.cse19 (@diff .cse13 .cse2))) (let ((.cse10 (<= (+ .cse22 28) .cse6)) (.cse12 (<= (+ .cse19 28) .cse6)) (.cse15 (<= (+ 28 .cse21) .cse6)) (.cse9 (<= (+ .cse20 28) .cse6)) (.cse7 (store .cse13 .cse19 0))) (or (and (= .cse2 .cse7) (or (= .cse2 .cse8) .cse9) (or .cse10 (= .cse2 .cse11)) (or .cse12 (= .cse2 .cse13)) (or (= .cse2 .cse14) .cse15)) (let ((.cse16 (@diff .cse7 .cse2))) (let ((.cse17 (store .cse7 .cse16 0))) (let ((.cse18 (@diff .cse17 .cse2))) (and (<= (+ .cse16 28) .cse6) .cse10 .cse12 (= .cse2 (store .cse17 .cse18 0)) (or (= .cse2 .cse17) (<= (+ .cse18 28) .cse6)) .cse15 .cse9))))))))))))) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse14 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6))) (= |c_~#cache~0.offset| 0) (or (<= (+ .cse23 24) .cse1) (= .cse2 .cse24)) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse1 |c_~#cache~0.offset|)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse3 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse14 (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)))) (= |c_~#cache~0.base| 4) (or (= .cse25 .cse2) (<= (+ .cse26 24) .cse1))))))))))) is different from false [2022-11-04 12:16:55,227 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse12 (+ .cse19 |c_~#cache~0.offset|)) (.cse9 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse20 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse1 ((as const (Array Int Int)) 0))) (and .cse0 (let ((.cse17 (@diff .cse9 .cse1))) (let ((.cse3 (store .cse9 .cse17 0))) (let ((.cse16 (@diff .cse3 .cse1))) (let ((.cse6 (store .cse3 .cse16 0))) (let ((.cse18 (@diff .cse6 .cse1))) (let ((.cse8 (store .cse6 .cse18 0))) (let ((.cse15 (@diff .cse8 .cse1))) (let ((.cse5 (<= (+ .cse18 28) .cse12)) (.cse7 (<= (+ .cse15 28) .cse12)) (.cse10 (<= (+ 28 .cse17) .cse12)) (.cse4 (<= (+ .cse16 28) .cse12)) (.cse2 (store .cse8 .cse15 0))) (or (and (= .cse1 .cse2) (or (= .cse1 .cse3) .cse4) (or .cse5 (= .cse1 .cse6)) (or .cse7 (= .cse1 .cse8)) (or (= .cse1 .cse9) .cse10)) (let ((.cse11 (@diff .cse2 .cse1))) (let ((.cse13 (store .cse2 .cse11 0))) (let ((.cse14 (@diff .cse13 .cse1))) (and (<= (+ .cse11 28) .cse12) .cse5 .cse7 (= .cse1 (store .cse13 .cse14 0)) (or (= .cse1 .cse13) (<= (+ .cse14 28) .cse12)) .cse10 .cse4))))))))))))) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1157 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse12) (= .cse9 (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse12))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse12) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse12) (= .cse9 (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157)))) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse19 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.base| 4) (or (and .cse0 (= .cse1 .cse20)) (let ((.cse23 (@diff .cse20 .cse1))) (let ((.cse24 (store .cse20 .cse23 0))) (let ((.cse25 (@diff .cse24 .cse1))) (let ((.cse27 (store .cse24 .cse25 0))) (let ((.cse26 (@diff .cse27 .cse1))) (let ((.cse21 (store .cse27 .cse26 0))) (let ((.cse22 (@diff .cse21 .cse1))) (and .cse0 (= .cse1 (store .cse21 .cse22 0)) (<= (+ .cse23 24) .cse19) (or (= .cse1 .cse24) (<= (+ .cse25 24) .cse19)) (or (<= (+ .cse22 24) .cse19) (= .cse1 .cse21)) (or (<= (+ .cse26 24) .cse19) (= .cse1 .cse27)))))))))))))) is different from false [2022-11-04 12:16:56,199 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse1 (+ .cse3 |c_~#cache~0.offset|)) (.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 ((as const (Array Int Int)) 0))) (and .cse0 (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse1) (= (select |c_#memory_int| |c_~#cache~0.base|) (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157)))) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse3 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= |c_~#cache~0.base| 4) (or (and .cse0 (= .cse2 .cse4)) (let ((.cse7 (@diff .cse4 .cse2))) (let ((.cse8 (store .cse4 .cse7 0))) (let ((.cse9 (@diff .cse8 .cse2))) (let ((.cse11 (store .cse8 .cse9 0))) (let ((.cse10 (@diff .cse11 .cse2))) (let ((.cse5 (store .cse11 .cse10 0))) (let ((.cse6 (@diff .cse5 .cse2))) (and .cse0 (= .cse2 (store .cse5 .cse6 0)) (<= (+ .cse7 24) .cse3) (or (= .cse2 .cse8) (<= (+ .cse9 24) .cse3)) (or (<= (+ .cse6 24) .cse3) (= .cse2 .cse5)) (or (<= (+ .cse10 24) .cse3) (= .cse2 .cse11)))))))))))))) is different from false [2022-11-04 12:17:18,372 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse10 (store .cse1 .cse2 0))) (let ((.cse11 (@diff .cse10 .cse0))) (let ((.cse4 (store .cse10 .cse11 0))) (let ((.cse5 (@diff .cse4 .cse0))) (let ((.cse7 (store .cse4 .cse5 0)) (.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse6 (+ .cse3 |c_~#cache~0.offset|)) (.cse8 (@diff .cse7 .cse0))) (and (or (= .cse0 .cse1) (<= (+ .cse2 24) .cse3)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (or (= .cse0 .cse4) (<= (+ .cse5 24) .cse3)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1157 Int) (v_ArrVal_1159 Int)) (and (= (select |c_#memory_int| |c_~#cache~0.base|) (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1157) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1159)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse6))) (or (= .cse0 .cse7) (<= (+ .cse8 24) .cse3)) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ 56 .cse3 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse9 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0))) (= .cse0 (store .cse7 .cse8 0)) (or (= .cse0 .cse10) (<= (+ .cse11 24) .cse3)) (= |c_~#cache~0.base| 4))))))))))) is different from false [2022-11-04 12:19:41,587 WARN L234 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 111 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-04 12:20:50,119 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int)) (or (= (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 0) (not (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|)))) (let ((.cse8 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse16 (@diff .cse8 .cse0))) (let ((.cse2 (store .cse8 .cse16 0))) (let ((.cse15 (@diff .cse2 .cse0))) (let ((.cse5 (store .cse2 .cse15 0))) (let ((.cse17 (@diff .cse5 .cse0))) (let ((.cse7 (store .cse5 .cse17 0))) (let ((.cse14 (@diff .cse7 .cse0)) (.cse11 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse4 (<= (+ .cse17 28) .cse11)) (.cse6 (<= (+ .cse14 28) .cse11)) (.cse9 (<= (+ 28 .cse16) .cse11)) (.cse3 (<= (+ .cse15 28) .cse11)) (.cse1 (store .cse7 .cse14 0))) (or (and (= .cse0 .cse1) (or (= .cse0 .cse2) .cse3) (or .cse4 (= .cse0 .cse5)) (or .cse6 (= .cse0 .cse7)) (or (= .cse0 .cse8) .cse9)) (let ((.cse10 (@diff .cse1 .cse0))) (let ((.cse12 (store .cse1 .cse10 0))) (let ((.cse13 (@diff .cse12 .cse0))) (and (<= (+ .cse10 28) .cse11) .cse4 .cse6 (= .cse0 (store .cse12 .cse13 0)) (or (= .cse0 .cse12) (<= (+ .cse13 28) .cse11)) .cse9 .cse3)))))))))))))) (= |c_~#cache~0.offset| 0)) is different from false [2022-11-04 12:20:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-04 12:20:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:20:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:20:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-04 12:20:50,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-04 12:20:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-04 12:20:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-04 12:20:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-04 12:20:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-04 12:20:50,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-04 12:20:50,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-04 12:20:51,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8ee22545-accb-49bb-b49c-d524111155ff/bin/ugemcutter-C1kR7RIaUi/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-04 12:20:51,028 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-04 12:20:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-04 12:20:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 519354113, now seen corresponding path program 2 times [2022-11-04 12:20:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-04 12:20:51,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052064026] [2022-11-04 12:20:51,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-04 12:20:51,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-04 12:20:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat