./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 21:36:34,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:36:34,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:36:34,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:36:34,934 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:36:34,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:36:34,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:36:34,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:36:34,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:36:34,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:36:34,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:36:34,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:36:34,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:36:34,953 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:36:34,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:36:34,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:36:34,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:36:34,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:36:34,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:36:34,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:36:34,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:36:34,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:36:34,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:36:34,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:36:34,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:36:34,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:36:34,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:36:34,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:36:34,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:36:34,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:36:34,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:36:34,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:36:34,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:36:34,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:36:34,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:36:34,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:36:34,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:36:34,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:36:34,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:36:34,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:36:34,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:36:34,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:36:34,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:36:35,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:36:35,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:36:35,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:36:35,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:36:35,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:36:35,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:36:35,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:36:35,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:36:35,013 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:36:35,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:36:35,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:36:35,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:36:35,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:36:35,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:36:35,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:36:35,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:36:35,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:36:35,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:36:35,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:36:35,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:36:35,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:36:35,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:36:35,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-07-19 21:36:35,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:36:35,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:36:35,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:36:35,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:36:35,235 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:36:35,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-07-19 21:36:35,279 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330d6565c/8b18c0825b3c4304a876a07dec94dd5e/FLAGbef661702 [2022-07-19 21:36:35,638 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:36:35,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-07-19 21:36:35,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330d6565c/8b18c0825b3c4304a876a07dec94dd5e/FLAGbef661702 [2022-07-19 21:36:35,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/330d6565c/8b18c0825b3c4304a876a07dec94dd5e [2022-07-19 21:36:35,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:36:35,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:36:35,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:36:35,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:36:35,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:36:35,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57d6a4dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35, skipping insertion in model container [2022-07-19 21:36:35,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,680 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:36:35,700 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:36:35,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-07-19 21:36:35,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:36:35,846 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:36:35,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-07-19 21:36:35,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:36:35,870 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:36:35,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35 WrapperNode [2022-07-19 21:36:35,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:36:35,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:36:35,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:36:35,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:36:35,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,894 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-07-19 21:36:35,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:36:35,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:36:35,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:36:35,895 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:36:35,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:36:35,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:36:35,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:36:35,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:36:35,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (1/1) ... [2022-07-19 21:36:35,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:36:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:36:35,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 21:36:35,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 21:36:35,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:36:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-19 21:36:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-19 21:36:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-19 21:36:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-19 21:36:35,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-19 21:36:35,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:36:35,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:36:35,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:36:35,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:36:35,982 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:36:36,133 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:36:36,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:36:36,354 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:36:36,380 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:36:36,381 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-19 21:36:36,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:36:36 BoogieIcfgContainer [2022-07-19 21:36:36,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:36:36,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:36:36,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:36:36,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:36:36,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:36:35" (1/3) ... [2022-07-19 21:36:36,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbaa437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:36:36, skipping insertion in model container [2022-07-19 21:36:36,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:36:35" (2/3) ... [2022-07-19 21:36:36,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbaa437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:36:36, skipping insertion in model container [2022-07-19 21:36:36,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:36:36" (3/3) ... [2022-07-19 21:36:36,388 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-07-19 21:36:36,391 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:36:36,397 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:36:36,398 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 21:36:36,398 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:36:36,435 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-19 21:36:36,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-07-19 21:36:36,539 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2022-07-19 21:36:36,539 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:36:36,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-07-19 21:36:36,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-07-19 21:36:36,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-07-19 21:36:36,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:36:36,566 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f668f33, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b4655d1 [2022-07-19 21:36:36,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-19 21:36:36,586 INFO L129 PetriNetUnfolder]: 13/144 cut-off events. [2022-07-19 21:36:36,586 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-19 21:36:36,587 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:36,588 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:36,588 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 1 more)] === [2022-07-19 21:36:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash 379312160, now seen corresponding path program 1 times [2022-07-19 21:36:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191380004] [2022-07-19 21:36:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:36,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191380004] [2022-07-19 21:36:36,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191380004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:36:36,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:36:36,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:36:36,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083181445] [2022-07-19 21:36:36,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:36:36,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:36:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:36:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:36:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:36:36,795 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-07-19 21:36:36,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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-07-19 21:36:36,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:36:36,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-07-19 21:36:36,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:36:36,844 INFO L129 PetriNetUnfolder]: 42/270 cut-off events. [2022-07-19 21:36:36,845 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-07-19 21:36:36,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 708 event pairs, 15 based on Foata normal form. 42/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-07-19 21:36:36,848 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-07-19 21:36:36,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-07-19 21:36:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:36:36,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:36:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-07-19 21:36:36,859 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-07-19 21:36:36,860 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-07-19 21:36:36,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-07-19 21:36:36,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:36:36,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-07-19 21:36:36,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 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-07-19 21:36:36,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-07-19 21:36:36,874 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-07-19 21:36:36,876 INFO L186 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-07-19 21:36:36,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-07-19 21:36:36,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-19 21:36:36,882 INFO L242 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-07-19 21:36:36,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-07-19 21:36:36,888 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-07-19 21:36:36,888 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-07-19 21:36:36,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 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-07-19 21:36:36,888 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:36,889 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:36,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:36:36,889 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 1 more)] === [2022-07-19 21:36:36,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 191455911, now seen corresponding path program 1 times [2022-07-19 21:36:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:36,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260130987] [2022-07-19 21:36:36,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260130987] [2022-07-19 21:36:37,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260130987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:36:37,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:36:37,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 21:36:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624171352] [2022-07-19 21:36:37,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:36:37,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 21:36:37,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:36:37,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 21:36:37,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-19 21:36:37,148 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2022-07-19 21:36:37,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-07-19 21:36:37,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:36:37,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2022-07-19 21:36:37,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:36:37,405 INFO L129 PetriNetUnfolder]: 296/684 cut-off events. [2022-07-19 21:36:37,405 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-19 21:36:37,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 684 events. 296/684 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2962 event pairs, 167 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 1140. Up to 421 conditions per place. [2022-07-19 21:36:37,410 INFO L132 encePairwiseOnDemand]: 149/159 looper letters, 44 selfloop transitions, 6 changer transitions 4/141 dead transitions. [2022-07-19 21:36:37,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 396 flow [2022-07-19 21:36:37,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:36:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:36:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 855 transitions. [2022-07-19 21:36:37,414 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6721698113207547 [2022-07-19 21:36:37,414 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 855 transitions. [2022-07-19 21:36:37,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 855 transitions. [2022-07-19 21:36:37,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:36:37,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 855 transitions. [2022-07-19 21:36:37,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 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-07-19 21:36:37,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-07-19 21:36:37,419 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-07-19 21:36:37,419 INFO L186 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 8 states and 855 transitions. [2022-07-19 21:36:37,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 396 flow [2022-07-19 21:36:37,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:36:37,422 INFO L242 Difference]: Finished difference. Result has 144 places, 134 transitions, 300 flow [2022-07-19 21:36:37,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=300, PETRI_PLACES=144, PETRI_TRANSITIONS=134} [2022-07-19 21:36:37,423 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-19 21:36:37,423 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 134 transitions, 300 flow [2022-07-19 21:36:37,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 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-07-19 21:36:37,424 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:37,424 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:37,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 21:36:37,424 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 1 more)] === [2022-07-19 21:36:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash -553736524, now seen corresponding path program 1 times [2022-07-19 21:36:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:37,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664555559] [2022-07-19 21:36:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:37,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664555559] [2022-07-19 21:36:37,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664555559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:37,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092712716] [2022-07-19 21:36:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:37,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:37,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:36:37,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:36:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 21:36:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:37,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 21:36:37,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:36:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:37,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:36:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:37,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092712716] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:37,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:36:37,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-19 21:36:37,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365411436] [2022-07-19 21:36:37,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:36:37,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 21:36:37,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:36:37,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 21:36:37,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:36:37,829 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-07-19 21:36:37,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 134 transitions, 300 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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-07-19 21:36:37,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:36:37,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-07-19 21:36:37,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:36:37,967 INFO L129 PetriNetUnfolder]: 183/623 cut-off events. [2022-07-19 21:36:37,968 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-19 21:36:37,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 623 events. 183/623 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3079 event pairs, 80 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 941. Up to 141 conditions per place. [2022-07-19 21:36:37,973 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 33 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2022-07-19 21:36:37,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 398 flow [2022-07-19 21:36:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 21:36:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-19 21:36:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-07-19 21:36:37,975 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-07-19 21:36:37,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-07-19 21:36:37,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-07-19 21:36:37,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:36:37,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-07-19 21:36:37,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 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-07-19 21:36:37,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 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-07-19 21:36:37,979 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 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-07-19 21:36:37,979 INFO L186 Difference]: Start difference. First operand has 144 places, 134 transitions, 300 flow. Second operand 7 states and 873 transitions. [2022-07-19 21:36:37,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 398 flow [2022-07-19 21:36:37,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 380 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-19 21:36:37,983 INFO L242 Difference]: Finished difference. Result has 144 places, 136 transitions, 315 flow [2022-07-19 21:36:37,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=315, PETRI_PLACES=144, PETRI_TRANSITIONS=136} [2022-07-19 21:36:37,985 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-19 21:36:37,985 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 315 flow [2022-07-19 21:36:37,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 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-07-19 21:36:37,986 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:37,986 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:38,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-19 21:36:38,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:38,196 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 1 more)] === [2022-07-19 21:36:38,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1840372881, now seen corresponding path program 1 times [2022-07-19 21:36:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:38,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888991870] [2022-07-19 21:36:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:36:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888991870] [2022-07-19 21:36:38,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888991870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:38,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450425359] [2022-07-19 21:36:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:38,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:36:38,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:36:38,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 21:36:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:38,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:36:38,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:36:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:36:38,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:36:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:36:38,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450425359] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:38,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 21:36:38,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-19 21:36:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438736682] [2022-07-19 21:36:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:36:38,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 21:36:38,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:36:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 21:36:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:36:38,747 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2022-07-19 21:36:38,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 136 transitions, 315 flow. Second operand has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 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-07-19 21:36:38,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:36:38,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2022-07-19 21:36:38,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:36:39,024 INFO L129 PetriNetUnfolder]: 850/1566 cut-off events. [2022-07-19 21:36:39,025 INFO L130 PetriNetUnfolder]: For 646/901 co-relation queries the response was YES. [2022-07-19 21:36:39,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 1566 events. 850/1566 cut-off events. For 646/901 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8601 event pairs, 213 based on Foata normal form. 255/1656 useless extension candidates. Maximal degree in co-relation 3295. Up to 429 conditions per place. [2022-07-19 21:36:39,037 INFO L132 encePairwiseOnDemand]: 148/159 looper letters, 84 selfloop transitions, 17 changer transitions 0/196 dead transitions. [2022-07-19 21:36:39,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 196 transitions, 688 flow [2022-07-19 21:36:39,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 21:36:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-19 21:36:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2022-07-19 21:36:39,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7587192681532304 [2022-07-19 21:36:39,040 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2022-07-19 21:36:39,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2022-07-19 21:36:39,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:36:39,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2022-07-19 21:36:39,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 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-07-19 21:36:39,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 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-07-19 21:36:39,065 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 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-07-19 21:36:39,065 INFO L186 Difference]: Start difference. First operand has 144 places, 136 transitions, 315 flow. Second operand 11 states and 1327 transitions. [2022-07-19 21:36:39,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 196 transitions, 688 flow [2022-07-19 21:36:39,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 196 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:36:39,069 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 395 flow [2022-07-19 21:36:39,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=395, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2022-07-19 21:36:39,070 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 12 predicate places. [2022-07-19 21:36:39,071 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 395 flow [2022-07-19 21:36:39,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 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-07-19 21:36:39,071 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:39,071 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:39,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 21:36:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-19 21:36:39,288 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 1 more)] === [2022-07-19 21:36:39,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:39,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1817451035, now seen corresponding path program 2 times [2022-07-19 21:36:39,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:39,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56157897] [2022-07-19 21:36:39,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:39,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:36:39,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:39,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56157897] [2022-07-19 21:36:39,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56157897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270912663] [2022-07-19 21:36:39,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:36:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:36:39,393 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:36:39,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 21:36:39,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:36:39,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:36:39,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 21:36:39,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:36:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-19 21:36:39,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:36:39,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270912663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:36:39,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:36:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-19 21:36:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869474135] [2022-07-19 21:36:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:36:39,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 21:36:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:36:39,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 21:36:39,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-19 21:36:39,623 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-07-19 21:36:39,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 395 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-07-19 21:36:39,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:36:39,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-07-19 21:36:39,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:36:39,872 INFO L129 PetriNetUnfolder]: 608/1360 cut-off events. [2022-07-19 21:36:39,873 INFO L130 PetriNetUnfolder]: For 932/1135 co-relation queries the response was YES. [2022-07-19 21:36:39,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3077 conditions, 1360 events. 608/1360 cut-off events. For 932/1135 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7591 event pairs, 200 based on Foata normal form. 240/1566 useless extension candidates. Maximal degree in co-relation 3065. Up to 535 conditions per place. [2022-07-19 21:36:39,880 INFO L132 encePairwiseOnDemand]: 150/159 looper letters, 48 selfloop transitions, 13 changer transitions 0/160 dead transitions. [2022-07-19 21:36:39,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 570 flow [2022-07-19 21:36:39,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 21:36:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-19 21:36:39,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2022-07-19 21:36:39,883 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2022-07-19 21:36:39,883 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2022-07-19 21:36:39,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2022-07-19 21:36:39,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:36:39,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2022-07-19 21:36:39,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 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-07-19 21:36:39,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-07-19 21:36:39,887 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 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-07-19 21:36:39,887 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 395 flow. Second operand 8 states and 905 transitions. [2022-07-19 21:36:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 570 flow [2022-07-19 21:36:39,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 160 transitions, 563 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-19 21:36:39,893 INFO L242 Difference]: Finished difference. Result has 159 places, 150 transitions, 456 flow [2022-07-19 21:36:39,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=456, PETRI_PLACES=159, PETRI_TRANSITIONS=150} [2022-07-19 21:36:39,895 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 17 predicate places. [2022-07-19 21:36:39,895 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 456 flow [2022-07-19 21:36:39,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 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-07-19 21:36:39,896 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:36:39,896 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:36:39,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 21:36:40,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:40,114 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 1 more)] === [2022-07-19 21:36:40,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:36:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1490878222, now seen corresponding path program 1 times [2022-07-19 21:36:40,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:36:40,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498121327] [2022-07-19 21:36:40,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:36:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:40,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:36:40,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498121327] [2022-07-19 21:36:40,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498121327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:36:40,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855305746] [2022-07-19 21:36:40,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:36:40,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:36:40,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:36:40,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:36:40,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 21:36:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:36:40,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-19 21:36:40,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:36:40,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:36:40,995 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:36:40,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 21:36:41,364 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:36:41,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 21:36:41,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 21:36:42,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:36:42,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:36:42,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:36:42,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:42,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-07-19 21:36:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:36:43,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:36:44,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base))) (or (let ((.cse0 (select .cse2 c_~A~0.offset))) (let ((.cse1 (< c_~max1~0 .cse0))) (and (or (= .cse0 c_~max2~0) (not .cse1)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (let ((.cse4 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse3 (< c_~max3~0 .cse4))) (and (or (not .cse3) (< c_~max2~0 .cse4)) (or .cse3 (< c_~max2~0 c_~max3~0))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:45,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base))) (or (not (< ~M~0 c_~N~0)) (let ((.cse1 (select .cse2 c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (not .cse0) (= c_~max2~0 .cse1)) (or .cse0 (= c_~max1~0 c_~max2~0))))) (let ((.cse3 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse4 (< c_~max3~0 .cse3))) (and (or (< c_~max2~0 .cse3) (not .cse4)) (or (< c_~max2~0 c_~max3~0) .cse4)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:48,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) c_~A~0.base))) (or (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< c_~max3~0 .cse1))) (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (not .cse0) (< c_~max2~0 .cse1))))) (let ((.cse4 (select .cse2 c_~A~0.offset))) (let ((.cse3 (< c_~max1~0 .cse4))) (and (or .cse3 (= c_~max1~0 c_~max2~0)) (or (not .cse3) (= .cse4 c_~max2~0))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:53,334 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (not (< ~M~0 c_~N~0)) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (let ((.cse0 (< c_~max3~0 .cse1))) (and (or (< c_~max2~0 c_~max3~0) .cse0) (or (not .cse0) (< c_~max2~0 .cse1))))) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse3 (< c_~max1~0 .cse4))) (and (or (not .cse3) (= .cse4 c_~max2~0)) (or .cse3 (= c_~max1~0 c_~max2~0))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:54,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (< ~M~0 c_~N~0)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or .cse0 (= c_~max1~0 c_~max2~0)) (or (not .cse0) (= .cse1 c_~max2~0))))) (let ((.cse4 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (let ((.cse3 (< c_~max3~0 .cse4))) (and (or (not .cse3) (< c_~max2~0 .cse4)) (or (< c_~max2~0 c_~max3~0) .cse3)))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:54,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_162 (Array Int Int)) (v_ArrVal_161 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_161) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (let ((.cse1 (select .cse2 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (let ((.cse0 (< c_~max3~0 .cse1))) (and (or (< c_~max2~0 c_~max3~0) .cse0) (or (< c_~max2~0 .cse1) (not .cse0))))) (not (< ~M~0 c_~N~0)) (let ((.cse4 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse3 (< c_~max1~0 .cse4))) (and (or .cse3 (= c_~max1~0 c_~max2~0)) (or (= .cse4 c_~max2~0) (not .cse3))))) (< (+ ~M~0 1) c_~N~0)))) is different from false [2022-07-19 21:36:57,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:57,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 135 [2022-07-19 21:36:57,562 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:57,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1637 treesize of output 1577 [2022-07-19 21:36:57,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:57,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1565 treesize of output 1481 [2022-07-19 21:36:57,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:57,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1469 treesize of output 1289 [2022-07-19 21:36:57,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:36:57,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1277 treesize of output 1241 [2022-07-19 21:37:02,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 21:37:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:37:02,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855305746] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:37:02,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:37:02,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 32] total 81 [2022-07-19 21:37:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164135487] [2022-07-19 21:37:02,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:37:02,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-19 21:37:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:37:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-19 21:37:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=4491, Unknown=8, NotChecked=906, Total=6480 [2022-07-19 21:37:02,489 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 159 [2022-07-19 21:37:02,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 150 transitions, 456 flow. Second operand has 81 states, 81 states have (on average 61.51851851851852) internal successors, (4983), 81 states have internal predecessors, (4983), 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-07-19 21:37:02,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:37:02,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 159 [2022-07-19 21:37:02,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:37:06,964 INFO L129 PetriNetUnfolder]: 3003/5873 cut-off events. [2022-07-19 21:37:06,965 INFO L130 PetriNetUnfolder]: For 5252/5323 co-relation queries the response was YES. [2022-07-19 21:37:06,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14437 conditions, 5873 events. 3003/5873 cut-off events. For 5252/5323 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 43651 event pairs, 670 based on Foata normal form. 17/5796 useless extension candidates. Maximal degree in co-relation 14423. Up to 2242 conditions per place. [2022-07-19 21:37:07,008 INFO L132 encePairwiseOnDemand]: 115/159 looper letters, 248 selfloop transitions, 147 changer transitions 5/457 dead transitions. [2022-07-19 21:37:07,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 457 transitions, 2388 flow [2022-07-19 21:37:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-19 21:37:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-07-19 21:37:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3365 transitions. [2022-07-19 21:37:07,016 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.41497101985448265 [2022-07-19 21:37:07,017 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3365 transitions. [2022-07-19 21:37:07,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3365 transitions. [2022-07-19 21:37:07,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:37:07,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3365 transitions. [2022-07-19 21:37:07,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 65.98039215686275) internal successors, (3365), 51 states have internal predecessors, (3365), 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-07-19 21:37:07,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 159.0) internal successors, (8268), 52 states have internal predecessors, (8268), 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-07-19 21:37:07,035 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 159.0) internal successors, (8268), 52 states have internal predecessors, (8268), 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-07-19 21:37:07,035 INFO L186 Difference]: Start difference. First operand has 159 places, 150 transitions, 456 flow. Second operand 51 states and 3365 transitions. [2022-07-19 21:37:07,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 457 transitions, 2388 flow [2022-07-19 21:37:07,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 457 transitions, 2325 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-07-19 21:37:07,064 INFO L242 Difference]: Finished difference. Result has 229 places, 282 transitions, 1493 flow [2022-07-19 21:37:07,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=1493, PETRI_PLACES=229, PETRI_TRANSITIONS=282} [2022-07-19 21:37:07,067 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 87 predicate places. [2022-07-19 21:37:07,067 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 282 transitions, 1493 flow [2022-07-19 21:37:07,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 61.51851851851852) internal successors, (4983), 81 states have internal predecessors, (4983), 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-07-19 21:37:07,069 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:37:07,069 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:37:07,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 21:37:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:07,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:37:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:37:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 304744382, now seen corresponding path program 2 times [2022-07-19 21:37:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:37:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86190690] [2022-07-19 21:37:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:37:07,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:37:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:37:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:37:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:37:08,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86190690] [2022-07-19 21:37:08,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86190690] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:37:08,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849393553] [2022-07-19 21:37:08,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:37:08,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:37:08,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:37:08,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 21:37:08,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:37:08,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:37:08,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-19 21:37:08,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:37:08,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:37:08,492 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:37:08,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 21:37:08,540 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:37:08,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 21:37:08,842 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:37:08,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-19 21:37:09,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:37:09,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:37:09,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:37:09,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-19 21:37:09,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:37:09,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-07-19 21:37:10,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:37:10,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-07-19 21:37:10,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:37:10,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:37:12,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (and (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0)))) (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) c_~A~0.base) c_~A~0.offset))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or .cse1 (= c_~max1~0 c_~max2~0)) (or (not .cse1) (= .cse2 c_~max2~0))))) (<= 1 ~M~0))) is different from false [2022-07-19 21:37:15,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (and (or (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< c_~max3~0 .cse0)))))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse2))) (and (or (= c_~max1~0 c_~max2~0) .cse1) (or (= .cse2 c_~max2~0) (not .cse1))))) (<= 1 ~M~0))) is different from false [2022-07-19 21:37:15,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or .cse0 (= c_~max1~0 c_~max2~0)) (or (= .cse1 c_~max2~0) (not .cse0))))) (and (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2)))) (or (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (< c_~max2~0 c_~max3~0))) (<= 1 ~M~0))) is different from false [2022-07-19 21:37:15,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_201 (Array Int Int))) (or (<= (+ ~M~0 1) 0) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse0))) (and (or (= .cse0 c_~max2~0) (not .cse1)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (and (or (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (< c_~max2~0 c_~max3~0)) (forall ((v_ArrVal_203 (Array Int Int)) (v_ArrVal_202 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_203) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)))))) (<= 1 ~M~0))) is different from false [2022-07-19 21:37:17,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:37:17,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 117 [2022-07-19 21:37:17,298 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-19 21:37:17,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 987 treesize of output 931 [2022-07-19 21:37:17,318 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-19 21:37:17,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 931 treesize of output 893 [2022-07-19 21:37:17,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 222 [2022-07-19 21:37:17,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 198 [2022-07-19 21:37:17,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 556 treesize of output 460 [2022-07-19 21:37:17,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 412 [2022-07-19 21:37:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 21:37:18,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849393553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:37:18,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:37:18,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 32] total 82 [2022-07-19 21:37:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924863348] [2022-07-19 21:37:18,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:37:18,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-19 21:37:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:37:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-19 21:37:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=4974, Unknown=9, NotChecked=620, Total=6642 [2022-07-19 21:37:18,466 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2022-07-19 21:37:18,469 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 282 transitions, 1493 flow. Second operand has 82 states, 82 states have (on average 56.6219512195122) internal successors, (4643), 82 states have internal predecessors, (4643), 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-07-19 21:37:18,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:37:18,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2022-07-19 21:37:18,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:37:31,398 INFO L129 PetriNetUnfolder]: 11701/19830 cut-off events. [2022-07-19 21:37:31,398 INFO L130 PetriNetUnfolder]: For 41167/41862 co-relation queries the response was YES. [2022-07-19 21:37:31,486 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65150 conditions, 19830 events. 11701/19830 cut-off events. For 41167/41862 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 157395 event pairs, 771 based on Foata normal form. 487/20095 useless extension candidates. Maximal degree in co-relation 65112. Up to 6608 conditions per place. [2022-07-19 21:37:31,622 INFO L132 encePairwiseOnDemand]: 107/159 looper letters, 688 selfloop transitions, 659 changer transitions 17/1414 dead transitions. [2022-07-19 21:37:31,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1414 transitions, 10888 flow [2022-07-19 21:37:31,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-07-19 21:37:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2022-07-19 21:37:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 7713 transitions. [2022-07-19 21:37:31,635 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.38499550763701706 [2022-07-19 21:37:31,635 INFO L72 ComplementDD]: Start complementDD. Operand 126 states and 7713 transitions. [2022-07-19 21:37:31,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 7713 transitions. [2022-07-19 21:37:31,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:37:31,640 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 126 states and 7713 transitions. [2022-07-19 21:37:31,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 127 states, 126 states have (on average 61.214285714285715) internal successors, (7713), 126 states have internal predecessors, (7713), 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-07-19 21:37:31,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 127 states, 127 states have (on average 159.0) internal successors, (20193), 127 states have internal predecessors, (20193), 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-07-19 21:37:31,708 INFO L81 ComplementDD]: Finished complementDD. Result has 127 states, 127 states have (on average 159.0) internal successors, (20193), 127 states have internal predecessors, (20193), 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-07-19 21:37:31,709 INFO L186 Difference]: Start difference. First operand has 229 places, 282 transitions, 1493 flow. Second operand 126 states and 7713 transitions. [2022-07-19 21:37:31,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1414 transitions, 10888 flow [2022-07-19 21:37:32,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 1414 transitions, 10650 flow, removed 34 selfloop flow, removed 16 redundant places. [2022-07-19 21:37:32,042 INFO L242 Difference]: Finished difference. Result has 400 places, 873 transitions, 7937 flow [2022-07-19 21:37:32,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=126, PETRI_FLOW=7937, PETRI_PLACES=400, PETRI_TRANSITIONS=873} [2022-07-19 21:37:32,043 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 258 predicate places. [2022-07-19 21:37:32,044 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 873 transitions, 7937 flow [2022-07-19 21:37:32,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 56.6219512195122) internal successors, (4643), 82 states have internal predecessors, (4643), 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-07-19 21:37:32,045 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:37:32,045 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:37:32,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 21:37:32,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:32,246 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:37:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:37:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1136837458, now seen corresponding path program 1 times [2022-07-19 21:37:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:37:32,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698785638] [2022-07-19 21:37:32,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:37:32,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:37:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:37:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:37:32,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:37:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698785638] [2022-07-19 21:37:32,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698785638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:37:32,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053905513] [2022-07-19 21:37:32,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:37:32,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:32,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:37:32,930 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:37:32,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 21:37:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:37:33,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-19 21:37:33,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:37:33,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:37:33,122 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:37:33,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 21:37:33,396 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:37:33,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 21:37:34,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-19 21:37:34,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:37:34,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-19 21:37:34,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 21:37:34,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:37:34,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 32 [2022-07-19 21:37:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:37:34,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:37:34,950 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_239 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (forall ((v_ArrVal_239 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0) (not (< c_~max3~0 .cse0)))))) is different from false [2022-07-19 21:37:35,066 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))))) (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_239 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_239) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (not (< c_~max3~0 .cse0)))))) is different from false [2022-07-19 21:37:35,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:37:35,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 573 treesize of output 509 [2022-07-19 21:37:35,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 370 [2022-07-19 21:37:35,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 298 [2022-07-19 21:37:35,269 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-19 21:37:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-19 21:37:37,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053905513] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:37:37,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:37:37,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31, 31] total 80 [2022-07-19 21:37:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969333485] [2022-07-19 21:37:37,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:37:37,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-19 21:37:37,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:37:37,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-19 21:37:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=5329, Unknown=2, NotChecked=306, Total=6320 [2022-07-19 21:37:37,617 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 159 [2022-07-19 21:37:37,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 873 transitions, 7937 flow. Second operand has 80 states, 80 states have (on average 55.775) internal successors, (4462), 80 states have internal predecessors, (4462), 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-07-19 21:37:37,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:37:37,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 159 [2022-07-19 21:37:37,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:37:52,718 INFO L129 PetriNetUnfolder]: 25954/43269 cut-off events. [2022-07-19 21:37:52,718 INFO L130 PetriNetUnfolder]: For 600704/601281 co-relation queries the response was YES. [2022-07-19 21:37:53,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259721 conditions, 43269 events. 25954/43269 cut-off events. For 600704/601281 co-relation queries the response was YES. Maximal size of possible extension queue 2175. Compared 372130 event pairs, 2168 based on Foata normal form. 242/43160 useless extension candidates. Maximal degree in co-relation 259622. Up to 11773 conditions per place. [2022-07-19 21:37:53,913 INFO L132 encePairwiseOnDemand]: 107/159 looper letters, 1262 selfloop transitions, 644 changer transitions 41/2015 dead transitions. [2022-07-19 21:37:53,914 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 2015 transitions, 23979 flow [2022-07-19 21:37:53,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-07-19 21:37:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2022-07-19 21:37:53,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 5234 transitions. [2022-07-19 21:37:53,921 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3872733999260081 [2022-07-19 21:37:53,921 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 5234 transitions. [2022-07-19 21:37:53,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 5234 transitions. [2022-07-19 21:37:53,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:37:53,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 5234 transitions. [2022-07-19 21:37:53,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 61.576470588235296) internal successors, (5234), 85 states have internal predecessors, (5234), 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-07-19 21:37:53,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 159.0) internal successors, (13674), 86 states have internal predecessors, (13674), 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-07-19 21:37:53,941 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 159.0) internal successors, (13674), 86 states have internal predecessors, (13674), 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-07-19 21:37:53,941 INFO L186 Difference]: Start difference. First operand has 400 places, 873 transitions, 7937 flow. Second operand 85 states and 5234 transitions. [2022-07-19 21:37:53,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 472 places, 2015 transitions, 23979 flow [2022-07-19 21:37:58,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 2015 transitions, 22908 flow, removed 510 selfloop flow, removed 35 redundant places. [2022-07-19 21:37:58,639 INFO L242 Difference]: Finished difference. Result has 490 places, 1218 transitions, 13528 flow [2022-07-19 21:37:58,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=7358, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=13528, PETRI_PLACES=490, PETRI_TRANSITIONS=1218} [2022-07-19 21:37:58,640 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 348 predicate places. [2022-07-19 21:37:58,640 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 1218 transitions, 13528 flow [2022-07-19 21:37:58,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 55.775) internal successors, (4462), 80 states have internal predecessors, (4462), 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-07-19 21:37:58,641 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:37:58,641 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:37:58,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 21:37:58,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:58,849 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:37:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:37:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -508222912, now seen corresponding path program 2 times [2022-07-19 21:37:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:37:58,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45454123] [2022-07-19 21:37:58,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:37:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:37:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:37:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 21:37:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:37:59,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45454123] [2022-07-19 21:37:59,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45454123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:37:59,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348439674] [2022-07-19 21:37:59,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:37:59,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:37:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:37:59,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:37:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 21:37:59,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:37:59,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:37:59,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-19 21:37:59,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:37:59,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:37:59,485 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:37:59,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-19 21:37:59,524 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 21:37:59,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-19 21:37:59,833 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:37:59,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-19 21:37:59,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-19 21:38:00,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:38:00,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:38:00,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-19 21:38:00,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:38:00,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 41 [2022-07-19 21:38:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:38:01,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:38:02,737 WARN L833 $PredicateComparison]: unable to prove that (or (<= (+ c_~M~0 1) 0) (and (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_279) c_~A~0.base))) (or (< c_~max1~0 (select .cse0 c_~A~0.offset)) (let ((.cse2 (select .cse0 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse1 (< c_~max3~0 .cse2))) (and (or .cse1 (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0)) (or (not (< c_~max2~0 .cse2)) (= c_~max1~0 .cse2) (not .cse1)))))))) (forall ((v_ArrVal_279 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_279) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse4 (< c_~max3~0 .cse5))) (and (or .cse4 (not (< c_~max2~0 c_~max3~0)) (= .cse3 c_~max3~0)) (or (not (< c_~max2~0 .cse5)) (not .cse4) (= .cse3 .cse5))))))))))) is different from false [2022-07-19 21:38:26,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 21:38:26,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 121 [2022-07-19 21:38:26,656 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-19 21:38:26,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5990 treesize of output 5706 [2022-07-19 21:38:26,728 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-19 21:38:26,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5702 treesize of output 5290 [2022-07-19 21:38:26,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 21:38:26,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4844 treesize of output 4636 [2022-07-19 21:38:26,818 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-19 21:38:26,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5078 treesize of output 4250 [2022-07-19 21:39:32,413 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 21:39:32,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 1 [2022-07-19 21:39:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:39:35,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348439674] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:39:35,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:39:35,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 34, 31] total 80 [2022-07-19 21:39:35,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020380116] [2022-07-19 21:39:35,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:39:35,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-19 21:39:35,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:39:35,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-19 21:39:35,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1046, Invalid=5000, Unknown=120, NotChecked=154, Total=6320 [2022-07-19 21:39:35,061 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 159 [2022-07-19 21:39:35,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 1218 transitions, 13528 flow. Second operand has 80 states, 80 states have (on average 55.7375) internal successors, (4459), 80 states have internal predecessors, (4459), 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-07-19 21:39:35,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:39:35,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 159 [2022-07-19 21:39:35,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:40:02,677 INFO L129 PetriNetUnfolder]: 39779/65246 cut-off events. [2022-07-19 21:40:02,677 INFO L130 PetriNetUnfolder]: For 1419462/1422312 co-relation queries the response was YES. [2022-07-19 21:40:04,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475757 conditions, 65246 events. 39779/65246 cut-off events. For 1419462/1422312 co-relation queries the response was YES. Maximal size of possible extension queue 3265. Compared 586287 event pairs, 4063 based on Foata normal form. 232/64951 useless extension candidates. Maximal degree in co-relation 475621. Up to 24373 conditions per place. [2022-07-19 21:40:05,386 INFO L132 encePairwiseOnDemand]: 118/159 looper letters, 1572 selfloop transitions, 1391 changer transitions 33/3043 dead transitions. [2022-07-19 21:40:05,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 3043 transitions, 42690 flow [2022-07-19 21:40:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-07-19 21:40:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2022-07-19 21:40:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 6134 transitions. [2022-07-19 21:40:05,411 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.38578616352201256 [2022-07-19 21:40:05,411 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 6134 transitions. [2022-07-19 21:40:05,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 6134 transitions. [2022-07-19 21:40:05,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:40:05,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 6134 transitions. [2022-07-19 21:40:05,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 61.34) internal successors, (6134), 100 states have internal predecessors, (6134), 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-07-19 21:40:05,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 159.0) internal successors, (16059), 101 states have internal predecessors, (16059), 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-07-19 21:40:05,437 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 159.0) internal successors, (16059), 101 states have internal predecessors, (16059), 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-07-19 21:40:05,437 INFO L186 Difference]: Start difference. First operand has 490 places, 1218 transitions, 13528 flow. Second operand 100 states and 6134 transitions. [2022-07-19 21:40:05,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 3043 transitions, 42690 flow [2022-07-19 21:40:22,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 3043 transitions, 41600 flow, removed 501 selfloop flow, removed 37 redundant places. [2022-07-19 21:40:22,174 INFO L242 Difference]: Finished difference. Result has 594 places, 2216 transitions, 31387 flow [2022-07-19 21:40:22,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=13049, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=483, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=100, PETRI_FLOW=31387, PETRI_PLACES=594, PETRI_TRANSITIONS=2216} [2022-07-19 21:40:22,175 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 452 predicate places. [2022-07-19 21:40:22,175 INFO L495 AbstractCegarLoop]: Abstraction has has 594 places, 2216 transitions, 31387 flow [2022-07-19 21:40:22,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 55.7375) internal successors, (4459), 80 states have internal predecessors, (4459), 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-07-19 21:40:22,176 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:40:22,176 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 21:40:22,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 21:40:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:40:22,387 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-19 21:40:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:40:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -6067310, now seen corresponding path program 3 times [2022-07-19 21:40:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:40:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657781425] [2022-07-19 21:40:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:40:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:40:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:40:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 21:40:22,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:40:22,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657781425] [2022-07-19 21:40:22,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657781425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:40:22,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024822726] [2022-07-19 21:40:22,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:40:22,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:40:22,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:40:22,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 21:40:22,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 21:40:23,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-19 21:40:23,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:40:23,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 21:40:23,044 INFO L286 TraceCheckSpWp]: Computing forward predicates...