./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w --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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- 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-2329fc7 [2022-12-13 07:03:06,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:03:06,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:03:06,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:03:06,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:03:06,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:03:06,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:03:06,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:03:06,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:03:06,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:03:06,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:03:06,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:03:06,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:03:06,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:03:06,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:03:06,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:03:06,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:03:06,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:03:06,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:03:06,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:03:06,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:03:06,408 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:03:06,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:03:06,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:03:06,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:03:06,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:03:06,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:03:06,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:03:06,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:03:06,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:03:06,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:03:06,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:03:06,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:03:06,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:03:06,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:03:06,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:03:06,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:03:06,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:03:06,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:03:06,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:03:06,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:03:06,432 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/config/svcomp-Reach-32bit-GemCutter_Default.epf [2022-12-13 07:03:06,460 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:03:06,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:03:06,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 07:03:06,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 07:03:06,461 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 07:03:06,461 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 07:03:06,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:03:06,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:03:06,462 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:03:06,462 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:03:06,462 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:03:06,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:03:06,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:03:06,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:03:06,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:03:06,464 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-13 07:03:06,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-12-13 07:03:06,465 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 07:03:06,465 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-12-13 07:03:06,465 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-12-13 07:03:06,465 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_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/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_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-12-13 07:03:06,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:03:06,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:03:06,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:03:06,647 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:03:06,647 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:03:06,649 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-12-13 07:03:09,261 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:03:09,424 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:03:09,424 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-12-13 07:03:09,434 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/data/482507937/51efd5d09ee64dd4b0c923f544402be5/FLAG7d9f2ed5a [2022-12-13 07:03:09,445 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/data/482507937/51efd5d09ee64dd4b0c923f544402be5 [2022-12-13 07:03:09,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:03:09,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 07:03:09,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:03:09,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:03:09,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:03:09,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:03:09" (1/1) ... [2022-12-13 07:03:09,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff6972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:09, skipping insertion in model container [2022-12-13 07:03:09,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:03:09" (1/1) ... [2022-12-13 07:03:09,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:03:09,490 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:03:09,854 WARN L237 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_50655415-7a28-46a8-97c0-6a57def7d99c/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-12-13 07:03:09,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:03:09,888 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:03:09,926 WARN L237 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_50655415-7a28-46a8-97c0-6a57def7d99c/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-12-13 07:03:09,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:03:10,003 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:03:10,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10 WrapperNode [2022-12-13 07:03:10,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:03:10,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:03:10,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:03:10,005 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:03:10,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,041 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-12-13 07:03:10,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:03:10,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:03:10,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:03:10,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:03:10,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:03:10,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:03:10,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:03:10,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:03:10,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (1/1) ... [2022-12-13 07:03:10,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:03:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:10,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:03:10,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:03:10,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-12-13 07:03:10,125 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:03:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:03:10,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:03:10,127 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 07:03:10,240 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 07:03:10,242 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:03:10,450 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 07:03:10,458 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:03:10,459 INFO L300 CfgBuilder]: Removed 25 assume(true) statements. [2022-12-13 07:03:10,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:03:10 BoogieIcfgContainer [2022-12-13 07:03:10,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:03:10,464 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:03:10,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:03:10,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:03:10,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:03:09" (1/3) ... [2022-12-13 07:03:10,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8801383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:03:10, skipping insertion in model container [2022-12-13 07:03:10,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:03:10" (2/3) ... [2022-12-13 07:03:10,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8801383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:03:10, skipping insertion in model container [2022-12-13 07:03:10,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:03:10" (3/3) ... [2022-12-13 07:03:10,470 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-12-13 07:03:10,479 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 07:03:10,490 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:03:10,490 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 07:03:10,490 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:03:10,560 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 07:03:10,608 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:03:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-12-13 07:03:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:10,610 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-12-13 07:03:10,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-12-13 07:03:10,645 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-12-13 07:03:10,655 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-12-13 07:03:10,660 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;@74f1be57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:03:10,660 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 07:03:10,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 2108620776, now seen corresponding path program 1 times [2022-12-13 07:03:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015664648] [2022-12-13 07:03:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:10,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:11,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:11,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015664648] [2022-12-13 07:03:11,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015664648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:03:11,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:03:11,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:03:11,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460980836] [2022-12-13 07:03:11,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:03:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:03:11,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:03:11,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:03:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:03:11,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:11,124 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:03:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:03:11,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:11,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:03:11,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:11,167 INFO L85 PathProgramCache]: Analyzing trace with hash -356617937, now seen corresponding path program 1 times [2022-12-13 07:03:11,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:11,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946421659] [2022-12-13 07:03:11,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:11,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:11,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946421659] [2022-12-13 07:03:11,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946421659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:03:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141598104] [2022-12-13 07:03:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:11,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:03:11,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:03:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:11,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:03:11,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:03:11,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:11,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:03:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141598104] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:03:11,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:03:11,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:03:11,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115357202] [2022-12-13 07:03:11,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:03:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:03:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:03:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:03:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:03:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:11,504 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:03:11,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-12-13 07:03:11,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:11,504 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:11,588 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:03:11,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-12-13 07:03:11,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:11,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:11,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2139522865, now seen corresponding path program 2 times [2022-12-13 07:03:11,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:11,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502690545] [2022-12-13 07:03:11,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:12,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502690545] [2022-12-13 07:03:12,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502690545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:03:12,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422734878] [2022-12-13 07:03:12,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:03:12,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:12,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:12,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:03:12,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:03:12,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:03:12,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:03:12,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 07:03:12,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:03:12,168 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:12,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:03:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422734878] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:03:12,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:03:12,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-12-13 07:03:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193640395] [2022-12-13 07:03:12,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:03:12,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 07:03:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:03:12,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 07:03:12,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-12-13 07:03:12,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:12,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:03:12,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.388888888888889) internal successors, (97), 18 states have internal predecessors, (97), 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-12-13 07:03:12,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:12,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:12,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:12,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:12,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:03:12,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 07:03:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:12,601 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:12,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 819097615, now seen corresponding path program 3 times [2022-12-13 07:03:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:12,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893456175] [2022-12-13 07:03:12,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 07:03:12,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893456175] [2022-12-13 07:03:12,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893456175] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:03:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190555675] [2022-12-13 07:03:12,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:03:12,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:12,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:12,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:03:12,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:03:13,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:03:13,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:03:13,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-13 07:03:13,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:03:13,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 07:03:13,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:03:13,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 07:03:13,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:03:13,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:03:13,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-13 07:03:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-13 07:03:13,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:03:15,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_124 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_124) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-12-13 07:03:17,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_124 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_124) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-12-13 07:03:19,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_124 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_124) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2022-12-13 07:03:20,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:03:20,176 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 07:03:20,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 07:03:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 5 not checked. [2022-12-13 07:03:20,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190555675] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:03:20,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:03:20,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 36 [2022-12-13 07:03:20,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068855323] [2022-12-13 07:03:20,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:03:20,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 07:03:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:03:20,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 07:03:20,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=931, Unknown=4, NotChecked=192, Total=1260 [2022-12-13 07:03:20,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:20,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:03:20,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.555555555555555) internal successors, (200), 36 states have internal predecessors, (200), 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-12-13 07:03:20,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:20,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:20,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:03:20,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:32,751 WARN L233 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:03:34,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:03:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:03:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:03:36,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 07:03:37,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:37,152 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash -531957771, now seen corresponding path program 1 times [2022-12-13 07:03:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:37,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222558767] [2022-12-13 07:03:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 07:03:37,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:37,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222558767] [2022-12-13 07:03:37,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222558767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:03:37,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591699614] [2022-12-13 07:03:37,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:37,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:37,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:03:37,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:03:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:37,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 07:03:37,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:03:37,616 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 07:03:37,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:03:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 07:03:37,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591699614] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:03:37,770 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:03:37,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2022-12-13 07:03:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029965457] [2022-12-13 07:03:37,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:03:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:03:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:03:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:03:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:03:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:37,774 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:03:37,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.086956521739131) internal successors, (140), 23 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-12-13 07:03:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:03:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:03:37,774 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:03:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:03:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:03:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:03:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:03:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:03:38,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:03:38,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:38,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:03:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:03:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1137908821, now seen corresponding path program 2 times [2022-12-13 07:03:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:03:38,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134634039] [2022-12-13 07:03:38,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:03:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:03:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:03:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:03:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:03:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134634039] [2022-12-13 07:03:41,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134634039] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:03:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789203824] [2022-12-13 07:03:41,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:03:41,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:03:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:03:41,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:03:41,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:03:41,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:03:41,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:03:41,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 07:03:41,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:03:41,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 07:03:41,539 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:03:41,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 07:03:41,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:03:41,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:03:41,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-12-13 07:03:41,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-12-13 07:03:49,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 07:03:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:03:49,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:03:55,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)))) is different from false [2022-12-13 07:03:57,324 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= 0 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:03:59,360 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (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_310)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:03:59,444 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_307 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_307))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_310))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:03:59,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_307 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_307))) (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_38| v_ArrVal_310))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:03:59,507 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_307 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| 28)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_307) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| v_ArrVal_310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_36|) 0))) is different from false [2022-12-13 07:04:00,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:04:00,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:04:00,232 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 07:04:00,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 07:04:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 14 not checked. [2022-12-13 07:04:00,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789203824] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:04:00,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:04:00,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 17] total 47 [2022-12-13 07:04:00,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938144538] [2022-12-13 07:04:00,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:04:00,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 07:04:00,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:04:00,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 07:04:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1471, Unknown=12, NotChecked=498, Total=2162 [2022-12-13 07:04:00,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:04:00,239 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:04:00,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 5.702127659574468) internal successors, (268), 47 states have internal predecessors, (268), 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-12-13 07:04:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:04:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:04:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:04:00,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:04:00,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:04:00,240 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:04:01,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:03,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:05,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:06,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:07,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:08,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:09,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:11,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:12,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:13,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:14,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:15,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:17,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:18,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:20,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:23,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:24,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:25,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:27,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:28,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:29,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:30,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:31,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 07:04:43,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:04:43,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:04:43,732 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 07:04:43,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 07:04:43,929 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:04:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:04:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -324411294, now seen corresponding path program 3 times [2022-12-13 07:04:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:04:43,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485068357] [2022-12-13 07:04:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:04:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:04:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:04:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:04:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:04:52,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485068357] [2022-12-13 07:04:52,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485068357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:04:52,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930265020] [2022-12-13 07:04:52,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:04:52,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:04:52,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:04:52,102 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:04:52,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:04:52,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 07:04:52,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:04:52,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 07:04:52,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:04:52,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 07:04:52,651 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:04:52,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 07:04:52,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:04:53,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:04:53,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-12-13 07:04:53,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-12-13 07:04:54,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2022-12-13 07:04:54,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-12-13 07:04:54,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 07:04:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 9 proven. 50 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:04:54,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:05:01,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ 28 |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))))) is different from false [2022-12-13 07:05:03,076 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:05:05,123 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 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| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0))) is different from false [2022-12-13 07:05:07,134 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 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| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0))) is different from false [2022-12-13 07:05:09,145 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (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_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:05:11,190 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (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_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:05:13,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (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_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:05:15,213 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (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| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0))) is different from false [2022-12-13 07:05:17,267 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-12-13 07:05:19,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0)))) is different from false [2022-12-13 07:05:21,312 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_35|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse2 28 |c_~#cache~0.offset|))))))) is different from false [2022-12-13 07:05:23,326 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:25,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (let ((.cse0 (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|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:27,422 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (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|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:29,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (let ((.cse1 (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0)))) is different from false [2022-12-13 07:05:31,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (let ((.cse1 (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|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0)))) is different from false [2022-12-13 07:05:33,527 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (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|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:35,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (let ((.cse0 (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:37,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_440 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:39,661 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_440 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440))) (store .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse4 (select .cse3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))))) |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:41,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_440 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (let ((.cse1 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_~#cache~0.base|)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store .cse3 .cse4 (select .cse3 .cse4)))) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (select .cse1 .cse2))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_35| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2022-12-13 07:05:43,745 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| Int) (v_ArrVal_440 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_35| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_35| 28))) (or (= (select (let ((.cse0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_~#cache~0.base|))) (store .cse3 |c_~#cache~0.offset| (select .cse3 |c_~#cache~0.offset|)))) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_41| (+ .cse2 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_35| 1)))) is different from false [2022-12-13 07:05:44,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:44,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:05:44,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:05:46,733 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 07:05:46,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 07:05:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 59 not checked. [2022-12-13 07:05:46,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930265020] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:05:46,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:05:46,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 33] total 84 [2022-12-13 07:05:46,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563820880] [2022-12-13 07:05:46,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:05:46,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-13 07:05:46,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:05:46,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-13 07:05:46,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=3336, Unknown=24, NotChecked=3102, Total=6972 [2022-12-13 07:05:46,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:05:46,766 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:05:46,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 4.488095238095238) internal successors, (377), 84 states have internal predecessors, (377), 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-12-13 07:05:46,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:05:46,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:05:46,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:05:46,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-12-13 07:05:46,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:05:46,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:05:46,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:06:06,092 WARN L233 SmtUtils]: Spent 18.13s on a formula simplification. DAG size of input: 91 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-13 07:08:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-12-13 07:08:35,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:08:35,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:35,502 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 07:08:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:08:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -483997931, now seen corresponding path program 4 times [2022-12-13 07:08:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:08:35,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513363441] [2022-12-13 07:08:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:08:35,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:08:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:08:38,126 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:08:38,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:08:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513363441] [2022-12-13 07:08:38,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513363441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:08:38,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714480593] [2022-12-13 07:08:38,127 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:08:38,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:08:38,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 [2022-12-13 07:08:38,128 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:08:38,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50655415-7a28-46a8-97c0-6a57def7d99c/bin/ugemcutter-rbreBovr8w/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:08:38,237 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:08:38,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:08:38,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 07:08:38,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:08:38,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-12-13 07:08:38,553 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 07:08:38,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 07:08:38,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-13 07:08:38,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-12-13 07:08:38,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-12-13 07:08:39,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-12-13 07:08:39,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 07:08:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-12-13 07:08:39,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:08:43,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 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_51|) 0)) is different from false [2022-12-13 07:08:45,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 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_51|) 0)) is different from false [2022-12-13 07:08:47,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |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_51|) 0)) is different from false [2022-12-13 07:08:47,343 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0)) is different from false [2022-12-13 07:08:49,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store (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| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |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_51|) 0)) is different from false [2022-12-13 07:08:49,373 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int))) (= (select (select (let ((.cse0 (store (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| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |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_51|) 0)) is different from false [2022-12-13 07:08:49,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0)) is different from false [2022-12-13 07:08:49,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547))) (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|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0)) is different from false [2022-12-13 07:09:05,954 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_547 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_544 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (let ((.cse2 (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (store (select (store (store .cse0 |c_~#cache~0.base| (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_547) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) 0)) is different from false [2022-12-13 07:09:06,681 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:09:06,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 47 [2022-12-13 07:09:06,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2022-12-13 07:09:06,818 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 07:09:06,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 07:09:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 235 trivial. 11 not checked. [2022-12-13 07:09:06,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714480593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:09:06,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:09:06,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 54 [2022-12-13 07:09:06,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320893852] [2022-12-13 07:09:06,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:09:06,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 07:09:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:09:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 07:09:06,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1787, Unknown=22, NotChecked=846, Total=2862 [2022-12-13 07:09:06,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:09:06,828 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-12-13 07:09:06,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.111111111111111) internal successors, (276), 54 states have internal predecessors, (276), 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-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-12-13 07:09:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-12-13 07:09:52,921 WARN L233 SmtUtils]: Spent 44.74s on a formula simplification. DAG size of input: 62 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:09:54,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:09:56,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:09:58,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:00,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:03,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:04,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:08,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:10,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:12,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:14,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:16,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:18,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:20,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:22,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:24,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:10:30,620 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 79 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:10:50,578 WARN L233 SmtUtils]: Spent 19.63s on a formula simplification. DAG size of input: 81 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:11:35,552 WARN L233 SmtUtils]: Spent 32.13s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:11:37,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:11:39,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:11:41,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:12:10,065 WARN L233 SmtUtils]: Spent 28.00s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:12:12,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:12:14,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:12:16,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:12:18,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:12:20,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:01,643 WARN L233 SmtUtils]: Spent 27.48s on a formula simplification. DAG size of input: 38 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:13:25,265 WARN L233 SmtUtils]: Spent 23.32s on a formula simplification. DAG size of input: 36 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:13:27,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:29,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:31,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:33,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:35,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:37,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:13:39,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:18,521 WARN L233 SmtUtils]: Spent 32.25s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:14:20,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:22,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:24,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:26,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:14:28,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:15:21,951 WARN L233 SmtUtils]: Spent 36.38s on a formula simplification. DAG size of input: 42 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:15:23,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:28,202 WARN L233 SmtUtils]: Spent 49.06s on a formula simplification. DAG size of input: 65 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:16:30,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:32,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:34,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:36,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:38,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:45,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:47,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:16:49,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:17:08,441 WARN L233 SmtUtils]: Spent 15.28s on a formula simplification. DAG size of input: 82 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:17:31,214 WARN L233 SmtUtils]: Spent 22.39s on a formula simplification. DAG size of input: 84 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)