./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- 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-e04fb08 [2022-11-16 12:39:25,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:39:25,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:39:25,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:39:26,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:39:26,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:39:26,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:39:26,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:39:26,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:39:26,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:39:26,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:39:26,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:39:26,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:39:26,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:39:26,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:39:26,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:39:26,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:39:26,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:39:26,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:39:26,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:39:26,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:39:26,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:39:26,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:39:26,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:39:26,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:39:26,041 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:39:26,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:39:26,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:39:26,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:39:26,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:39:26,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:39:26,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:39:26,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:39:26,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:39:26,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:39:26,056 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:39:26,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:39:26,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:39:26,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:39:26,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:39:26,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:39:26,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:39:26,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:39:26,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:39:26,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:39:26,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:39:26,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:39:26,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:39:26,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:39:26,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:39:26,110 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:39:26,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:39:26,112 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:39:26,112 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:39:26,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:39:26,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:39:26,113 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:39:26,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:39:26,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:39:26,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:39:26,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:39:26,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:39:26,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:39:26,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:39:26,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:39:26,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:39:26,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:26,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:39:26,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:39:26,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:39:26,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:39:26,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:39:26,118 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:39:26,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:39:26,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:39:26,119 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_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/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_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-11-16 12:39:26,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:39:26,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:39:26,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:39:26,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:39:26,420 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:39:26,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-16 12:39:26,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/data/dd58cf954/5889f550a9294c04a62441a65575de1c/FLAGbcab3de46 [2022-11-16 12:39:26,983 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:39:26,984 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-16 12:39:26,997 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/data/dd58cf954/5889f550a9294c04a62441a65575de1c/FLAGbcab3de46 [2022-11-16 12:39:27,371 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/data/dd58cf954/5889f550a9294c04a62441a65575de1c [2022-11-16 12:39:27,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:39:27,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:39:27,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:27,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:39:27,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:39:27,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474bdc09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27, skipping insertion in model container [2022-11-16 12:39:27,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:39:27,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:39:27,692 WARN L229 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_2b060aba-adbc-4854-a7dc-d71fb7e67125/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-16 12:39:27,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:27,712 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:39:27,742 WARN L229 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_2b060aba-adbc-4854-a7dc-d71fb7e67125/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-16 12:39:27,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:39:27,765 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:39:27,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27 WrapperNode [2022-11-16 12:39:27,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:39:27,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:27,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:39:27,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:39:27,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,820 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 186 [2022-11-16 12:39:27,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:39:27,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:39:27,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:39:27,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:39:27,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,858 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:39:27,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:39:27,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:39:27,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:39:27,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (1/1) ... [2022-11-16 12:39:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:39:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:27,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:39:27,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:39:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:39:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:39:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:39:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:39:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:39:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:39:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:39:27,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:39:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:39:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:39:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:39:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:39:27,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:39:27,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:39:27,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:39:27,964 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:39:28,084 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:39:28,086 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:39:28,725 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:39:28,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:39:28,740 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-16 12:39:28,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:28 BoogieIcfgContainer [2022-11-16 12:39:28,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:39:28,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:39:28,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:39:28,751 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:39:28,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:39:27" (1/3) ... [2022-11-16 12:39:28,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77445e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:28, skipping insertion in model container [2022-11-16 12:39:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:39:27" (2/3) ... [2022-11-16 12:39:28,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77445e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:39:28, skipping insertion in model container [2022-11-16 12:39:28,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:39:28" (3/3) ... [2022-11-16 12:39:28,755 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-11-16 12:39:28,767 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:39:28,781 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:39:28,781 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 12:39:28,781 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:39:28,908 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:39:28,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 279 transitions, 574 flow [2022-11-16 12:39:29,152 INFO L130 PetriNetUnfolder]: 26/277 cut-off events. [2022-11-16 12:39:29,152 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:39:29,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 277 events. 26/277 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 267 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2022-11-16 12:39:29,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 260 places, 279 transitions, 574 flow [2022-11-16 12:39:29,180 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 268 transitions, 548 flow [2022-11-16 12:39:29,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:39:29,221 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5513d5ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:39:29,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-16 12:39:29,395 INFO L130 PetriNetUnfolder]: 26/267 cut-off events. [2022-11-16 12:39:29,395 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:39:29,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:29,397 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:29,398 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1271548424, now seen corresponding path program 1 times [2022-11-16 12:39:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846719356] [2022-11-16 12:39:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:29,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:29,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [502519344] [2022-11-16 12:39:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:29,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:29,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:29,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:29,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:39:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:29,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:39:29,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:29,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:29,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846719356] [2022-11-16 12:39:29,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:29,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502519344] [2022-11-16 12:39:29,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502519344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:29,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:29,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:39:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300659252] [2022-11-16 12:39:30,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:30,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:39:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:30,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:39:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:39:30,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 279 [2022-11-16 12:39:30,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 268 transitions, 548 flow. Second operand has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:30,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 279 [2022-11-16 12:39:30,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:30,164 INFO L130 PetriNetUnfolder]: 7/249 cut-off events. [2022-11-16 12:39:30,165 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 12:39:30,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 249 events. 7/249 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 243 event pairs, 0 based on Foata normal form. 22/252 useless extension candidates. Maximal degree in co-relation 197. Up to 5 conditions per place. [2022-11-16 12:39:30,169 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 4 selfloop transitions, 0 changer transitions 12/249 dead transitions. [2022-11-16 12:39:30,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 249 transitions, 518 flow [2022-11-16 12:39:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:39:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-16 12:39:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 533 transitions. [2022-11-16 12:39:30,197 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9551971326164874 [2022-11-16 12:39:30,198 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 533 transitions. [2022-11-16 12:39:30,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 533 transitions. [2022-11-16 12:39:30,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:30,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 533 transitions. [2022-11-16 12:39:30,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 266.5) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,223 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,225 INFO L175 Difference]: Start difference. First operand has 249 places, 268 transitions, 548 flow. Second operand 2 states and 533 transitions. [2022-11-16 12:39:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 249 transitions, 518 flow [2022-11-16 12:39:30,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 249 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:39:30,242 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 478 flow [2022-11-16 12:39:30,245 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2022-11-16 12:39:30,253 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -3 predicate places. [2022-11-16 12:39:30,254 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 478 flow [2022-11-16 12:39:30,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:30,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:30,255 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:30,269 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:30,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 12:39:30,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 210670543, now seen corresponding path program 1 times [2022-11-16 12:39:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:30,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939620577] [2022-11-16 12:39:30,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:30,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206860200] [2022-11-16 12:39:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:30,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:30,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:30,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:39:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:30,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 12:39:30,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:31,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:31,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939620577] [2022-11-16 12:39:31,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206860200] [2022-11-16 12:39:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206860200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:31,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:31,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:39:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096445774] [2022-11-16 12:39:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:39:31,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:39:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:39:31,031 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 279 [2022-11-16 12:39:31,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:31,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 279 [2022-11-16 12:39:31,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:31,317 INFO L130 PetriNetUnfolder]: 21/377 cut-off events. [2022-11-16 12:39:31,317 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-16 12:39:31,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 377 events. 21/377 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 680 event pairs, 4 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 480. Up to 66 conditions per place. [2022-11-16 12:39:31,320 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 73 selfloop transitions, 4 changer transitions 10/259 dead transitions. [2022-11-16 12:39:31,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 259 transitions, 700 flow [2022-11-16 12:39:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:39:31,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1362 transitions. [2022-11-16 12:39:31,326 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6973886328725039 [2022-11-16 12:39:31,326 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1362 transitions. [2022-11-16 12:39:31,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1362 transitions. [2022-11-16 12:39:31,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:31,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1362 transitions. [2022-11-16 12:39:31,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,339 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 478 flow. Second operand 7 states and 1362 transitions. [2022-11-16 12:39:31,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 259 transitions, 700 flow [2022-11-16 12:39:31,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 700 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:39:31,351 INFO L231 Difference]: Finished difference. Result has 244 places, 238 transitions, 500 flow [2022-11-16 12:39:31,352 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2022-11-16 12:39:31,352 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -5 predicate places. [2022-11-16 12:39:31,353 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 500 flow [2022-11-16 12:39:31,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:31,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:31,354 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:31,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:31,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:31,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:31,562 INFO L85 PathProgramCache]: Analyzing trace with hash -755944282, now seen corresponding path program 1 times [2022-11-16 12:39:31,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:31,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507869989] [2022-11-16 12:39:31,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:31,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:31,621 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:31,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622205048] [2022-11-16 12:39:31,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:31,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:31,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:31,627 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:31,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:39:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:31,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:39:31,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:31,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:32,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507869989] [2022-11-16 12:39:32,093 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:32,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622205048] [2022-11-16 12:39:32,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622205048] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:39:32,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:39:32,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-16 12:39:32,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2464820] [2022-11-16 12:39:32,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:39:32,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:39:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:32,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:39:32,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:39:32,101 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 279 [2022-11-16 12:39:32,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:32,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 279 [2022-11-16 12:39:32,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:32,286 INFO L130 PetriNetUnfolder]: 23/334 cut-off events. [2022-11-16 12:39:32,286 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-16 12:39:32,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 334 events. 23/334 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 630 event pairs, 4 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 404. Up to 17 conditions per place. [2022-11-16 12:39:32,293 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 29 selfloop transitions, 8 changer transitions 0/248 dead transitions. [2022-11-16 12:39:32,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 248 transitions, 596 flow [2022-11-16 12:39:32,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:39:32,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1669 transitions. [2022-11-16 12:39:32,297 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8545826932923707 [2022-11-16 12:39:32,298 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1669 transitions. [2022-11-16 12:39:32,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1669 transitions. [2022-11-16 12:39:32,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:32,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1669 transitions. [2022-11-16 12:39:32,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 238.42857142857142) internal successors, (1669), 7 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,310 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,310 INFO L175 Difference]: Start difference. First operand has 244 places, 238 transitions, 500 flow. Second operand 7 states and 1669 transitions. [2022-11-16 12:39:32,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 248 transitions, 596 flow [2022-11-16 12:39:32,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 248 transitions, 584 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-16 12:39:32,317 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 527 flow [2022-11-16 12:39:32,317 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2022-11-16 12:39:32,320 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -4 predicate places. [2022-11-16 12:39:32,320 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 527 flow [2022-11-16 12:39:32,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:32,322 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:32,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 12:39:32,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 12:39:32,532 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:32,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2067148472, now seen corresponding path program 1 times [2022-11-16 12:39:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:32,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013407276] [2022-11-16 12:39:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:32,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1647703175] [2022-11-16 12:39:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:32,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:32,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:32,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:32,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:39:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:32,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 12:39:32,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:32,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:32,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013407276] [2022-11-16 12:39:32,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:32,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647703175] [2022-11-16 12:39:32,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647703175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:32,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:32,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 12:39:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301886405] [2022-11-16 12:39:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:32,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 12:39:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:32,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 12:39:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:39:32,964 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 279 [2022-11-16 12:39:32,967 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:32,967 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:32,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 279 [2022-11-16 12:39:32,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:33,471 INFO L130 PetriNetUnfolder]: 51/627 cut-off events. [2022-11-16 12:39:33,471 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-16 12:39:33,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 627 events. 51/627 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 18 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 913. Up to 66 conditions per place. [2022-11-16 12:39:33,475 INFO L137 encePairwiseOnDemand]: 268/279 looper letters, 88 selfloop transitions, 7 changer transitions 46/293 dead transitions. [2022-11-16 12:39:33,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 293 transitions, 921 flow [2022-11-16 12:39:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 12:39:33,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 12:39:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2197 transitions. [2022-11-16 12:39:33,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6057347670250897 [2022-11-16 12:39:33,481 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2197 transitions. [2022-11-16 12:39:33,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2197 transitions. [2022-11-16 12:39:33,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:33,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2197 transitions. [2022-11-16 12:39:33,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:33,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:33,498 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:33,498 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 527 flow. Second operand 13 states and 2197 transitions. [2022-11-16 12:39:33,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 293 transitions, 921 flow [2022-11-16 12:39:33,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 293 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:39:33,506 INFO L231 Difference]: Finished difference. Result has 265 places, 244 transitions, 581 flow [2022-11-16 12:39:33,506 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=581, PETRI_PLACES=265, PETRI_TRANSITIONS=244} [2022-11-16 12:39:33,507 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 16 predicate places. [2022-11-16 12:39:33,507 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 244 transitions, 581 flow [2022-11-16 12:39:33,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:33,508 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:33,509 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:33,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:33,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:33,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:33,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -311763073, now seen corresponding path program 1 times [2022-11-16 12:39:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936898194] [2022-11-16 12:39:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:33,748 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:33,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109312619] [2022-11-16 12:39:33,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:33,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:33,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:33,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:33,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:39:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:33,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:39:33,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:34,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:39:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:34,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936898194] [2022-11-16 12:39:34,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:34,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109312619] [2022-11-16 12:39:34,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109312619] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:39:34,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:39:34,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-16 12:39:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747902198] [2022-11-16 12:39:34,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:34,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:39:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:34,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:39:34,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:39:34,311 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 279 [2022-11-16 12:39:34,313 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 244 transitions, 581 flow. Second operand has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:34,313 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:34,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 279 [2022-11-16 12:39:34,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:34,570 INFO L130 PetriNetUnfolder]: 26/349 cut-off events. [2022-11-16 12:39:34,570 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-16 12:39:34,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 349 events. 26/349 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 576 event pairs, 4 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 523. Up to 43 conditions per place. [2022-11-16 12:39:34,573 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 54 selfloop transitions, 11 changer transitions 0/252 dead transitions. [2022-11-16 12:39:34,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 735 flow [2022-11-16 12:39:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:39:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 12:39:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1910 transitions. [2022-11-16 12:39:34,578 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7606531262445241 [2022-11-16 12:39:34,578 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1910 transitions. [2022-11-16 12:39:34,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1910 transitions. [2022-11-16 12:39:34,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:34,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1910 transitions. [2022-11-16 12:39:34,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.22222222222223) internal successors, (1910), 9 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:34,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:34,590 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:34,590 INFO L175 Difference]: Start difference. First operand has 265 places, 244 transitions, 581 flow. Second operand 9 states and 1910 transitions. [2022-11-16 12:39:34,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 735 flow [2022-11-16 12:39:34,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 711 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-16 12:39:34,599 INFO L231 Difference]: Finished difference. Result has 263 places, 248 transitions, 617 flow [2022-11-16 12:39:34,599 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=617, PETRI_PLACES=263, PETRI_TRANSITIONS=248} [2022-11-16 12:39:34,602 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2022-11-16 12:39:34,605 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 248 transitions, 617 flow [2022-11-16 12:39:34,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:34,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:34,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:34,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:34,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:34,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:34,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:34,822 INFO L85 PathProgramCache]: Analyzing trace with hash -770632144, now seen corresponding path program 1 times [2022-11-16 12:39:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:34,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4333680] [2022-11-16 12:39:34,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:34,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:34,879 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:34,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952215242] [2022-11-16 12:39:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:34,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:34,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:34,881 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:34,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 12:39:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:35,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 12:39:35,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:39:36,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:39:36,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:36,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4333680] [2022-11-16 12:39:36,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:36,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952215242] [2022-11-16 12:39:36,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952215242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:39:36,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:39:36,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-16 12:39:36,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541456944] [2022-11-16 12:39:36,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:36,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 12:39:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:36,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 12:39:36,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:39:36,035 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 279 [2022-11-16 12:39:36,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 248 transitions, 617 flow. Second operand has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:36,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:36,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 279 [2022-11-16 12:39:36,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:36,620 INFO L130 PetriNetUnfolder]: 67/594 cut-off events. [2022-11-16 12:39:36,620 INFO L131 PetriNetUnfolder]: For 145/166 co-relation queries the response was YES. [2022-11-16 12:39:36,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 594 events. 67/594 cut-off events. For 145/166 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1510 event pairs, 29 based on Foata normal form. 22/581 useless extension candidates. Maximal degree in co-relation 956. Up to 150 conditions per place. [2022-11-16 12:39:36,623 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 73 selfloop transitions, 12 changer transitions 35/291 dead transitions. [2022-11-16 12:39:36,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 291 transitions, 996 flow [2022-11-16 12:39:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 12:39:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-16 12:39:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3377 transitions. [2022-11-16 12:39:36,631 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7119966266076323 [2022-11-16 12:39:36,631 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3377 transitions. [2022-11-16 12:39:36,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3377 transitions. [2022-11-16 12:39:36,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:36,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3377 transitions. [2022-11-16 12:39:36,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 198.64705882352942) internal successors, (3377), 17 states have internal predecessors, (3377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:36,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:36,654 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:36,654 INFO L175 Difference]: Start difference. First operand has 263 places, 248 transitions, 617 flow. Second operand 17 states and 3377 transitions. [2022-11-16 12:39:36,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 291 transitions, 996 flow [2022-11-16 12:39:36,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 291 transitions, 968 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-16 12:39:36,665 INFO L231 Difference]: Finished difference. Result has 283 places, 250 transitions, 656 flow [2022-11-16 12:39:36,666 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=656, PETRI_PLACES=283, PETRI_TRANSITIONS=250} [2022-11-16 12:39:36,669 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2022-11-16 12:39:36,669 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 250 transitions, 656 flow [2022-11-16 12:39:36,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:36,671 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:36,671 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:36,683 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 12:39:36,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 12:39:36,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1621696110, now seen corresponding path program 1 times [2022-11-16 12:39:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:36,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239660913] [2022-11-16 12:39:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:36,924 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:36,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129729555] [2022-11-16 12:39:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:36,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:36,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:36,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:36,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 12:39:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:37,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 12:39:37,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:39:37,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 12:39:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:39:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239660913] [2022-11-16 12:39:37,786 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:39:37,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129729555] [2022-11-16 12:39:37,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129729555] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 12:39:37,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 12:39:37,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-16 12:39:37,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876019137] [2022-11-16 12:39:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:39:37,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:39:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:39:37,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:39:37,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:39:37,791 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 279 [2022-11-16 12:39:37,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 250 transitions, 656 flow. Second operand has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:37,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:39:37,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 279 [2022-11-16 12:39:37,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:39:37,942 INFO L130 PetriNetUnfolder]: 17/334 cut-off events. [2022-11-16 12:39:37,942 INFO L131 PetriNetUnfolder]: For 72/80 co-relation queries the response was YES. [2022-11-16 12:39:37,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 334 events. 17/334 cut-off events. For 72/80 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 372 event pairs, 2 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 524. Up to 67 conditions per place. [2022-11-16 12:39:37,944 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 53 selfloop transitions, 7 changer transitions 0/253 dead transitions. [2022-11-16 12:39:37,945 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 253 transitions, 783 flow [2022-11-16 12:39:37,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:39:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-16 12:39:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2022-11-16 12:39:37,949 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7798259088581669 [2022-11-16 12:39:37,949 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1523 transitions. [2022-11-16 12:39:37,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1523 transitions. [2022-11-16 12:39:37,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:39:37,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1523 transitions. [2022-11-16 12:39:37,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.57142857142858) internal successors, (1523), 7 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:37,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:37,958 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:37,958 INFO L175 Difference]: Start difference. First operand has 283 places, 250 transitions, 656 flow. Second operand 7 states and 1523 transitions. [2022-11-16 12:39:37,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 253 transitions, 783 flow [2022-11-16 12:39:37,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 253 transitions, 747 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-11-16 12:39:37,965 INFO L231 Difference]: Finished difference. Result has 270 places, 252 transitions, 653 flow [2022-11-16 12:39:37,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=270, PETRI_TRANSITIONS=252} [2022-11-16 12:39:37,966 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 21 predicate places. [2022-11-16 12:39:37,966 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 252 transitions, 653 flow [2022-11-16 12:39:37,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:39:37,967 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:39:37,968 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:39:37,980 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 12:39:38,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:38,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:39:38,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:39:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1080394574, now seen corresponding path program 1 times [2022-11-16 12:39:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:39:38,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838665512] [2022-11-16 12:39:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:39:38,213 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:39:38,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1033636940] [2022-11-16 12:39:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:39:38,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:39:38,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:39:38,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:39:38,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 12:39:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:39:38,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-16 12:39:38,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:39:39,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-16 12:39:39,900 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:39:39,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:39:40,532 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:39:40,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:39:41,474 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-16 12:39:41,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-16 12:39:42,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:39:43,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:43,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 12:39:43,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:39:43,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 12:39:43,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 12:39:43,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 12:39:44,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:39:44,858 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2022-11-16 12:39:44,888 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-16 12:39:44,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2022-11-16 12:39:44,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 12:39:46,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:39:46,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 45 treesize of output 27 [2022-11-16 12:39:46,839 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:39:46,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-11-16 12:39:47,068 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-16 12:39:47,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 19 [2022-11-16 12:39:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:39:47,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:39:49,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:39:49,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 322 treesize of output 294 [2022-11-16 12:39:49,159 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 143 treesize of output 137 [2022-11-16 12:41:04,197 WARN L233 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 96 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:41:46,211 WARN L233 SmtUtils]: Spent 30.36s on a formula simplification. DAG size of input: 79 DAG size of output: 78 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:42:32,068 WARN L233 SmtUtils]: Spent 22.30s on a formula simplification. DAG size of input: 72 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:42:43,604 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-16 12:42:43,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1705 treesize of output 1505 [2022-11-16 12:42:50,625 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-16 12:42:50,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1673 treesize of output 1473 [2022-11-16 12:43:11,389 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-16 12:43:11,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1705 treesize of output 1505 [2022-11-16 12:43:29,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:43:29,827 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-16 12:43:29,841 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 12:43:29,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 263 treesize of output 251 [2022-11-16 12:43:29,856 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 6 treesize of output 4 [2022-11-16 12:43:29,866 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 6 treesize of output 4 [2022-11-16 12:43:29,875 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 6 treesize of output 4 [2022-11-16 12:43:29,898 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 6 treesize of output 4 [2022-11-16 12:43:29,907 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 6 treesize of output 4 [2022-11-16 12:43:29,913 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 6 treesize of output 4 [2022-11-16 12:43:29,921 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 6 treesize of output 4 [2022-11-16 12:43:41,045 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:43:41,045 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 22 treesize of output 18 [2022-11-16 12:43:41,061 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:43:41,061 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 22 treesize of output 18 [2022-11-16 12:43:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:43:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:42,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838665512] [2022-11-16 12:43:42,967 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:43:42,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033636940] [2022-11-16 12:43:42,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033636940] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:43:42,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:43:42,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 52] total 106 [2022-11-16 12:43:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849945310] [2022-11-16 12:43:42,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:43:42,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-11-16 12:43:42,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:42,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-11-16 12:43:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=10504, Unknown=48, NotChecked=0, Total=11130 [2022-11-16 12:43:42,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 279 [2022-11-16 12:43:42,991 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 252 transitions, 653 flow. Second operand has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:43:42,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:43:42,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 279 [2022-11-16 12:43:42,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:44:27,161 INFO L130 PetriNetUnfolder]: 3847/7494 cut-off events. [2022-11-16 12:44:27,161 INFO L131 PetriNetUnfolder]: For 4186/4187 co-relation queries the response was YES. [2022-11-16 12:44:27,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18079 conditions, 7494 events. 3847/7494 cut-off events. For 4186/4187 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 49540 event pairs, 1633 based on Foata normal form. 2/7453 useless extension candidates. Maximal degree in co-relation 18061. Up to 1473 conditions per place. [2022-11-16 12:44:27,230 INFO L137 encePairwiseOnDemand]: 184/279 looper letters, 443 selfloop transitions, 181 changer transitions 13/704 dead transitions. [2022-11-16 12:44:27,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 704 transitions, 3252 flow [2022-11-16 12:44:27,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-16 12:44:27,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2022-11-16 12:44:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 9602 transitions. [2022-11-16 12:44:27,262 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.27980301308389427 [2022-11-16 12:44:27,262 INFO L72 ComplementDD]: Start complementDD. Operand 123 states and 9602 transitions. [2022-11-16 12:44:27,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 9602 transitions. [2022-11-16 12:44:27,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:44:27,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 123 states and 9602 transitions. [2022-11-16 12:44:27,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 124 states, 123 states have (on average 78.0650406504065) internal successors, (9602), 123 states have internal predecessors, (9602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:27,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:27,363 INFO L81 ComplementDD]: Finished complementDD. Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:27,363 INFO L175 Difference]: Start difference. First operand has 270 places, 252 transitions, 653 flow. Second operand 123 states and 9602 transitions. [2022-11-16 12:44:27,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 704 transitions, 3252 flow [2022-11-16 12:44:27,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 704 transitions, 3219 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:44:27,397 INFO L231 Difference]: Finished difference. Result has 429 places, 381 transitions, 1731 flow [2022-11-16 12:44:27,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=123, PETRI_FLOW=1731, PETRI_PLACES=429, PETRI_TRANSITIONS=381} [2022-11-16 12:44:27,399 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 180 predicate places. [2022-11-16 12:44:27,399 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 381 transitions, 1731 flow [2022-11-16 12:44:27,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:44:27,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:44:27,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:44:27,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 12:44:27,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:27,612 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-16 12:44:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:44:27,612 INFO L85 PathProgramCache]: Analyzing trace with hash 272625930, now seen corresponding path program 2 times [2022-11-16 12:44:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:44:27,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390719886] [2022-11-16 12:44:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:44:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:44:27,649 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:44:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117470045] [2022-11-16 12:44:27,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:44:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:44:27,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:44:27,651 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:44:27,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b060aba-adbc-4854-a7dc-d71fb7e67125/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 12:44:28,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:44:28,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:44:28,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 12:44:28,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:44:28,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-11-16 12:44:29,934 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:44:29,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 12:44:31,321 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 12:44:31,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 12:44:33,167 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-16 12:44:33,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-16 12:44:34,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:44:34,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-16 12:44:35,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:35,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 12:44:35,211 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 6 treesize of output 5 [2022-11-16 12:44:35,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:44:35,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-16 12:44:35,655 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 6 treesize of output 5 [2022-11-16 12:44:37,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:37,588 INFO L321 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2022-11-16 12:44:37,589 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 21 [2022-11-16 12:44:37,603 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 14 treesize of output 16 [2022-11-16 12:44:37,627 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 30 treesize of output 28 [2022-11-16 12:44:38,605 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:44: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 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2022-11-16 12:44:38,641 INFO L321 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-11-16 12:44:38,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 37 [2022-11-16 12:44:38,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-16 12:44:41,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:41,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 29 treesize of output 19 [2022-11-16 12:44:41,994 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:44:41,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 23 [2022-11-16 12:44:42,313 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-16 12:44:42,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 19 [2022-11-16 12:44:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 12:44:42,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:44:53,506 INFO L321 Elim1Store]: treesize reduction 4, result has 98.1 percent of original size [2022-11-16 12:44:53,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2220 treesize of output 1773 [2022-11-16 12:46:03,058 WARN L233 SmtUtils]: Spent 1.00m on a formula simplification that was a NOOP. DAG size: 196 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:47:04,541 WARN L233 SmtUtils]: Spent 54.13s on a formula simplification that was a NOOP. DAG size: 200 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:48:13,792 WARN L233 SmtUtils]: Spent 1.08m on a formula simplification that was a NOOP. DAG size: 202 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:23,364 WARN L233 SmtUtils]: Spent 1.06m on a formula simplification. DAG size of input: 168 DAG size of output: 161 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:49:49,337 WARN L233 SmtUtils]: Spent 19.98s on a formula simplification that was a NOOP. DAG size: 149 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:50:56,929 WARN L233 SmtUtils]: Spent 44.80s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:52:16,190 WARN L233 SmtUtils]: Spent 55.51s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:52:20,083 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (- c_~A~0.offset)) (.cse34 (* 4 c_~M~0))) (and (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse1 (select (select .cse2 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse1) 4))) (< .cse1 (+ (select (select (store (store .cse2 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse3 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse6 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse3 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse4 c_~A~0.base v_ArrVal_740) .cse5 v_ArrVal_743) c_~B~0.base) .cse6) c_~A~0.base) (< .cse3 (+ (select (select (store (store .cse7 c_~A~0.base v_ArrVal_739) .cse5 v_ArrVal_744) c_~B~0.base) .cse6) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse8 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse8 v_ArrVal_744) c_~B~0.base) .cse9) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (= .cse8 (select (select (store (store .cse10 c_~A~0.base v_ArrVal_740) .cse8 v_ArrVal_743) c_~B~0.base) .cse9)) (<= c_~N~0 ~a~0)))) (= .cse8 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse11 (div (+ c_~A~0.offset (- .cse17)) (- 4))) (.cse13 (select (select .cse14 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset)) (.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse11 .cse12) (<= (+ .cse12 c_~M~0) .cse11) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= .cse13 (select (select (store (store .cse14 c_~A~0.base v_ArrVal_740) .cse13 v_ArrVal_743) c_~B~0.base) .cse15))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse13 v_ArrVal_744) c_~B~0.base) .cse15) (+ c_~A~0.offset (* .cse12 4)))) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse17)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse20 (* ~a~0 c_~M~0))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse19 (* .cse20 4))) (or (< (select (select .cse18 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse19 1)) (= (select (select (store (store .cse18 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse19)) (< (+ .cse20 c_~M~0) 2) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse27 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse22 (select (select .cse26 c_~B~0.base) c_~B~0.offset)) (.cse23 (+ (* ~a~0 4) c_~B~0.offset)) (.cse25 (* ~a~0 c_~M~0)) (.cse24 (div (+ c_~A~0.offset (- .cse27)) (- 4)))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (select (select (store (store .cse21 c_~A~0.base v_ArrVal_739) .cse22 v_ArrVal_744) c_~B~0.base) .cse23) (* .cse24 4)) (+ c_~A~0.offset (* .cse25 4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse26 c_~A~0.base v_ArrVal_740) .cse22 v_ArrVal_743) c_~B~0.base) .cse23) c_~A~0.base)) (< ~a~0 0) (< .cse24 .cse25) (<= (+ .cse25 c_~M~0) .cse24) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse27)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse29 (* (* ~a~0 c_~M~0) 4)) (.cse30 (select (select .cse32 c_~B~0.base) c_~B~0.offset)) (.cse31 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (select (select .cse28 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse29 1)) (= (select (select (store (store .cse28 c_~A~0.base v_ArrVal_739) .cse30 v_ArrVal_744) c_~B~0.base) .cse31) (+ c_~A~0.offset .cse29)) (< ~a~0 0) (= .cse30 (select (select (store (store .cse32 c_~A~0.base v_ArrVal_740) .cse30 v_ArrVal_743) c_~B~0.base) .cse31)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store (store .cse36 c_~A~0.base v_ArrVal_740) .cse35 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse33 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (= .cse35 .cse33) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse38 (select (select .cse41 c_~B~0.base) c_~B~0.offset)) (.cse39 (+ (* ~a~0 4) c_~B~0.offset)) (.cse40 (+ 5 (select (select .cse37 c_~B~0.base) c_~B~0.offset)))) (or (< (+ (select (select (store (store .cse37 c_~A~0.base v_ArrVal_739) .cse38 v_ArrVal_744) c_~B~0.base) .cse39) .cse34) .cse40) (< ~a~0 0) (= (select (select (store (store .cse41 c_~A~0.base v_ArrVal_740) .cse38 v_ArrVal_743) c_~B~0.base) .cse39) c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) .cse40) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse43 (* ~a~0 c_~M~0)) (.cse42 (div (+ c_~A~0.offset (- .cse47)) (- 4)))) (or (< ~a~0 0) (< .cse42 .cse43) (<= (+ .cse43 c_~M~0) .cse42) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse45 (select (select .cse46 c_~B~0.base) c_~B~0.offset))) (let ((.cse44 (select (select (store (store .cse46 c_~A~0.base v_ArrVal_740) .cse45 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse44 c_~A~0.base) (= .cse45 .cse44)))))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse47)) 4) 0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse49 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse50 (+ (* ~a~0 4) c_~B~0.offset))) (or (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ (select (select (store (store .cse48 c_~A~0.base v_ArrVal_739) .cse49 v_ArrVal_744) c_~B~0.base) .cse50) .cse34) (+ 5 (select (select .cse48 c_~B~0.base) c_~B~0.offset)))) (< ~a~0 0) (= (select (select (store (store .cse51 c_~A~0.base v_ArrVal_740) .cse49 v_ArrVal_743) c_~B~0.base) .cse50) c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse49 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse53 (select (select .cse56 c_~B~0.base) c_~B~0.offset)) (.cse54 (+ (* ~a~0 4) c_~B~0.offset)) (.cse55 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse52 c_~A~0.base v_ArrVal_739) .cse53 v_ArrVal_744) c_~B~0.base) .cse54) .cse34) (+ 5 .cse55)) (< ~a~0 0) (= (select (select (store (store .cse56 c_~A~0.base v_ArrVal_740) .cse53 v_ArrVal_743) c_~B~0.base) .cse54) c_~A~0.base) (< (div (+ (- 1) .cse0 .cse55) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse58 (select (select .cse57 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse59 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse57 c_~A~0.base v_ArrVal_740) .cse58 v_ArrVal_743) c_~B~0.base) .cse59) c_~A~0.base) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse60 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse60 c_~A~0.base v_ArrVal_739) .cse58 v_ArrVal_744) c_~B~0.base) .cse59) 1))) (<= c_~N~0 ~a~0)))) (= .cse58 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse62 (select (select .cse61 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse61 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse34) (+ 5 .cse62)) (< ~a~0 0) (< (div (+ (- 1) .cse0 .cse62) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse65 (* ~a~0 c_~M~0))) (let ((.cse64 (* .cse65 4)) (.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (= (select (select (store (store .cse63 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse64)) (< (+ .cse65 c_~M~0) 2) (< (+ c_~A~0.offset .cse64 .cse34) (+ 5 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse69 (* (* ~a~0 c_~M~0) 4)) (.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse67 (select (select .cse70 c_~B~0.base) c_~B~0.offset)) (.cse68 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store .cse66 c_~A~0.base v_ArrVal_739) .cse67 v_ArrVal_744) c_~B~0.base) .cse68) (+ c_~A~0.offset .cse69)) (< ~a~0 0) (< (+ c_~A~0.offset .cse69 .cse34) (+ 5 (select (select .cse66 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store (store .cse70 c_~A~0.base v_ArrVal_740) .cse67 v_ArrVal_743) c_~B~0.base) .cse68)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse74 (select (select .cse75 c_~B~0.base) c_~B~0.offset)) (.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset)) (.cse73 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse71 c_~A~0.base v_ArrVal_740) .cse72 v_ArrVal_743) c_~B~0.base) .cse73) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse74) 4))) (< .cse74 (+ (select (select (store (store .cse75 c_~A~0.base v_ArrVal_739) .cse72 v_ArrVal_744) c_~B~0.base) .cse73) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse77 (* (* ~a~0 c_~M~0) 4)) (.cse76 (select (select .cse79 c_~B~0.base) c_~B~0.offset)) (.cse78 (select (select (store (store .cse79 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse76 (+ c_~A~0.offset .cse77 1)) (= .cse78 (+ c_~A~0.offset .cse77)) (< ~a~0 0) (< .cse76 (+ .cse78 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse80 (select (select (store (store .cse82 c_~A~0.base v_ArrVal_740) .cse81 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse80 c_~A~0.base) (= .cse81 .cse80) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse83 (select (select (store (store .cse86 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse84 (* (* ~a~0 c_~M~0) 4)) (.cse85 (+ 5 (select (select .cse86 c_~B~0.base) c_~B~0.offset)))) (or (= .cse83 (+ c_~A~0.offset .cse84)) (< (+ .cse83 .cse34) .cse85) (< ~a~0 0) (< (+ c_~A~0.offset .cse84 .cse34) .cse85) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (= .cse87 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse88 (select (select (store (store .cse89 c_~A~0.base v_ArrVal_739) .cse87 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse88 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (< (select (select .cse89 c_~B~0.base) c_~B~0.offset) (+ .cse88 1)) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse92 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse91 (select (select .cse92 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse90 (select (select (store (store .cse92 c_~A~0.base v_ArrVal_740) .cse91 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse90 c_~A~0.base) (= .cse91 .cse90) (<= c_~N~0 ~a~0)))) (= .cse91 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse98 (select (select .cse97 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse93 (div (+ c_~A~0.offset (- .cse98)) (- 4))) (.cse94 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse93 .cse94) (<= (+ .cse94 c_~M~0) .cse93) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse95 (select (select (store (store .cse97 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse96 (+ c_~A~0.offset (* .cse94 4)))) (or (= .cse95 .cse96) (= (+ .cse95 (* .cse93 4)) .cse96)))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse98)) 4) 0)))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse101 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse100 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse99 (select (select (store (store .cse100 c_~A~0.base v_ArrVal_739) .cse101 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse99 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (+ .cse99 .cse34) (+ 5 (select (select .cse100 c_~B~0.base) c_~B~0.offset))) (< ~a~0 0) (<= c_~N~0 ~a~0))))) (= .cse101 c_~A~0.base)))))) (< 1 c_~M~0) (not (< 0 c_~M~0)) (< |c_ULTIMATE.start_main_~i~2#1| c_~N~0)) is different from false [2022-11-16 12:53:47,087 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification that was a NOOP. DAG size: 174 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)