./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS --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 a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f --- 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-4e7fbc6 [2022-11-23 03:12:35,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 03:12:35,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 03:12:35,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 03:12:35,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 03:12:35,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 03:12:35,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 03:12:35,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 03:12:35,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 03:12:35,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 03:12:35,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 03:12:35,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 03:12:35,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 03:12:35,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 03:12:35,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 03:12:35,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 03:12:35,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 03:12:35,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 03:12:35,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 03:12:35,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 03:12:35,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 03:12:35,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 03:12:35,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 03:12:35,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 03:12:35,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 03:12:35,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 03:12:35,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 03:12:35,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 03:12:35,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 03:12:35,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 03:12:35,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 03:12:35,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 03:12:35,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 03:12:35,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 03:12:35,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 03:12:35,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 03:12:35,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 03:12:35,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 03:12:35,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 03:12:35,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 03:12:35,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 03:12:35,566 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-23 03:12:35,606 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 03:12:35,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 03:12:35,607 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 03:12:35,607 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 03:12:35,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 03:12:35,609 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 03:12:35,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 03:12:35,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 03:12:35,610 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 03:12:35,610 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 03:12:35,611 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 03:12:35,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 03:12:35,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 03:12:35,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 03:12:35,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 03:12:35,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 03:12:35,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 03:12:35,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 03:12:35,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 03:12:35,614 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 03:12:35,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 03:12:35,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 03:12:35,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 03:12:35,615 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 03:12:35,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:12:35,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 03:12:35,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 03:12:35,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 03:12:35,616 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 03:12:35,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 03:12:35,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 03:12:35,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 03:12:35,617 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 03:12:35,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 03:12:35,617 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/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_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS 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 -> a1648913be4b4e88120f8ece4966a58804b334c451c87254dfc42f8e396f396f [2022-11-23 03:12:35,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 03:12:35,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 03:12:35,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 03:12:35,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 03:12:35,914 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 03:12:35,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c [2022-11-23 03:12:38,895 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 03:12:39,166 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 03:12:39,167 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c [2022-11-23 03:12:39,174 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/data/57cf75d53/746d1e0f29c545adbed9210682c6cc9f/FLAG1d98018b3 [2022-11-23 03:12:39,189 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/data/57cf75d53/746d1e0f29c545adbed9210682c6cc9f [2022-11-23 03:12:39,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 03:12:39,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 03:12:39,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 03:12:39,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 03:12:39,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 03:12:39,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9420a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39, skipping insertion in model container [2022-11-23 03:12:39,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 03:12:39,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 03:12:39,416 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2022-11-23 03:12:39,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:12:39,437 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 03:12:39,467 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/sv-benchmarks/c/weaver/popl20-min-max-inc-dec.wvr.c[3271,3284] [2022-11-23 03:12:39,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 03:12:39,489 INFO L208 MainTranslator]: Completed translation [2022-11-23 03:12:39,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39 WrapperNode [2022-11-23 03:12:39,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 03:12:39,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 03:12:39,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 03:12:39,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 03:12:39,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,537 INFO L138 Inliner]: procedures = 27, calls = 75, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 174 [2022-11-23 03:12:39,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 03:12:39,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 03:12:39,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 03:12:39,539 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 03:12:39,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,571 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 03:12:39,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 03:12:39,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 03:12:39,577 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 03:12:39,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (1/1) ... [2022-11-23 03:12:39,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 03:12:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:12:39,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 03:12:39,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 03:12:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 03:12:39,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 03:12:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 03:12:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 03:12:39,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-23 03:12:39,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-23 03:12:39,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-23 03:12:39,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-23 03:12:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-23 03:12:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-23 03:12:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-23 03:12:39,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-23 03:12:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 03:12:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-23 03:12:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-23 03:12:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 03:12:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 03:12:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 03:12:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 03:12:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 03:12:39,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 03:12:39,674 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 03:12:39,792 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 03:12:39,795 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 03:12:40,241 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 03:12:40,374 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 03:12:40,374 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-23 03:12:40,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:40 BoogieIcfgContainer [2022-11-23 03:12:40,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 03:12:40,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 03:12:40,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 03:12:40,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 03:12:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:12:39" (1/3) ... [2022-11-23 03:12:40,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371ba63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:40, skipping insertion in model container [2022-11-23 03:12:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:39" (2/3) ... [2022-11-23 03:12:40,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6371ba63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:40, skipping insertion in model container [2022-11-23 03:12:40,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:40" (3/3) ... [2022-11-23 03:12:40,386 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-inc-dec.wvr.c [2022-11-23 03:12:40,395 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 03:12:40,407 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 03:12:40,407 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 03:12:40,407 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 03:12:40,558 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2022-11-23 03:12:40,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 195 transitions, 430 flow [2022-11-23 03:12:40,737 INFO L130 PetriNetUnfolder]: 14/190 cut-off events. [2022-11-23 03:12:40,738 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:12:40,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 190 events. 14/190 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 131 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-11-23 03:12:40,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 195 transitions, 430 flow [2022-11-23 03:12:40,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 175 transitions, 380 flow [2022-11-23 03:12:40,756 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 03:12:40,772 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 175 transitions, 380 flow [2022-11-23 03:12:40,775 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 175 transitions, 380 flow [2022-11-23 03:12:40,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 175 transitions, 380 flow [2022-11-23 03:12:40,844 INFO L130 PetriNetUnfolder]: 14/175 cut-off events. [2022-11-23 03:12:40,844 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:12:40,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 175 events. 14/175 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 130 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2022-11-23 03:12:40,853 INFO L119 LiptonReduction]: Number of co-enabled transitions 3806 [2022-11-23 03:12:52,569 INFO L134 LiptonReduction]: Checked pairs total: 5881 [2022-11-23 03:12:52,570 INFO L136 LiptonReduction]: Total number of compositions: 164 [2022-11-23 03:12:52,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 03:12:52,609 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;@6867b98a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 03:12:52,609 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 03:12:52,619 INFO L130 PetriNetUnfolder]: 5/37 cut-off events. [2022-11-23 03:12:52,620 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-23 03:12:52,620 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:12:52,621 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] [2022-11-23 03:12:52,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:12:52,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1014283726, now seen corresponding path program 1 times [2022-11-23 03:12:52,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:52,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054584273] [2022-11-23 03:12:52,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:52,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:53,270 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-23 03:12:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:53,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054584273] [2022-11-23 03:12:53,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054584273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:53,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:53,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:53,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182873922] [2022-11-23 03:12:53,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:53,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:53,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:53,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:53,391 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 359 [2022-11-23 03:12:53,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 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-23 03:12:53,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:12:53,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 359 [2022-11-23 03:12:53,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:12:54,506 INFO L130 PetriNetUnfolder]: 6110/7594 cut-off events. [2022-11-23 03:12:54,506 INFO L131 PetriNetUnfolder]: For 359/359 co-relation queries the response was YES. [2022-11-23 03:12:54,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15782 conditions, 7594 events. 6110/7594 cut-off events. For 359/359 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 30171 event pairs, 2980 based on Foata normal form. 0/5304 useless extension candidates. Maximal degree in co-relation 13404. Up to 6012 conditions per place. [2022-11-23 03:12:54,570 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 52 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-11-23 03:12:54,570 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 266 flow [2022-11-23 03:12:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:12:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 712 transitions. [2022-11-23 03:12:54,617 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4958217270194986 [2022-11-23 03:12:54,618 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 712 transitions. [2022-11-23 03:12:54,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 712 transitions. [2022-11-23 03:12:54,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:12:54,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 712 transitions. [2022-11-23 03:12:54,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-23 03:12:54,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:54,648 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:54,650 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 106 flow. Second operand 4 states and 712 transitions. [2022-11-23 03:12:54,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 266 flow [2022-11-23 03:12:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 238 flow, removed 0 selfloop flow, removed 10 redundant places. [2022-11-23 03:12:54,677 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 100 flow [2022-11-23 03:12:54,679 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2022-11-23 03:12:54,684 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2022-11-23 03:12:54,685 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 100 flow [2022-11-23 03:12:54,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 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-23 03:12:54,689 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:12:54,690 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] [2022-11-23 03:12:54,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 03:12:54,690 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:12:54,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1898783250, now seen corresponding path program 1 times [2022-11-23 03:12:54,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:54,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951137460] [2022-11-23 03:12:54,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:54,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 03:12:54,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951137460] [2022-11-23 03:12:54,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951137460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:54,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:54,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502762342] [2022-11-23 03:12:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:54,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:54,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:54,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:55,006 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 359 [2022-11-23 03:12:55,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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-23 03:12:55,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:12:55,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 359 [2022-11-23 03:12:55,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:12:56,160 INFO L130 PetriNetUnfolder]: 7432/9228 cut-off events. [2022-11-23 03:12:56,161 INFO L131 PetriNetUnfolder]: For 1669/1669 co-relation queries the response was YES. [2022-11-23 03:12:56,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20378 conditions, 9228 events. 7432/9228 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 37599 event pairs, 3779 based on Foata normal form. 0/6511 useless extension candidates. Maximal degree in co-relation 6677. Up to 7480 conditions per place. [2022-11-23 03:12:56,217 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 54 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2022-11-23 03:12:56,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 268 flow [2022-11-23 03:12:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:12:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 712 transitions. [2022-11-23 03:12:56,223 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4958217270194986 [2022-11-23 03:12:56,224 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 712 transitions. [2022-11-23 03:12:56,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 712 transitions. [2022-11-23 03:12:56,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:12:56,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 712 transitions. [2022-11-23 03:12:56,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 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-23 03:12:56,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:56,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:56,231 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 100 flow. Second operand 4 states and 712 transitions. [2022-11-23 03:12:56,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 268 flow [2022-11-23 03:12:56,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:12:56,236 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 108 flow [2022-11-23 03:12:56,236 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2022-11-23 03:12:56,237 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-11-23 03:12:56,237 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 108 flow [2022-11-23 03:12:56,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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-23 03:12:56,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:12:56,239 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] [2022-11-23 03:12:56,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 03:12:56,239 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:12:56,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1777539325, now seen corresponding path program 1 times [2022-11-23 03:12:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:56,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799954109] [2022-11-23 03:12:56,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:56,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:12:56,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:56,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799954109] [2022-11-23 03:12:56,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799954109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:56,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:56,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594937169] [2022-11-23 03:12:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:56,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:56,470 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 359 [2022-11-23 03:12:56,471 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-23 03:12:56,471 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:12:56,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 359 [2022-11-23 03:12:56,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:12:57,921 INFO L130 PetriNetUnfolder]: 9317/11685 cut-off events. [2022-11-23 03:12:57,921 INFO L131 PetriNetUnfolder]: For 2961/2961 co-relation queries the response was YES. [2022-11-23 03:12:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27111 conditions, 11685 events. 9317/11685 cut-off events. For 2961/2961 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 48726 event pairs, 4765 based on Foata normal form. 0/8912 useless extension candidates. Maximal degree in co-relation 12566. Up to 8724 conditions per place. [2022-11-23 03:12:58,002 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 59 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2022-11-23 03:12:58,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 298 flow [2022-11-23 03:12:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:12:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 715 transitions. [2022-11-23 03:12:58,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4979108635097493 [2022-11-23 03:12:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 715 transitions. [2022-11-23 03:12:58,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 715 transitions. [2022-11-23 03:12:58,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:12:58,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 715 transitions. [2022-11-23 03:12:58,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-23 03:12:58,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:58,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:58,013 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 108 flow. Second operand 4 states and 715 transitions. [2022-11-23 03:12:58,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 298 flow [2022-11-23 03:12:58,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 288 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:12:58,017 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 116 flow [2022-11-23 03:12:58,018 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2022-11-23 03:12:58,019 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2022-11-23 03:12:58,020 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 116 flow [2022-11-23 03:12:58,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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-23 03:12:58,021 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:12:58,021 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] [2022-11-23 03:12:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 03:12:58,022 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:12:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:58,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1397726526, now seen corresponding path program 1 times [2022-11-23 03:12:58,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:58,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175592455] [2022-11-23 03:12:58,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:58,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 03:12:58,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:58,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175592455] [2022-11-23 03:12:58,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175592455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:58,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:58,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 03:12:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950545986] [2022-11-23 03:12:58,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:58,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 03:12:58,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:58,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 03:12:58,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 03:12:58,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 359 [2022-11-23 03:12:58,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-23 03:12:58,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:12:58,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 359 [2022-11-23 03:12:58,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:12:59,641 INFO L130 PetriNetUnfolder]: 8748/11085 cut-off events. [2022-11-23 03:12:59,641 INFO L131 PetriNetUnfolder]: For 3227/3953 co-relation queries the response was YES. [2022-11-23 03:12:59,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28117 conditions, 11085 events. 8748/11085 cut-off events. For 3227/3953 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 44607 event pairs, 4945 based on Foata normal form. 726/9683 useless extension candidates. Maximal degree in co-relation 9657. Up to 8498 conditions per place. [2022-11-23 03:12:59,705 INFO L137 encePairwiseOnDemand]: 355/359 looper letters, 61 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2022-11-23 03:12:59,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 315 flow [2022-11-23 03:12:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 03:12:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-23 03:12:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 715 transitions. [2022-11-23 03:12:59,709 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4979108635097493 [2022-11-23 03:12:59,709 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 715 transitions. [2022-11-23 03:12:59,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 715 transitions. [2022-11-23 03:12:59,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:12:59,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 715 transitions. [2022-11-23 03:12:59,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 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-23 03:12:59,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:59,716 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 359.0) internal successors, (1795), 5 states have internal predecessors, (1795), 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-23 03:12:59,716 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 116 flow. Second operand 4 states and 715 transitions. [2022-11-23 03:12:59,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 315 flow [2022-11-23 03:12:59,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 306 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-11-23 03:12:59,720 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 124 flow [2022-11-23 03:12:59,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2022-11-23 03:12:59,721 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2022-11-23 03:12:59,721 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 124 flow [2022-11-23 03:12:59,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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-23 03:12:59,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:12:59,722 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] [2022-11-23 03:12:59,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 03:12:59,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:12:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:12:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash -415694974, now seen corresponding path program 1 times [2022-11-23 03:12:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:12:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801524190] [2022-11-23 03:12:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:12:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:12:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:12:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:12:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:12:59,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801524190] [2022-11-23 03:12:59,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801524190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 03:12:59,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 03:12:59,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 03:12:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139547698] [2022-11-23 03:12:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 03:12:59,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 03:12:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:12:59,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 03:12:59,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 03:12:59,954 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 359 [2022-11-23 03:12:59,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-23 03:12:59,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:12:59,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 359 [2022-11-23 03:12:59,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:13:00,894 INFO L130 PetriNetUnfolder]: 6702/8564 cut-off events. [2022-11-23 03:13:00,895 INFO L131 PetriNetUnfolder]: For 2867/3870 co-relation queries the response was YES. [2022-11-23 03:13:00,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22689 conditions, 8564 events. 6702/8564 cut-off events. For 2867/3870 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 34316 event pairs, 4945 based on Foata normal form. 1003/7780 useless extension candidates. Maximal degree in co-relation 7845. Up to 8499 conditions per place. [2022-11-23 03:13:00,949 INFO L137 encePairwiseOnDemand]: 356/359 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2022-11-23 03:13:00,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 208 flow [2022-11-23 03:13:00,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 03:13:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-23 03:13:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-23 03:13:00,951 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.489322191272052 [2022-11-23 03:13:00,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-23 03:13:00,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-23 03:13:00,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 03:13:00,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-23 03:13:00,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-23 03:13:00,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 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-23 03:13:00,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 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-23 03:13:00,958 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 124 flow. Second operand 3 states and 527 transitions. [2022-11-23 03:13:00,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 208 flow [2022-11-23 03:13:00,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-23 03:13:00,965 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 130 flow [2022-11-23 03:13:00,966 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-11-23 03:13:00,968 INFO L288 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2022-11-23 03:13:00,968 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 130 flow [2022-11-23 03:13:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-23 03:13:00,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-23 03:13:00,969 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] [2022-11-23 03:13:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 03:13:00,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 03:13:00,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 03:13:00,971 INFO L85 PathProgramCache]: Analyzing trace with hash 410908369, now seen corresponding path program 1 times [2022-11-23 03:13:00,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 03:13:00,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992420468] [2022-11-23 03:13:00,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:13:00,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 03:13:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:13:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 03:13:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 03:13:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992420468] [2022-11-23 03:13:02,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992420468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 03:13:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692608533] [2022-11-23 03:13:02,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 03:13:02,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 03:13:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 03:13:02,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 03:13:02,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5895453-ff58-41fc-91ff-da44839264d1/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 03:13:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 03:13:02,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-23 03:13:02,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 03:13:02,624 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 11 treesize of output 7 [2022-11-23 03:13:02,683 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-23 03:13:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:13:02,836 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-23 03:13:03,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:13:03,089 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 21 treesize of output 21 [2022-11-23 03:13:03,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-11-23 03:13:03,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 03:13:03,434 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 23 treesize of output 23 [2022-11-23 03:13:03,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-23 03:13:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 03:13:03,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 03:13:06,796 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 c_~A~0.base))) (or (not (<= (+ (select .cse0 c_~A~0.offset) 1) v_ArrVal_284)) (<= 2147483647 v_ArrVal_284) (<= (+ (select (select (store (store .cse1 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0) (<= c_~min~0 (+ v_ArrVal_284 1)))))) is different from false [2022-11-23 03:13:07,353 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (or (not (< c_~min~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_284 Int) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse1 (select .cse2 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_284)) (<= c_~min~0 (+ v_ArrVal_284 1)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))))) (forall ((v_ArrVal_281 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse3 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse3) (forall ((v_ArrVal_284 Int) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_285 (Array Int Int))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse4 (select .cse5 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= .cse3 (+ v_ArrVal_284 1)) (not (<= (+ (select .cse4 c_~A~0.offset) 1) v_ArrVal_284)) (<= (+ (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))))))) is different from false [2022-11-23 03:13:07,455 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse2 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse1 (select .cse2 c_~A~0.base))) (or (<= 2147483647 v_ArrVal_284) (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ v_ArrVal_284 1)) (not (<= (+ (select .cse1 c_~A~0.offset) 1) v_ArrVal_284)) (<= (+ (select (select (store (store .cse2 c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0)))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse5 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse3 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (.cse4 (select .cse5 c_~A~0.base))) (or (< .cse3 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 1)) (<= 2147483647 v_ArrVal_284) (not (<= (+ (select .cse4 c_~A~0.offset) 1) v_ArrVal_284)) (< .cse3 (+ v_ArrVal_284 3)) (<= (+ (select (select (store (store .cse5 c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset) 2147483648) 0))))))) is different from false [2022-11-23 03:13:07,586 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse1 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) v_ArrVal_284)) (<= 2147483647 v_ArrVal_284) (<= (+ (select (select (store (store .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ v_ArrVal_284 1))))))) (forall ((v_ArrVal_281 (Array Int Int)) (v_ArrVal_280 (Array Int Int)) (v_ArrVal_282 (Array Int Int)) (v_ArrVal_284 Int) (v_ArrVal_285 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_280))) (let ((.cse7 (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_281))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_282))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (<= (+ (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1) v_ArrVal_284)) (<= 2147483647 v_ArrVal_284) (< .cse4 (+ v_ArrVal_284 3)) (<= (+ (select (select (store (store .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| v_ArrVal_284)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2147483648) 0) (< .cse4 (+ (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1))))))))) is different from false [2022-11-23 03:13:07,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 03:13:07,626 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 121 treesize of output 85 [2022-11-23 03:13:07,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 843 treesize of output 831 [2022-11-23 03:13:07,664 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 274 treesize of output 258 [2022-11-23 03:13:07,686 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 287 treesize of output 281 [2022-11-23 03:13:07,707 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 308 treesize of output 296 [2022-11-23 03:13:07,730 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 502 treesize of output 470 [2022-11-23 03:13:08,530 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 03:13:08,530 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 1 [2022-11-23 03:13:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-23 03:13:08,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692608533] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 03:13:08,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 03:13:08,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 17] total 41 [2022-11-23 03:13:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515026943] [2022-11-23 03:13:08,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 03:13:08,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-23 03:13:08,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 03:13:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-23 03:13:08,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1262, Unknown=25, NotChecked=308, Total=1806 [2022-11-23 03:13:08,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 359 [2022-11-23 03:13:08,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 130 flow. Second operand has 43 states, 43 states have (on average 110.65116279069767) internal successors, (4758), 43 states have internal predecessors, (4758), 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-23 03:13:08,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-23 03:13:08,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 359 [2022-11-23 03:13:08,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-23 03:13:32,742 WARN L233 SmtUtils]: Spent 22.31s on a formula simplification. DAG size of input: 105 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:13:55,452 WARN L233 SmtUtils]: Spent 22.32s on a formula simplification. DAG size of input: 107 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:14:19,143 WARN L233 SmtUtils]: Spent 22.32s on a formula simplification. DAG size of input: 135 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:14:49,820 WARN L233 SmtUtils]: Spent 25.55s on a formula simplification. DAG size of input: 79 DAG size of output: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:15:02,376 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:15:17,849 WARN L233 SmtUtils]: Spent 15.29s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:15:20,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:16:11,029 WARN L233 SmtUtils]: Spent 43.17s on a formula simplification. DAG size of input: 96 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:16:15,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:16:34,437 WARN L233 SmtUtils]: Spent 14.39s on a formula simplification. DAG size of input: 95 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:16:53,428 WARN L233 SmtUtils]: Spent 10.19s on a formula simplification. DAG size of input: 85 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:17:07,742 WARN L233 SmtUtils]: Spent 14.17s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:17:09,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:11,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:13,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:15,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:17,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:19,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:17:21,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:18:49,028 WARN L233 SmtUtils]: Spent 1.41m on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:18:51,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:18:53,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:18:55,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:18:57,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:23,609 WARN L233 SmtUtils]: Spent 22.38s on a formula simplification. DAG size of input: 107 DAG size of output: 48 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:19:26,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:28,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:30,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:37,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:39,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:41,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:19:43,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:32,238 WARN L233 SmtUtils]: Spent 42.78s on a formula simplification. DAG size of input: 120 DAG size of output: 118 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:20:34,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:36,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:38,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:40,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:42,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:20:44,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:21:01,181 WARN L233 SmtUtils]: Spent 16.17s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:21:11,750 WARN L233 SmtUtils]: Spent 10.16s on a formula simplification. DAG size of input: 67 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:21:13,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:21:15,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:21:17,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:21:19,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:21:21,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:01,680 WARN L233 SmtUtils]: Spent 33.68s on a formula simplification. DAG size of input: 110 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:22:03,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:05,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:21,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:23,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:26,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:28,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:30,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:36,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:38,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:41,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:43,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:45,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:47,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:22:49,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:32,655 WARN L233 SmtUtils]: Spent 30.53s on a formula simplification. DAG size of input: 123 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:23:34,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:36,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:38,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:23:40,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:15,297 WARN L233 SmtUtils]: Spent 33.98s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:24:37,998 WARN L233 SmtUtils]: Spent 22.40s on a formula simplification. DAG size of input: 109 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:24:40,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:42,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:44,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:46,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:48,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:50,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:53,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:55,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:57,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:24:59,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:01,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:03,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:05,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:07,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:09,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:13,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:15,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:17,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:25:19,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:05,243 WARN L233 SmtUtils]: Spent 40.88s on a formula simplification. DAG size of input: 121 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:26:07,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:09,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:11,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:13,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:16,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:18,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:20,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:23,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:25,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:31,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:33,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:26:34,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 03:27:24,185 WARN L233 SmtUtils]: Spent 37.08s on a formula simplification. DAG size of input: 136 DAG size of output: 109 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 03:27:26,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]