./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 f4b24e32 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-?-f4b24e3 [2022-07-13 22:14:48,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:14:48,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:14:48,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:14:48,729 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:14:48,730 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:14:48,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:14:48,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:14:48,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:14:48,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:14:48,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:14:48,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:14:48,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:14:48,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:14:48,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:14:48,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:14:48,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:14:48,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:14:48,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:14:48,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:14:48,746 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:14:48,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:14:48,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:14:48,749 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:14:48,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:14:48,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:14:48,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:14:48,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:14:48,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:14:48,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:14:48,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:14:48,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:14:48,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:14:48,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:14:48,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:14:48,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:14:48,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:14:48,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:14:48,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:14:48,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:14:48,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:14:48,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:14:48,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 22:14:48,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:14:48,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:14:48,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:14:48,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:14:48,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:14:48,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:14:48,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:14:48,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:14:48,786 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:14:48,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:14:48,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 22:14:48,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:14:48,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 22:14:48,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:14:48,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:14:48,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:14:48,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:14:48,788 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 22:14:48,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:14:48,788 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:14:48,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:14:48,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:14:48,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:14:48,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:14:48,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:14:48,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:14:48,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:14:48,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:14:48,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:14:48,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:14:48,791 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:14:48,791 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:14:48,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:14:48,791 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-13 22:14:49,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:14:49,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:14:49,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:14:49,034 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:14:49,035 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:14:49,036 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-13 22:14:49,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46223cbb/467085d5ed8447d6ae68cebe0bc53d0a/FLAG7e15fdbb0 [2022-07-13 22:14:49,508 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:14:49,509 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-07-13 22:14:49,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46223cbb/467085d5ed8447d6ae68cebe0bc53d0a/FLAG7e15fdbb0 [2022-07-13 22:14:49,530 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46223cbb/467085d5ed8447d6ae68cebe0bc53d0a [2022-07-13 22:14:49,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:14:49,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:14:49,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:14:49,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:14:49,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:14:49,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b852f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49, skipping insertion in model container [2022-07-13 22:14:49,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:14:49,566 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:14:49,713 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-13 22:14:49,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:14:49,724 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:14:49,742 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-13 22:14:49,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:14:49,756 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:14:49,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49 WrapperNode [2022-07-13 22:14:49,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:14:49,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:14:49,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:14:49,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:14:49,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,785 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-07-13 22:14:49,786 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:14:49,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:14:49,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:14:49,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:14:49,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,796 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:14:49,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:14:49,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:14:49,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:14:49,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (1/1) ... [2022-07-13 22:14:49,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:14:49,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:14:49,843 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-13 22:14:49,847 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-13 22:14:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:14:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-13 22:14:49,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-13 22:14:49,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-13 22:14:49,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-13 22:14:49,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-13 22:14:49,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-13 22:14:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:14:49,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:14:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:14:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-13 22:14:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-13 22:14:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:14:49,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:14:49,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:14:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:14:49,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:14:49,873 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 22:14:49,947 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:14:49,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:14:50,214 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:14:50,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:14:50,255 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-13 22:14:50,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:14:50 BoogieIcfgContainer [2022-07-13 22:14:50,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:14:50,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:14:50,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:14:50,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:14:50,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:14:49" (1/3) ... [2022-07-13 22:14:50,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f633a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:14:50, skipping insertion in model container [2022-07-13 22:14:50,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:14:49" (2/3) ... [2022-07-13 22:14:50,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@520f633a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:14:50, skipping insertion in model container [2022-07-13 22:14:50,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:14:50" (3/3) ... [2022-07-13 22:14:50,263 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-07-13 22:14:50,267 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 22:14:50,274 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:14:50,274 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:14:50,274 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 22:14:50,379 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 22:14:50,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-07-13 22:14:50,463 INFO L129 PetriNetUnfolder]: 13/156 cut-off events. [2022-07-13 22:14:50,463 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:14:50,467 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-13 22:14:50,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-07-13 22:14:50,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-07-13 22:14:50,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:14:50,486 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@78abdc86, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3bb0ba5a [2022-07-13 22:14:50,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 22:14:50,517 INFO L129 PetriNetUnfolder]: 13/144 cut-off events. [2022-07-13 22:14:50,517 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-13 22:14:50,517 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:50,518 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-13 22:14:50,519 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-13 22:14:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 379312160, now seen corresponding path program 1 times [2022-07-13 22:14:50,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:50,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606244184] [2022-07-13 22:14:50,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:50,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:50,740 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-13 22:14:50,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:50,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606244184] [2022-07-13 22:14:50,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606244184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:14:50,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:14:50,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 22:14:50,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245851696] [2022-07-13 22:14:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:14:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 22:14:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:14:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 22:14:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 22:14:50,785 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-07-13 22:14:50,798 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-13 22:14:50,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:14:50,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-07-13 22:14:50,806 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:14:50,912 INFO L129 PetriNetUnfolder]: 42/270 cut-off events. [2022-07-13 22:14:50,917 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-07-13 22:14:50,919 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-13 22:14:50,923 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-07-13 22:14:50,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-07-13 22:14:50,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 22:14:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 22:14:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-07-13 22:14:50,943 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-07-13 22:14:50,944 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-07-13 22:14:50,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-07-13 22:14:50,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:14:50,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-07-13 22:14:50,956 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-13 22:14:50,963 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-13 22:14:50,963 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-13 22:14:50,965 INFO L186 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-07-13 22:14:50,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-07-13 22:14:50,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-13 22:14:50,973 INFO L242 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-07-13 22:14:50,974 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-13 22:14:50,978 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-07-13 22:14:50,978 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-07-13 22:14:50,979 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-13 22:14:50,979 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:50,979 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-13 22:14:50,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:14:50,980 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-13 22:14:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash 191455911, now seen corresponding path program 1 times [2022-07-13 22:14:50,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:50,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105768916] [2022-07-13 22:14:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:51,320 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-13 22:14:51,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:51,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105768916] [2022-07-13 22:14:51,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105768916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:14:51,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:14:51,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:14:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392685255] [2022-07-13 22:14:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:14:51,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:14:51,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:14:51,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:14:51,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:14:51,326 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2022-07-13 22:14:51,336 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-13 22:14:51,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:14:51,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2022-07-13 22:14:51,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:14:51,581 INFO L129 PetriNetUnfolder]: 296/684 cut-off events. [2022-07-13 22:14:51,581 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-13 22:14:51,585 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-13 22:14:51,590 INFO L132 encePairwiseOnDemand]: 149/159 looper letters, 44 selfloop transitions, 6 changer transitions 4/141 dead transitions. [2022-07-13 22:14:51,590 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 141 transitions, 396 flow [2022-07-13 22:14:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:14:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:14:51,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 855 transitions. [2022-07-13 22:14:51,595 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6721698113207547 [2022-07-13 22:14:51,595 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 855 transitions. [2022-07-13 22:14:51,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 855 transitions. [2022-07-13 22:14:51,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:14:51,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 855 transitions. [2022-07-13 22:14:51,598 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-13 22:14:51,602 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-13 22:14:51,603 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-13 22:14:51,603 INFO L186 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 8 states and 855 transitions. [2022-07-13 22:14:51,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 141 transitions, 396 flow [2022-07-13 22:14:51,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 141 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 22:14:51,621 INFO L242 Difference]: Finished difference. Result has 144 places, 134 transitions, 300 flow [2022-07-13 22:14:51,622 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-13 22:14:51,623 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-13 22:14:51,623 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 134 transitions, 300 flow [2022-07-13 22:14:51,624 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-13 22:14:51,624 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:51,624 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-13 22:14:51,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:14:51,625 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-13 22:14:51,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:51,626 INFO L85 PathProgramCache]: Analyzing trace with hash -553736524, now seen corresponding path program 1 times [2022-07-13 22:14:51,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:51,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784761014] [2022-07-13 22:14:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:51,792 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-13 22:14:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:51,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784761014] [2022-07-13 22:14:51,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784761014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:51,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910975356] [2022-07-13 22:14:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:51,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:14:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:14:51,807 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-13 22:14:51,832 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-13 22:14:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:51,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 22:14:51,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:14:52,030 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-13 22:14:52,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:14:52,270 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-13 22:14:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910975356] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:52,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:14:52,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-07-13 22:14:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281743247] [2022-07-13 22:14:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:14:52,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:14:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:14:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:14:52,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:14:52,274 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-07-13 22:14:52,275 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-13 22:14:52,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:14:52,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-07-13 22:14:52,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:14:52,457 INFO L129 PetriNetUnfolder]: 183/623 cut-off events. [2022-07-13 22:14:52,457 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-07-13 22:14:52,459 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-13 22:14:52,462 INFO L132 encePairwiseOnDemand]: 151/159 looper letters, 33 selfloop transitions, 7 changer transitions 0/142 dead transitions. [2022-07-13 22:14:52,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 142 transitions, 398 flow [2022-07-13 22:14:52,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:14:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-13 22:14:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-07-13 22:14:52,465 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-07-13 22:14:52,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-07-13 22:14:52,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-07-13 22:14:52,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:14:52,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-07-13 22:14:52,468 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-13 22:14:52,470 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-13 22:14:52,471 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-13 22:14:52,471 INFO L186 Difference]: Start difference. First operand has 144 places, 134 transitions, 300 flow. Second operand 7 states and 873 transitions. [2022-07-13 22:14:52,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 142 transitions, 398 flow [2022-07-13 22:14:52,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 142 transitions, 380 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-07-13 22:14:52,475 INFO L242 Difference]: Finished difference. Result has 144 places, 136 transitions, 315 flow [2022-07-13 22:14:52,476 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-13 22:14:52,477 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 2 predicate places. [2022-07-13 22:14:52,477 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 136 transitions, 315 flow [2022-07-13 22:14:52,477 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-13 22:14:52,478 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:52,478 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-13 22:14:52,506 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-13 22:14:52,692 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-13 22:14:52,693 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-13 22:14:52,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:52,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1840372881, now seen corresponding path program 1 times [2022-07-13 22:14:52,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:52,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747305217] [2022-07-13 22:14:52,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:52,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:52,812 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-13 22:14:52,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:52,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747305217] [2022-07-13 22:14:52,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747305217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:52,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432738424] [2022-07-13 22:14:52,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:52,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:14:52,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:14:52,815 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-13 22:14:52,816 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-13 22:14:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:52,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:14:52,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:14:53,056 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-13 22:14:53,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:14:53,228 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-13 22:14:53,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432738424] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:53,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:14:53,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-07-13 22:14:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888829797] [2022-07-13 22:14:53,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:14:53,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:14:53,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:14:53,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:14:53,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:14:53,232 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2022-07-13 22:14:53,233 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-13 22:14:53,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:14:53,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2022-07-13 22:14:53,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:14:53,593 INFO L129 PetriNetUnfolder]: 850/1566 cut-off events. [2022-07-13 22:14:53,593 INFO L130 PetriNetUnfolder]: For 646/901 co-relation queries the response was YES. [2022-07-13 22:14:53,598 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-13 22:14:53,607 INFO L132 encePairwiseOnDemand]: 148/159 looper letters, 84 selfloop transitions, 17 changer transitions 0/196 dead transitions. [2022-07-13 22:14:53,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 196 transitions, 688 flow [2022-07-13 22:14:53,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:14:53,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-13 22:14:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2022-07-13 22:14:53,612 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7587192681532304 [2022-07-13 22:14:53,612 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2022-07-13 22:14:53,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2022-07-13 22:14:53,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:14:53,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2022-07-13 22:14:53,616 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-13 22:14:53,619 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-13 22:14:53,619 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-13 22:14:53,620 INFO L186 Difference]: Start difference. First operand has 144 places, 136 transitions, 315 flow. Second operand 11 states and 1327 transitions. [2022-07-13 22:14:53,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 196 transitions, 688 flow [2022-07-13 22:14:53,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 196 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 22:14:53,624 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 395 flow [2022-07-13 22:14:53,625 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-13 22:14:53,625 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 12 predicate places. [2022-07-13 22:14:53,626 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 395 flow [2022-07-13 22:14:53,626 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-13 22:14:53,626 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:53,627 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-13 22:14:53,653 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-13 22:14:53,850 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-13 22:14:53,851 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-13 22:14:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:53,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1817451035, now seen corresponding path program 2 times [2022-07-13 22:14:53,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:53,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647693756] [2022-07-13 22:14:53,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:53,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:53,988 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-13 22:14:53,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:53,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647693756] [2022-07-13 22:14:53,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647693756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:53,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321000993] [2022-07-13 22:14:53,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:14:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:14:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:14:53,991 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-13 22:14:54,021 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-13 22:14:54,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:14:54,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:14:54,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 22:14:54,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:14:54,292 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-13 22:14:54,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:14:54,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321000993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:14:54,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:14:54,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-13 22:14:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222321433] [2022-07-13 22:14:54,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:14:54,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:14:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:14:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:14:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:14:54,296 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-07-13 22:14:54,297 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-13 22:14:54,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:14:54,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-07-13 22:14:54,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:14:54,594 INFO L129 PetriNetUnfolder]: 608/1360 cut-off events. [2022-07-13 22:14:54,594 INFO L130 PetriNetUnfolder]: For 932/1135 co-relation queries the response was YES. [2022-07-13 22:14:54,598 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-13 22:14:54,605 INFO L132 encePairwiseOnDemand]: 150/159 looper letters, 48 selfloop transitions, 13 changer transitions 0/160 dead transitions. [2022-07-13 22:14:54,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 160 transitions, 570 flow [2022-07-13 22:14:54,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:14:54,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-13 22:14:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2022-07-13 22:14:54,608 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2022-07-13 22:14:54,608 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2022-07-13 22:14:54,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2022-07-13 22:14:54,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:14:54,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2022-07-13 22:14:54,611 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-13 22:14:54,613 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-13 22:14:54,613 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-13 22:14:54,613 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 395 flow. Second operand 8 states and 905 transitions. [2022-07-13 22:14:54,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 160 transitions, 570 flow [2022-07-13 22:14:54,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 160 transitions, 563 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-13 22:14:54,619 INFO L242 Difference]: Finished difference. Result has 159 places, 150 transitions, 456 flow [2022-07-13 22:14:54,619 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-13 22:14:54,620 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 17 predicate places. [2022-07-13 22:14:54,620 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 150 transitions, 456 flow [2022-07-13 22:14:54,621 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-13 22:14:54,621 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:14:54,621 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-13 22:14:54,647 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-13 22:14:54,835 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-13 22:14:54,836 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-13 22:14:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:14:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1490878222, now seen corresponding path program 1 times [2022-07-13 22:14:54,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:14:54,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399770787] [2022-07-13 22:14:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:14:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:55,710 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-13 22:14:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:14:55,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399770787] [2022-07-13 22:14:55,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399770787] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:14:55,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106869211] [2022-07-13 22:14:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:14:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:14:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:14:55,713 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-13 22:14:55,714 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-13 22:14:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:14:55,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-13 22:14:55,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:14:55,892 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-13 22:14:55,957 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:14:55,958 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-13 22:14:56,422 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:14:56,423 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-13 22:14:56,676 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-13 22:14:57,250 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-13 22:14:57,376 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-13 22:14:57,475 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-13 22:14:57,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:14:57,897 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-13 22:14:58,757 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-13 22:14:58,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:14:59,905 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-13 22:15:01,754 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-13 22:15:04,814 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-13 22:15:10,667 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-13 22:15:11,821 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-13 22:15:12,311 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-13 22:15:15,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,235 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-13 22:15:15,251 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,252 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-13 22:15:15,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,280 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-13 22:15:15,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,306 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-13 22:15:15,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:15,332 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-13 22:15:23,007 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-13 22:15:23,076 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-13 22:15:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106869211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:15:23,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:15:23,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 33, 32] total 81 [2022-07-13 22:15:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212432821] [2022-07-13 22:15:23,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:15:23,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-13 22:15:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:23,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-13 22:15:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1074, Invalid=4491, Unknown=9, NotChecked=906, Total=6480 [2022-07-13 22:15:23,084 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 159 [2022-07-13 22:15:23,090 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-13 22:15:23,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:23,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 159 [2022-07-13 22:15:23,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:28,376 INFO L129 PetriNetUnfolder]: 3003/5873 cut-off events. [2022-07-13 22:15:28,377 INFO L130 PetriNetUnfolder]: For 5252/5323 co-relation queries the response was YES. [2022-07-13 22:15:28,395 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-13 22:15:28,425 INFO L132 encePairwiseOnDemand]: 115/159 looper letters, 248 selfloop transitions, 147 changer transitions 5/457 dead transitions. [2022-07-13 22:15:28,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 457 transitions, 2388 flow [2022-07-13 22:15:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 22:15:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2022-07-13 22:15:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 3365 transitions. [2022-07-13 22:15:28,435 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.41497101985448265 [2022-07-13 22:15:28,435 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 3365 transitions. [2022-07-13 22:15:28,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 3365 transitions. [2022-07-13 22:15:28,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:28,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 3365 transitions. [2022-07-13 22:15:28,446 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-13 22:15:28,457 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-13 22:15:28,459 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-13 22:15:28,459 INFO L186 Difference]: Start difference. First operand has 159 places, 150 transitions, 456 flow. Second operand 51 states and 3365 transitions. [2022-07-13 22:15:28,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 457 transitions, 2388 flow [2022-07-13 22:15:28,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 457 transitions, 2325 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-07-13 22:15:28,490 INFO L242 Difference]: Finished difference. Result has 229 places, 282 transitions, 1493 flow [2022-07-13 22:15:28,491 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-13 22:15:28,493 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 87 predicate places. [2022-07-13 22:15:28,493 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 282 transitions, 1493 flow [2022-07-13 22:15:28,495 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-13 22:15:28,495 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:28,495 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-13 22:15:28,520 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-13 22:15:28,711 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-13 22:15:28,711 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-13 22:15:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:28,712 INFO L85 PathProgramCache]: Analyzing trace with hash 304744382, now seen corresponding path program 2 times [2022-07-13 22:15:28,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:28,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268783466] [2022-07-13 22:15:28,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:28,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:29,946 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-13 22:15:29,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268783466] [2022-07-13 22:15:29,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268783466] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:29,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174955978] [2022-07-13 22:15:29,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:15:29,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:29,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:29,948 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-13 22:15:29,948 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-13 22:15:30,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:15:30,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:15:30,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 22:15:30,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:30,076 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-13 22:15:30,131 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:15:30,132 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-13 22:15:30,181 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:15:30,182 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-13 22:15:30,555 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:15:30,555 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-13 22:15:30,749 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-13 22:15:31,041 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-13 22:15:31,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:15:31,436 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-13 22:15:31,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:15:31,575 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-13 22:15:31,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:31,891 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-13 22:15:32,906 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-13 22:15:32,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:15:35,070 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-13 22:15:37,932 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-13 22:15:38,567 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-13 22:15:38,929 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-13 22:15:40,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:15:40,601 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-13 22:15:40,629 INFO L356 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-07-13 22:15:40,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 999 treesize of output 945 [2022-07-13 22:15:40,647 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:15:40,648 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 945 treesize of output 907 [2022-07-13 22:15:40,679 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-13 22:15:40,686 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-13 22:15:42,450 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-13 22:15:42,455 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-13 22:15:44,078 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-13 22:15:44,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174955978] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:15:44,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:15:44,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 32] total 82 [2022-07-13 22:15:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045479128] [2022-07-13 22:15:44,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:15:44,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-13 22:15:44,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:15:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-13 22:15:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1039, Invalid=4974, Unknown=9, NotChecked=620, Total=6642 [2022-07-13 22:15:44,088 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2022-07-13 22:15:44,093 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-13 22:15:44,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:15:44,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2022-07-13 22:15:44,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:15:57,217 INFO L129 PetriNetUnfolder]: 11191/19086 cut-off events. [2022-07-13 22:15:57,218 INFO L130 PetriNetUnfolder]: For 39440/40067 co-relation queries the response was YES. [2022-07-13 22:15:57,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62757 conditions, 19086 events. 11191/19086 cut-off events. For 39440/40067 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 152834 event pairs, 775 based on Foata normal form. 396/19324 useless extension candidates. Maximal degree in co-relation 62719. Up to 6538 conditions per place. [2022-07-13 22:15:57,416 INFO L132 encePairwiseOnDemand]: 114/159 looper letters, 734 selfloop transitions, 509 changer transitions 22/1315 dead transitions. [2022-07-13 22:15:57,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1315 transitions, 10180 flow [2022-07-13 22:15:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-07-13 22:15:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2022-07-13 22:15:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 6384 transitions. [2022-07-13 22:15:57,429 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.38981498442938267 [2022-07-13 22:15:57,429 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 6384 transitions. [2022-07-13 22:15:57,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 6384 transitions. [2022-07-13 22:15:57,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:15:57,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 6384 transitions. [2022-07-13 22:15:57,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 61.980582524271846) internal successors, (6384), 103 states have internal predecessors, (6384), 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-13 22:15:57,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 159.0) internal successors, (16536), 104 states have internal predecessors, (16536), 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-13 22:15:57,486 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 159.0) internal successors, (16536), 104 states have internal predecessors, (16536), 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-13 22:15:57,486 INFO L186 Difference]: Start difference. First operand has 229 places, 282 transitions, 1493 flow. Second operand 103 states and 6384 transitions. [2022-07-13 22:15:57,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1315 transitions, 10180 flow [2022-07-13 22:15:57,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 1315 transitions, 9963 flow, removed 31 selfloop flow, removed 16 redundant places. [2022-07-13 22:15:57,857 INFO L242 Difference]: Finished difference. Result has 365 places, 744 transitions, 6444 flow [2022-07-13 22:15:57,857 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=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=103, PETRI_FLOW=6444, PETRI_PLACES=365, PETRI_TRANSITIONS=744} [2022-07-13 22:15:57,858 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 223 predicate places. [2022-07-13 22:15:57,858 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 744 transitions, 6444 flow [2022-07-13 22:15:57,860 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-13 22:15:57,860 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:15:57,860 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-13 22:15:57,878 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-13 22:15:58,061 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-13 22:15:58,061 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-13 22:15:58,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:15:58,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2104264474, now seen corresponding path program 1 times [2022-07-13 22:15:58,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:15:58,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786233123] [2022-07-13 22:15:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:15:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:58,877 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-13 22:15:58,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:15:58,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786233123] [2022-07-13 22:15:58,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786233123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:15:58,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097597772] [2022-07-13 22:15:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:15:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:15:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:15:58,879 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-13 22:15:58,880 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-13 22:15:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:15:58,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-13 22:15:58,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:15:59,047 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-13 22:15:59,255 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:15:59,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 22:16:00,123 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-13 22:16:00,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:00,304 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 39 [2022-07-13 22:16:00,876 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-13 22:16:00,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:16:01,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (~M~0 Int)) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_237) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< c_~max3~0 .cse1))) (and (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) .cse0) (or (not .cse0) (not (< c_~max2~0 .cse1)) (= c_~max1~0 .cse1))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) is different from false [2022-07-13 22:16:01,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:01,793 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 175 treesize of output 135 [2022-07-13 22:16:01,803 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 62 treesize of output 44 [2022-07-13 22:16:01,830 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-13 22:16:03,592 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-13 22:16:03,774 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-13 22:16:03,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097597772] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:16:03,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:16:03,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 31] total 84 [2022-07-13 22:16:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291808487] [2022-07-13 22:16:03,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:16:03,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-07-13 22:16:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:16:03,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-07-13 22:16:03,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=5863, Unknown=1, NotChecked=162, Total=6972 [2022-07-13 22:16:03,781 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 159 [2022-07-13 22:16:03,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 744 transitions, 6444 flow. Second operand has 84 states, 84 states have (on average 64.5) internal successors, (5418), 84 states have internal predecessors, (5418), 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-13 22:16:03,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:16:03,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 159 [2022-07-13 22:16:03,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:16:07,139 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_thread3Thread1of1ForFork1_~i~2 1)) (.cse0 (= c_~max1~0 c_~max3~0))) (and (or (and (= c_~max2~0 0) (or .cse0 (<= c_~max3~0 0))) (<= .cse1 c_~N~0)) (forall ((v_ArrVal_237 (Array Int Int)) (~M~0 Int)) (or (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_237) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse2 (< c_~max3~0 .cse3))) (and (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) .cse2) (or (not .cse2) (not (< c_~max2~0 .cse3)) (= c_~max1~0 .cse3))))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (or (not (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0)) (< .cse1 c_~N~0) (let ((.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse4 (< c_~max3~0 .cse5))) (and (or (not (< c_~max2~0 c_~max3~0)) .cse0 .cse4) (or (not .cse4) (not (< c_~max2~0 .cse5)) (= c_~max1~0 .cse5)))))))) is different from false [2022-07-13 22:16:13,051 INFO L129 PetriNetUnfolder]: 11256/22304 cut-off events. [2022-07-13 22:16:13,052 INFO L130 PetriNetUnfolder]: For 157660/158842 co-relation queries the response was YES. [2022-07-13 22:16:13,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99576 conditions, 22304 events. 11256/22304 cut-off events. For 157660/158842 co-relation queries the response was YES. Maximal size of possible extension queue 1380. Compared 214750 event pairs, 657 based on Foata normal form. 481/22543 useless extension candidates. Maximal degree in co-relation 99488. Up to 5452 conditions per place. [2022-07-13 22:16:13,370 INFO L132 encePairwiseOnDemand]: 113/159 looper letters, 710 selfloop transitions, 694 changer transitions 21/1499 dead transitions. [2022-07-13 22:16:13,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 1499 transitions, 16724 flow [2022-07-13 22:16:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-07-13 22:16:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-07-13 22:16:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5482 transitions. [2022-07-13 22:16:13,379 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.44202547976132883 [2022-07-13 22:16:13,379 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 5482 transitions. [2022-07-13 22:16:13,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 5482 transitions. [2022-07-13 22:16:13,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:16:13,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 5482 transitions. [2022-07-13 22:16:13,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 70.28205128205128) internal successors, (5482), 78 states have internal predecessors, (5482), 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-13 22:16:13,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 159.0) internal successors, (12561), 79 states have internal predecessors, (12561), 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-13 22:16:13,476 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 159.0) internal successors, (12561), 79 states have internal predecessors, (12561), 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-13 22:16:13,476 INFO L186 Difference]: Start difference. First operand has 365 places, 744 transitions, 6444 flow. Second operand 78 states and 5482 transitions. [2022-07-13 22:16:13,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 1499 transitions, 16724 flow [2022-07-13 22:16:14,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 1499 transitions, 16144 flow, removed 258 selfloop flow, removed 37 redundant places. [2022-07-13 22:16:14,591 INFO L242 Difference]: Finished difference. Result has 428 places, 1085 transitions, 11941 flow [2022-07-13 22:16:14,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=6082, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=78, PETRI_FLOW=11941, PETRI_PLACES=428, PETRI_TRANSITIONS=1085} [2022-07-13 22:16:14,592 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 286 predicate places. [2022-07-13 22:16:14,593 INFO L495 AbstractCegarLoop]: Abstraction has has 428 places, 1085 transitions, 11941 flow [2022-07-13 22:16:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 64.5) internal successors, (5418), 84 states have internal predecessors, (5418), 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-13 22:16:14,594 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:16:14,594 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-13 22:16:14,622 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-13 22:16:14,807 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-13 22:16:14,807 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-13 22:16:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:16:14,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2087711320, now seen corresponding path program 3 times [2022-07-13 22:16:14,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:16:14,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226502786] [2022-07-13 22:16:14,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:16:14,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:16:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:16:15,562 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-13 22:16:15,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:16:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226502786] [2022-07-13 22:16:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226502786] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:16:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334903142] [2022-07-13 22:16:15,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 22:16:15,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:16:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:16:15,564 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-13 22:16:15,574 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-13 22:16:15,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-13 22:16:15,654 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:16:15,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-13 22:16:15,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:16:15,703 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-13 22:16:15,739 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:16:15,740 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-13 22:16:15,782 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:16:15,782 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-13 22:16:16,104 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 22:16:16,105 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-13 22:16:16,237 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-13 22:16:16,737 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-13 22:16:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:16:17,072 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-13 22:16:17,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:16:17,381 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-13 22:16:17,709 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-13 22:16:17,709 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 36 [2022-07-13 22:16:17,861 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-13 22:16:17,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:16:19,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_275 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) c_~A~0.base) c_~A~0.offset))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or (= c_~max1~0 c_~max2~0) .cse0) (or (= .cse1 c_~max2~0) (not .cse0))))) (< ~M~0 0) (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2)))) (or (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (< c_~max2~0 c_~max3~0))) (<= 1 ~M~0))) is different from false [2022-07-13 22:16:20,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_275 (Array Int Int))) (or (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse0 (< c_~max1~0 .cse1))) (and (or .cse0 (= c_~max1~0 c_~max2~0)) (or (not .cse0) (= .cse1 c_~max2~0))))) (< ~M~0 0) (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max3~0 .cse2)) (< c_~max2~0 .cse2)))) (or (< c_~max2~0 c_~max3~0) (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))))) (<= 1 ~M~0))) is different from false [2022-07-13 22:16:21,295 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_275 (Array Int Int))) (or (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse1 (< c_~max1~0 .cse0))) (and (or (= .cse0 c_~max2~0) (not .cse1)) (or .cse1 (= c_~max1~0 c_~max2~0))))) (< ~M~0 0) (and (or (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |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)) (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2)))))) (<= 1 ~M~0))) is different from false [2022-07-13 22:16:21,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((~M~0 Int) (v_ArrVal_275 (Array Int Int))) (or (and (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |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 .cse0) (not (< c_~max3~0 .cse0))))) (or (forall ((v_ArrVal_276 (Array Int Int)) (v_ArrVal_277 (Array Int Int))) (< c_~max3~0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_277) |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))) (< ~M~0 0) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_275) |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 .cse2))) (and (or (not .cse1) (= .cse2 c_~max2~0)) (or .cse1 (= c_~max1~0 c_~max2~0))))) (<= 1 ~M~0))) is different from false [2022-07-13 22:16:23,411 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:16:23,412 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-13 22:16:23,436 INFO L356 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2022-07-13 22:16:23,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 999 treesize of output 945 [2022-07-13 22:16:23,456 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-07-13 22:16:23,457 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 945 treesize of output 907 [2022-07-13 22:16:23,468 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-13 22:16:23,474 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-13 22:16:23,755 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-13 22:16:23,761 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-13 22:16:25,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 22:16:25,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334903142] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:16:25,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:16:25,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 79 [2022-07-13 22:16:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781704849] [2022-07-13 22:16:25,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:16:25,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-13 22:16:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:16:25,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-13 22:16:25,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=4662, Unknown=17, NotChecked=596, Total=6162 [2022-07-13 22:16:25,735 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 159 [2022-07-13 22:16:25,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 1085 transitions, 11941 flow. Second operand has 79 states, 79 states have (on average 54.77215189873418) internal successors, (4327), 79 states have internal predecessors, (4327), 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-13 22:16:25,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:16:25,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 159 [2022-07-13 22:16:25,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 22:17:04,036 INFO L129 PetriNetUnfolder]: 45203/77379 cut-off events. [2022-07-13 22:17:04,036 INFO L130 PetriNetUnfolder]: For 950519/951817 co-relation queries the response was YES. [2022-07-13 22:17:06,081 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439237 conditions, 77379 events. 45203/77379 cut-off events. For 950519/951817 co-relation queries the response was YES. Maximal size of possible extension queue 4627. Compared 758372 event pairs, 3885 based on Foata normal form. 374/77385 useless extension candidates. Maximal degree in co-relation 439130. Up to 20937 conditions per place. [2022-07-13 22:17:06,617 INFO L132 encePairwiseOnDemand]: 111/159 looper letters, 1809 selfloop transitions, 2188 changer transitions 31/4074 dead transitions. [2022-07-13 22:17:06,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 4074 transitions, 53988 flow [2022-07-13 22:17:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-07-13 22:17:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2022-07-13 22:17:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 8777 transitions. [2022-07-13 22:17:06,632 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.3780908072714741 [2022-07-13 22:17:06,632 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 8777 transitions. [2022-07-13 22:17:06,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 8777 transitions. [2022-07-13 22:17:06,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 22:17:06,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 8777 transitions. [2022-07-13 22:17:06,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 147 states, 146 states have (on average 60.11643835616438) internal successors, (8777), 146 states have internal predecessors, (8777), 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-13 22:17:06,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 147 states, 147 states have (on average 159.0) internal successors, (23373), 147 states have internal predecessors, (23373), 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-13 22:17:06,669 INFO L81 ComplementDD]: Finished complementDD. Result has 147 states, 147 states have (on average 159.0) internal successors, (23373), 147 states have internal predecessors, (23373), 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-13 22:17:06,670 INFO L186 Difference]: Start difference. First operand has 428 places, 1085 transitions, 11941 flow. Second operand 146 states and 8777 transitions. [2022-07-13 22:17:06,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 4074 transitions, 53988 flow [2022-07-13 22:17:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 4074 transitions, 52319 flow, removed 752 selfloop flow, removed 32 redundant places. [2022-07-13 22:17:35,280 INFO L242 Difference]: Finished difference. Result has 622 places, 2870 transitions, 40800 flow [2022-07-13 22:17:35,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=11267, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1085, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=568, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=40800, PETRI_PLACES=622, PETRI_TRANSITIONS=2870} [2022-07-13 22:17:35,282 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 480 predicate places. [2022-07-13 22:17:35,282 INFO L495 AbstractCegarLoop]: Abstraction has has 622 places, 2870 transitions, 40800 flow [2022-07-13 22:17:35,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 54.77215189873418) internal successors, (4327), 79 states have internal predecessors, (4327), 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-13 22:17:35,284 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 22:17:35,284 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-13 22:17:35,302 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-13 22:17:35,490 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-13 22:17:35,490 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-13 22:17:35,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:17:35,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2035229590, now seen corresponding path program 4 times [2022-07-13 22:17:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:17:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757690040] [2022-07-13 22:17:35,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:17:35,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:17:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:17:36,269 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-13 22:17:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:17:36,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757690040] [2022-07-13 22:17:36,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757690040] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:17:36,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75629815] [2022-07-13 22:17:36,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 22:17:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:17:36,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:17:36,271 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-13 22:17:36,272 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-13 22:17:36,348 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 22:17:36,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:17:36,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-13 22:17:36,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:17:37,151 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-13 22:17:37,152 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 36 [2022-07-13 22:17:37,329 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-13 22:17:37,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:17:37,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:17:37,495 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 83 treesize of output 51 [2022-07-13 22:17:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 22:17:38,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75629815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:17:38,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:17:38,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 21] total 57 [2022-07-13 22:17:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98492365] [2022-07-13 22:17:38,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:17:38,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-13 22:17:38,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:17:38,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-13 22:17:38,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=2697, Unknown=0, NotChecked=0, Total=3192 [2022-07-13 22:17:38,406 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 159 [2022-07-13 22:17:38,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 2870 transitions, 40800 flow. Second operand has 57 states, 57 states have (on average 68.50877192982456) internal successors, (3905), 57 states have internal predecessors, (3905), 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-13 22:17:38,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 22:17:38,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 159 [2022-07-13 22:17:38,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand