./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --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/pthread/stack-2.i -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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:39:00,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:39:00,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:39:00,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:39:00,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:39:00,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:39:00,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:39:00,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:39:00,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:39:00,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:39:00,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:39:00,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:39:00,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:39:00,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:39:00,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:39:00,612 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:39:00,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:39:00,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:39:00,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:39:00,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:39:00,621 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:39:00,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:39:00,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:39:00,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:39:00,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:39:00,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:39:00,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:39:00,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:39:00,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:39:00,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:39:00,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:39:00,632 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:39:00,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:39:00,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:39:00,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:39:00,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:39:00,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:39:00,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:39:00,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:39:00,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:39:00,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:39:00,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:39:00,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:39:00,659 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:39:00,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:39:00,660 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:39:00,660 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:39:00,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:39:00,660 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:39:00,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:39:00,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:39:00,661 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:39:00,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:39:00,662 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:39:00,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:39:00,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:39:00,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:39:00,663 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:39:00,664 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:39:00,664 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:39:00,665 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:39:00,665 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:39:00,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:39:00,665 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:39:00,665 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:39:00,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:39:00,666 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:39:00,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:39:00,666 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:39:00,666 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:39:00,666 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:39:00,666 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2022-07-13 21:39:00,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:39:00,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:39:00,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:39:00,883 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:39:00,884 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:39:00,885 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack-2.i [2022-07-13 21:39:00,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3197828/450f631b4867402cac41194e2269b852/FLAG0daec85f2 [2022-07-13 21:39:01,359 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:39:01,359 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2022-07-13 21:39:01,369 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3197828/450f631b4867402cac41194e2269b852/FLAG0daec85f2 [2022-07-13 21:39:01,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3197828/450f631b4867402cac41194e2269b852 [2022-07-13 21:39:01,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:39:01,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:39:01,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:39:01,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:39:01,388 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:39:01,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460fda6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01, skipping insertion in model container [2022-07-13 21:39:01,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:39:01,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:39:01,708 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/pthread/stack-2.i[41520,41533] [2022-07-13 21:39:01,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:39:01,749 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:39:01,774 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/pthread/stack-2.i[41520,41533] [2022-07-13 21:39:01,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:39:01,824 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:39:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01 WrapperNode [2022-07-13 21:39:01,824 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:39:01,825 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:39:01,825 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:39:01,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:39:01,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,862 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-07-13 21:39:01,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:39:01,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:39:01,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:39:01,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:39:01,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:39:01,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:39:01,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:39:01,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:39:01,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (1/1) ... [2022-07-13 21:39:01,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:39:01,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:39:01,919 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 21:39:01,920 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 21:39:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-13 21:39:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-13 21:39:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-13 21:39:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-13 21:39:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:39:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:39:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:39:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:39:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 21:39:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:39:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:39:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:39:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:39:01,948 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 21:39:02,052 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:39:02,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:39:02,250 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:39:02,256 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:39:02,256 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 21:39:02,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:39:02 BoogieIcfgContainer [2022-07-13 21:39:02,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:39:02,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:39:02,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:39:02,273 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:39:02,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:39:01" (1/3) ... [2022-07-13 21:39:02,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55655ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:39:02, skipping insertion in model container [2022-07-13 21:39:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:39:01" (2/3) ... [2022-07-13 21:39:02,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55655ff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:39:02, skipping insertion in model container [2022-07-13 21:39:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:39:02" (3/3) ... [2022-07-13 21:39:02,275 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-07-13 21:39:02,278 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:39:02,285 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:39:02,285 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:39:02,285 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:39:02,357 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-13 21:39:02,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 185 transitions, 386 flow [2022-07-13 21:39:02,451 INFO L129 PetriNetUnfolder]: 10/183 cut-off events. [2022-07-13 21:39:02,451 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-13 21:39:02,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 10/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2022-07-13 21:39:02,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 185 transitions, 386 flow [2022-07-13 21:39:02,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 173 transitions, 355 flow [2022-07-13 21:39:02,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:39:02,470 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@1d705376, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a41f308 [2022-07-13 21:39:02,471 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:39:02,489 INFO L129 PetriNetUnfolder]: 4/138 cut-off events. [2022-07-13 21:39:02,489 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:39:02,489 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:02,490 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] [2022-07-13 21:39:02,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1631243722, now seen corresponding path program 1 times [2022-07-13 21:39:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:02,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933760406] [2022-07-13 21:39:02,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:02,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:02,780 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 21:39:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:02,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933760406] [2022-07-13 21:39:02,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933760406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:02,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:02,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:39:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983075374] [2022-07-13 21:39:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:02,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:39:02,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:02,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:39:02,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:39:02,808 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2022-07-13 21:39:02,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 173 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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 21:39:02,815 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:02,815 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2022-07-13 21:39:02,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:02,961 INFO L129 PetriNetUnfolder]: 91/896 cut-off events. [2022-07-13 21:39:02,962 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-07-13 21:39:02,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 896 events. 91/896 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5283 event pairs, 15 based on Foata normal form. 61/885 useless extension candidates. Maximal degree in co-relation 903. Up to 96 conditions per place. [2022-07-13 21:39:02,969 INFO L132 encePairwiseOnDemand]: 176/185 looper letters, 19 selfloop transitions, 3 changer transitions 0/173 dead transitions. [2022-07-13 21:39:02,969 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 173 transitions, 405 flow [2022-07-13 21:39:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:39:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:39:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-07-13 21:39:02,980 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9441441441441442 [2022-07-13 21:39:02,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-07-13 21:39:02,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-07-13 21:39:02,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:02,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-07-13 21:39:02,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 21:39:02,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:03,005 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:03,007 INFO L186 Difference]: Start difference. First operand has 170 places, 173 transitions, 355 flow. Second operand 3 states and 524 transitions. [2022-07-13 21:39:03,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 173 transitions, 405 flow [2022-07-13 21:39:03,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 173 transitions, 397 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-13 21:39:03,013 INFO L242 Difference]: Finished difference. Result has 166 places, 166 transitions, 351 flow [2022-07-13 21:39:03,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=166, PETRI_TRANSITIONS=166} [2022-07-13 21:39:03,017 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2022-07-13 21:39:03,018 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 166 transitions, 351 flow [2022-07-13 21:39:03,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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 21:39:03,018 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:03,019 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] [2022-07-13 21:39:03,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:39:03,019 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:03,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:03,020 INFO L85 PathProgramCache]: Analyzing trace with hash -959432383, now seen corresponding path program 1 times [2022-07-13 21:39:03,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:03,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093780337] [2022-07-13 21:39:03,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:03,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:03,120 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 21:39:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:03,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093780337] [2022-07-13 21:39:03,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093780337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:03,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:03,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:39:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056443337] [2022-07-13 21:39:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:03,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:39:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:03,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:39:03,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:39:03,126 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 185 [2022-07-13 21:39:03,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 166 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 21:39:03,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:03,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 185 [2022-07-13 21:39:03,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:03,188 INFO L129 PetriNetUnfolder]: 21/425 cut-off events. [2022-07-13 21:39:03,188 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-13 21:39:03,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 425 events. 21/425 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1379 event pairs, 4 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 376. Up to 16 conditions per place. [2022-07-13 21:39:03,191 INFO L132 encePairwiseOnDemand]: 182/185 looper letters, 9 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2022-07-13 21:39:03,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 169 transitions, 379 flow [2022-07-13 21:39:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:39:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:39:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-07-13 21:39:03,194 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9405405405405406 [2022-07-13 21:39:03,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-07-13 21:39:03,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-07-13 21:39:03,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:03,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-07-13 21:39:03,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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 21:39:03,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:03,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:03,198 INFO L186 Difference]: Start difference. First operand has 166 places, 166 transitions, 351 flow. Second operand 3 states and 522 transitions. [2022-07-13 21:39:03,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 169 transitions, 379 flow [2022-07-13 21:39:03,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 169 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:39:03,203 INFO L242 Difference]: Finished difference. Result has 168 places, 166 transitions, 356 flow [2022-07-13 21:39:03,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2022-07-13 21:39:03,204 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2022-07-13 21:39:03,204 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 356 flow [2022-07-13 21:39:03,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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 21:39:03,205 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:03,205 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] [2022-07-13 21:39:03,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 21:39:03,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:03,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1579701380, now seen corresponding path program 1 times [2022-07-13 21:39:03,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:03,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327657443] [2022-07-13 21:39:03,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:03,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:03,299 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 21:39:03,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:03,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327657443] [2022-07-13 21:39:03,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327657443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:03,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:03,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 21:39:03,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270654245] [2022-07-13 21:39:03,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:03,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 21:39:03,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 21:39:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 21:39:03,304 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2022-07-13 21:39:03,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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 21:39:03,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:03,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2022-07-13 21:39:03,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:03,387 INFO L129 PetriNetUnfolder]: 41/522 cut-off events. [2022-07-13 21:39:03,387 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-13 21:39:03,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 522 events. 41/522 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2035 event pairs, 13 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 403. Up to 37 conditions per place. [2022-07-13 21:39:03,391 INFO L132 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 4 changer transitions 0/174 dead transitions. [2022-07-13 21:39:03,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 174 transitions, 417 flow [2022-07-13 21:39:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 21:39:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-13 21:39:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 681 transitions. [2022-07-13 21:39:03,393 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9202702702702703 [2022-07-13 21:39:03,393 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 681 transitions. [2022-07-13 21:39:03,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 681 transitions. [2022-07-13 21:39:03,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:03,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 681 transitions. [2022-07-13 21:39:03,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.25) internal successors, (681), 4 states have internal predecessors, (681), 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 21:39:03,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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 21:39:03,398 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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 21:39:03,398 INFO L186 Difference]: Start difference. First operand has 168 places, 166 transitions, 356 flow. Second operand 4 states and 681 transitions. [2022-07-13 21:39:03,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 174 transitions, 417 flow [2022-07-13 21:39:03,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 174 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:39:03,403 INFO L242 Difference]: Finished difference. Result has 172 places, 169 transitions, 382 flow [2022-07-13 21:39:03,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=172, PETRI_TRANSITIONS=169} [2022-07-13 21:39:03,405 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 2 predicate places. [2022-07-13 21:39:03,405 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 169 transitions, 382 flow [2022-07-13 21:39:03,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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 21:39:03,405 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:03,406 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:39:03,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 21:39:03,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:03,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1819207550, now seen corresponding path program 1 times [2022-07-13 21:39:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:03,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138060788] [2022-07-13 21:39:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:03,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:03,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:39:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138060788] [2022-07-13 21:39:03,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138060788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:39:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283246881] [2022-07-13 21:39:03,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:03,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:39:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:39:03,510 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 21:39:03,536 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 21:39:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:03,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:39:03,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:39:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:39:03,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:39:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:39:03,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283246881] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:39:03,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:39:03,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:39:03,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550790734] [2022-07-13 21:39:03,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:39:03,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:39:03,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:03,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:39:03,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:39:03,905 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 185 [2022-07-13 21:39:03,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 169 transitions, 382 flow. Second operand has 10 states, 10 states have (on average 164.5) internal successors, (1645), 10 states have internal predecessors, (1645), 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 21:39:03,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:03,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 185 [2022-07-13 21:39:03,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:04,156 INFO L129 PetriNetUnfolder]: 187/1846 cut-off events. [2022-07-13 21:39:04,156 INFO L130 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2022-07-13 21:39:04,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2409 conditions, 1846 events. 187/1846 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 12169 event pairs, 33 based on Foata normal form. 8/1747 useless extension candidates. Maximal degree in co-relation 1925. Up to 135 conditions per place. [2022-07-13 21:39:04,166 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 48 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2022-07-13 21:39:04,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 215 transitions, 631 flow [2022-07-13 21:39:04,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 21:39:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-13 21:39:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1684 transitions. [2022-07-13 21:39:04,169 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9102702702702703 [2022-07-13 21:39:04,169 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1684 transitions. [2022-07-13 21:39:04,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1684 transitions. [2022-07-13 21:39:04,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:04,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1684 transitions. [2022-07-13 21:39:04,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 168.4) internal successors, (1684), 10 states have internal predecessors, (1684), 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 21:39:04,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 185.0) internal successors, (2035), 11 states have internal predecessors, (2035), 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 21:39:04,175 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 185.0) internal successors, (2035), 11 states have internal predecessors, (2035), 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 21:39:04,176 INFO L186 Difference]: Start difference. First operand has 172 places, 169 transitions, 382 flow. Second operand 10 states and 1684 transitions. [2022-07-13 21:39:04,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 215 transitions, 631 flow [2022-07-13 21:39:04,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 215 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:39:04,179 INFO L242 Difference]: Finished difference. Result has 183 places, 182 transitions, 474 flow [2022-07-13 21:39:04,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=474, PETRI_PLACES=183, PETRI_TRANSITIONS=182} [2022-07-13 21:39:04,180 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 13 predicate places. [2022-07-13 21:39:04,180 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 182 transitions, 474 flow [2022-07-13 21:39:04,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 164.5) internal successors, (1645), 10 states have internal predecessors, (1645), 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 21:39:04,181 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:04,181 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] [2022-07-13 21:39:04,197 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 21:39:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:39:04,396 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1038169264, now seen corresponding path program 1 times [2022-07-13 21:39:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:04,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349158867] [2022-07-13 21:39:04,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:04,456 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 21:39:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:04,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349158867] [2022-07-13 21:39:04,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349158867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:04,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:04,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:39:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031341522] [2022-07-13 21:39:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:04,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:39:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:04,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:39:04,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:39:04,459 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2022-07-13 21:39:04,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 182 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 21:39:04,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:04,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2022-07-13 21:39:04,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:04,560 INFO L129 PetriNetUnfolder]: 53/1081 cut-off events. [2022-07-13 21:39:04,560 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-07-13 21:39:04,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 1081 events. 53/1081 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4704 event pairs, 10 based on Foata normal form. 11/1047 useless extension candidates. Maximal degree in co-relation 843. Up to 46 conditions per place. [2022-07-13 21:39:04,565 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 12 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2022-07-13 21:39:04,565 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 179 transitions, 485 flow [2022-07-13 21:39:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:39:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:39:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2022-07-13 21:39:04,567 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9135135135135135 [2022-07-13 21:39:04,567 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2022-07-13 21:39:04,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2022-07-13 21:39:04,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:04,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2022-07-13 21:39:04,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 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 21:39:04,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:04,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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 21:39:04,570 INFO L186 Difference]: Start difference. First operand has 183 places, 182 transitions, 474 flow. Second operand 3 states and 507 transitions. [2022-07-13 21:39:04,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 179 transitions, 485 flow [2022-07-13 21:39:04,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 179 transitions, 473 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-07-13 21:39:04,574 INFO L242 Difference]: Finished difference. Result has 183 places, 177 transitions, 442 flow [2022-07-13 21:39:04,574 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=183, PETRI_TRANSITIONS=177} [2022-07-13 21:39:04,574 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 13 predicate places. [2022-07-13 21:39:04,575 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 177 transitions, 442 flow [2022-07-13 21:39:04,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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 21:39:04,575 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:04,575 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 21:39:04,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:39:04,576 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash 769384455, now seen corresponding path program 1 times [2022-07-13 21:39:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:04,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896944607] [2022-07-13 21:39:04,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:04,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:04,636 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 21:39:04,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:04,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896944607] [2022-07-13 21:39:04,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896944607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:04,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:04,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 21:39:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132820966] [2022-07-13 21:39:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:04,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 21:39:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 21:39:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 21:39:04,639 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2022-07-13 21:39:04,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 177 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 154.28571428571428) internal successors, (1080), 7 states have internal predecessors, (1080), 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 21:39:04,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:04,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2022-07-13 21:39:04,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:04,848 INFO L129 PetriNetUnfolder]: 119/1236 cut-off events. [2022-07-13 21:39:04,849 INFO L130 PetriNetUnfolder]: For 129/129 co-relation queries the response was YES. [2022-07-13 21:39:04,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1236 events. 119/1236 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6102 event pairs, 19 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 1239. Up to 178 conditions per place. [2022-07-13 21:39:04,855 INFO L132 encePairwiseOnDemand]: 174/185 looper letters, 49 selfloop transitions, 13 changer transitions 0/205 dead transitions. [2022-07-13 21:39:04,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 205 transitions, 651 flow [2022-07-13 21:39:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:39:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:39:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1425 transitions. [2022-07-13 21:39:04,858 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8558558558558559 [2022-07-13 21:39:04,858 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1425 transitions. [2022-07-13 21:39:04,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1425 transitions. [2022-07-13 21:39:04,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:04,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1425 transitions. [2022-07-13 21:39:04,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 158.33333333333334) internal successors, (1425), 9 states have internal predecessors, (1425), 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 21:39:04,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 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 21:39:04,864 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 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 21:39:04,864 INFO L186 Difference]: Start difference. First operand has 183 places, 177 transitions, 442 flow. Second operand 9 states and 1425 transitions. [2022-07-13 21:39:04,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 205 transitions, 651 flow [2022-07-13 21:39:04,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 205 transitions, 647 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:39:04,882 INFO L242 Difference]: Finished difference. Result has 195 places, 184 transitions, 526 flow [2022-07-13 21:39:04,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=195, PETRI_TRANSITIONS=184} [2022-07-13 21:39:04,884 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 25 predicate places. [2022-07-13 21:39:04,884 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 184 transitions, 526 flow [2022-07-13 21:39:04,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 154.28571428571428) internal successors, (1080), 7 states have internal predecessors, (1080), 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 21:39:04,885 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:04,885 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, 1, 1, 1, 1] [2022-07-13 21:39:04,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:39:04,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:04,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:04,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1194335221, now seen corresponding path program 1 times [2022-07-13 21:39:04,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:04,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744387007] [2022-07-13 21:39:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:05,695 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 21:39:05,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:05,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744387007] [2022-07-13 21:39:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744387007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:05,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-13 21:39:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079985415] [2022-07-13 21:39:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:05,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-13 21:39:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-13 21:39:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-07-13 21:39:05,699 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 185 [2022-07-13 21:39:05,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 184 transitions, 526 flow. Second operand has 28 states, 28 states have (on average 95.57142857142857) internal successors, (2676), 28 states have internal predecessors, (2676), 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 21:39:05,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:05,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 185 [2022-07-13 21:39:05,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:08,129 INFO L129 PetriNetUnfolder]: 1048/4073 cut-off events. [2022-07-13 21:39:08,129 INFO L130 PetriNetUnfolder]: For 605/608 co-relation queries the response was YES. [2022-07-13 21:39:08,167 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7610 conditions, 4073 events. 1048/4073 cut-off events. For 605/608 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 29516 event pairs, 351 based on Foata normal form. 5/3948 useless extension candidates. Maximal degree in co-relation 4256. Up to 1516 conditions per place. [2022-07-13 21:39:08,178 INFO L132 encePairwiseOnDemand]: 148/185 looper letters, 281 selfloop transitions, 43 changer transitions 5/418 dead transitions. [2022-07-13 21:39:08,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 418 transitions, 1787 flow [2022-07-13 21:39:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-13 21:39:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-07-13 21:39:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3665 transitions. [2022-07-13 21:39:08,190 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5503003003003003 [2022-07-13 21:39:08,190 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 3665 transitions. [2022-07-13 21:39:08,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 3665 transitions. [2022-07-13 21:39:08,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:08,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 3665 transitions. [2022-07-13 21:39:08,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 101.80555555555556) internal successors, (3665), 36 states have internal predecessors, (3665), 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 21:39:08,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 185.0) internal successors, (6845), 37 states have internal predecessors, (6845), 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 21:39:08,205 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 185.0) internal successors, (6845), 37 states have internal predecessors, (6845), 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 21:39:08,205 INFO L186 Difference]: Start difference. First operand has 195 places, 184 transitions, 526 flow. Second operand 36 states and 3665 transitions. [2022-07-13 21:39:08,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 418 transitions, 1787 flow [2022-07-13 21:39:08,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 418 transitions, 1776 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-13 21:39:08,212 INFO L242 Difference]: Finished difference. Result has 254 places, 220 transitions, 841 flow [2022-07-13 21:39:08,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=841, PETRI_PLACES=254, PETRI_TRANSITIONS=220} [2022-07-13 21:39:08,213 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 84 predicate places. [2022-07-13 21:39:08,213 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 220 transitions, 841 flow [2022-07-13 21:39:08,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 95.57142857142857) internal successors, (2676), 28 states have internal predecessors, (2676), 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 21:39:08,214 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:08,214 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, 1, 1, 1, 1] [2022-07-13 21:39:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 21:39:08,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1145094813, now seen corresponding path program 2 times [2022-07-13 21:39:08,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:08,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341691724] [2022-07-13 21:39:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:08,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:39:08,886 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 21:39:08,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:39:08,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341691724] [2022-07-13 21:39:08,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341691724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:39:08,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:39:08,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-13 21:39:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004487433] [2022-07-13 21:39:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:39:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-13 21:39:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:39:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-13 21:39:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-07-13 21:39:08,889 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 185 [2022-07-13 21:39:08,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 220 transitions, 841 flow. Second operand has 27 states, 27 states have (on average 96.66666666666667) internal successors, (2610), 27 states have internal predecessors, (2610), 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 21:39:08,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:39:08,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 185 [2022-07-13 21:39:08,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:39:13,378 INFO L129 PetriNetUnfolder]: 1419/5642 cut-off events. [2022-07-13 21:39:13,378 INFO L130 PetriNetUnfolder]: For 1865/1865 co-relation queries the response was YES. [2022-07-13 21:39:13,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11906 conditions, 5642 events. 1419/5642 cut-off events. For 1865/1865 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 43147 event pairs, 122 based on Foata normal form. 16/5566 useless extension candidates. Maximal degree in co-relation 10056. Up to 1303 conditions per place. [2022-07-13 21:39:13,419 INFO L132 encePairwiseOnDemand]: 151/185 looper letters, 334 selfloop transitions, 89 changer transitions 7/519 dead transitions. [2022-07-13 21:39:13,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 519 transitions, 2707 flow [2022-07-13 21:39:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-13 21:39:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-07-13 21:39:13,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 5562 transitions. [2022-07-13 21:39:13,428 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5466339066339067 [2022-07-13 21:39:13,428 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 5562 transitions. [2022-07-13 21:39:13,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 5562 transitions. [2022-07-13 21:39:13,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:39:13,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 5562 transitions. [2022-07-13 21:39:13,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 101.12727272727273) internal successors, (5562), 55 states have internal predecessors, (5562), 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 21:39:13,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 185.0) internal successors, (10360), 56 states have internal predecessors, (10360), 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 21:39:13,450 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 185.0) internal successors, (10360), 56 states have internal predecessors, (10360), 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 21:39:13,450 INFO L186 Difference]: Start difference. First operand has 254 places, 220 transitions, 841 flow. Second operand 55 states and 5562 transitions. [2022-07-13 21:39:13,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 519 transitions, 2707 flow [2022-07-13 21:39:13,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 519 transitions, 2685 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-07-13 21:39:13,465 INFO L242 Difference]: Finished difference. Result has 339 places, 270 transitions, 1475 flow [2022-07-13 21:39:13,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=1475, PETRI_PLACES=339, PETRI_TRANSITIONS=270} [2022-07-13 21:39:13,466 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 169 predicate places. [2022-07-13 21:39:13,466 INFO L495 AbstractCegarLoop]: Abstraction has has 339 places, 270 transitions, 1475 flow [2022-07-13 21:39:13,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 96.66666666666667) internal successors, (2610), 27 states have internal predecessors, (2610), 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 21:39:13,467 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:39:13,467 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:39:13,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 21:39:13,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-13 21:39:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:39:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash -825862227, now seen corresponding path program 1 times [2022-07-13 21:39:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:39:13,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868187091] [2022-07-13 21:39:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:39:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:39:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:39:13,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:39:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:39:13,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:39:13,556 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:39:13,557 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-13 21:39:13,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-07-13 21:39:13,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-13 21:39:13,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-13 21:39:13,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-13 21:39:13,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:39:13,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 21:39:13,560 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:39:13,564 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-13 21:39:13,565 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 21:39:13,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 09:39:13 BasicIcfg [2022-07-13 21:39:13,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 21:39:13,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 21:39:13,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 21:39:13,707 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 21:39:13,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:39:02" (3/4) ... [2022-07-13 21:39:13,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 21:39:13,799 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 21:39:13,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 21:39:13,800 INFO L158 Benchmark]: Toolchain (without parser) took 12415.37ms. Allocated memory was 81.8MB in the beginning and 520.1MB in the end (delta: 438.3MB). Free memory was 41.4MB in the beginning and 317.0MB in the end (delta: -275.6MB). Peak memory consumption was 165.7MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,800 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:39:13,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.41ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 41.2MB in the beginning and 53.6MB in the end (delta: -12.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.85ms. Allocated memory is still 98.6MB. Free memory was 53.6MB in the beginning and 50.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,801 INFO L158 Benchmark]: Boogie Preprocessor took 18.55ms. Allocated memory is still 98.6MB. Free memory was 50.9MB in the beginning and 49.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 21:39:13,802 INFO L158 Benchmark]: RCFGBuilder took 376.13ms. Allocated memory is still 98.6MB. Free memory was 49.4MB in the beginning and 33.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,802 INFO L158 Benchmark]: TraceAbstraction took 11447.04ms. Allocated memory was 98.6MB in the beginning and 520.1MB in the end (delta: 421.5MB). Free memory was 32.6MB in the beginning and 352.6MB in the end (delta: -320.0MB). Peak memory consumption was 224.1MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,802 INFO L158 Benchmark]: Witness Printer took 93.25ms. Allocated memory is still 520.1MB. Free memory was 352.6MB in the beginning and 317.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-13 21:39:13,804 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 439.41ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 41.2MB in the beginning and 53.6MB in the end (delta: -12.4MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.85ms. Allocated memory is still 98.6MB. Free memory was 53.6MB in the beginning and 50.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.55ms. Allocated memory is still 98.6MB. Free memory was 50.9MB in the beginning and 49.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.13ms. Allocated memory is still 98.6MB. Free memory was 49.4MB in the beginning and 33.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11447.04ms. Allocated memory was 98.6MB in the beginning and 520.1MB in the end (delta: 421.5MB). Free memory was 32.6MB in the beginning and 352.6MB in the end (delta: -320.0MB). Peak memory consumption was 224.1MB. Max. memory is 16.1GB. * Witness Printer took 93.25ms. Allocated memory is still 520.1MB. Free memory was 352.6MB in the beginning and 317.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; VAL [top=0] [L936] 0 static unsigned int arr[(5)]; VAL [arr={5:0}, top=0] [L937] 0 pthread_mutex_t m; VAL [arr={5:0}, m={6:0}, top=0] [L938] 0 _Bool flag=(0); VAL [arr={5:0}, flag=0, m={6:0}, top=0] [L1021] 0 pthread_t id1, id2; VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=13, top=0] [L990] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L991] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294967300, arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, tmp=4, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=14, top=0] [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={5:0}, cond=1, flag=0, m={6:0}, top=0] [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) VAL [\old(x)=4, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=4] [L969] CALL, EXPR 1 get_top() [L954] 1 return top; VAL [\result=0, arr={5:0}, flag=0, m={6:0}, top=0] [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x VAL [\old(x)=4, arr={5:0}, flag=0, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=4] [L970] CALL 1 inc_top() [L946] 1 top++ VAL [arr={5:0}, flag=0, m={6:0}, top=1] [L970] RET 1 inc_top() [L972] 1 return 0; VAL [\old(x)=4, \result=0, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=1, x=4] [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, push(arr,tmp)=0, tmp=4, top=1] [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, tmp=4, top=1] [L1006] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, m={6:0}, top=1] [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1010] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=1, \result=0, arr={5:0}, flag=1, m={6:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) VAL [arr={5:0}, flag=1, get_top()=1, m={6:0}, stack={5:0}, stack={5:0}, top=1] [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={5:0}, flag=1, m={6:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] VAL [arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, stack[get_top()]=4, top=0] [L984] 2 return stack[get_top()]; VAL [\result=4, arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, stack[get_top()]=4, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, pop(arr)=4, top=0] [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1010] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 VAL [arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, top=0] [L979] 2 return (-2); VAL [\result=-2, arr={5:0}, flag=1, m={6:0}, stack={5:0}, stack={5:0}, top=0] [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, pop(arr)=-2, top=0] [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={5:0}, flag=1, m={6:0}, top=0] - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 294 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1341 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1341 mSDsluCounter, 3196 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3564 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5113 IncrementalHoareTripleChecker+Invalid, 5190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 237 mSDtfsCounter, 5113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 232 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1475occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1035 ConstructedInterpolants, 0 QuantifiedInterpolants, 6790 SizeOfPredicates, 2 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 12/66 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 21:39:13,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE