./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 09:59:17,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 09:59:17,199 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 09:59:17,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 09:59:17,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 09:59:17,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 09:59:17,236 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 09:59:17,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 09:59:17,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 09:59:17,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 09:59:17,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 09:59:17,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 09:59:17,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 09:59:17,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 09:59:17,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 09:59:17,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 09:59:17,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 09:59:17,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 09:59:17,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 09:59:17,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 09:59:17,258 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 09:59:17,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 09:59:17,260 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 09:59:17,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 09:59:17,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 09:59:17,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 09:59:17,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 09:59:17,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 09:59:17,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 09:59:17,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 09:59:17,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 09:59:17,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 09:59:17,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 09:59:17,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 09:59:17,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 09:59:17,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 09:59:17,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 09:59:17,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 09:59:17,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 09:59:17,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 09:59:17,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 09:59:17,276 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 09:59:17,277 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 09:59:17,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 09:59:17,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 09:59:17,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 09:59:17,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 09:59:17,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 09:59:17,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 09:59:17,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 09:59:17,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 09:59:17,302 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 09:59:17,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 09:59:17,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 09:59:17,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 09:59:17,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 09:59:17,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 09:59:17,305 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 09:59:17,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 09:59:17,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 09:59:17,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 09:59:17,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 09:59:17,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:59:17,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 09:59:17,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 09:59:17,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 09:59:17,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 09:59:17,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 09:59:17,316 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 09:59:17,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 09:59:17,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 09:59:17,317 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2022-07-12 09:59:17,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 09:59:17,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 09:59:17,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 09:59:17,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 09:59:17,526 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 09:59:17,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longest-1.i [2022-07-12 09:59:17,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2072f05/37232c232c034aad9e317b87343ff3e7/FLAGb05afc297 [2022-07-12 09:59:17,956 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 09:59:17,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longest-1.i [2022-07-12 09:59:18,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2072f05/37232c232c034aad9e317b87343ff3e7/FLAGb05afc297 [2022-07-12 09:59:18,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c2072f05/37232c232c034aad9e317b87343ff3e7 [2022-07-12 09:59:18,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 09:59:18,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 09:59:18,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 09:59:18,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 09:59:18,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 09:59:18,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74586730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18, skipping insertion in model container [2022-07-12 09:59:18,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 09:59:18,345 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 09:59:18,580 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_longest-1.i[41530,41543] [2022-07-12 09:59:18,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:59:18,607 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 09:59:18,639 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_longest-1.i[41530,41543] [2022-07-12 09:59:18,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 09:59:18,691 INFO L208 MainTranslator]: Completed translation [2022-07-12 09:59:18,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18 WrapperNode [2022-07-12 09:59:18,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 09:59:18,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 09:59:18,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 09:59:18,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 09:59:18,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,751 INFO L137 Inliner]: procedures = 277, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 157 [2022-07-12 09:59:18,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 09:59:18,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 09:59:18,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 09:59:18,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 09:59:18,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 09:59:18,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 09:59:18,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 09:59:18,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 09:59:18,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (1/1) ... [2022-07-12 09:59:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 09:59:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:59:18,829 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-12 09:59:18,843 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-12 09:59:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-07-12 09:59:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-07-12 09:59:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-07-12 09:59:18,869 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-07-12 09:59:18,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 09:59:18,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 09:59:18,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 09:59:18,871 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 09:59:19,029 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 09:59:19,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 09:59:19,204 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 09:59:19,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 09:59:19,211 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 09:59:19,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:59:19 BoogieIcfgContainer [2022-07-12 09:59:19,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 09:59:19,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 09:59:19,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 09:59:19,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 09:59:19,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 09:59:18" (1/3) ... [2022-07-12 09:59:19,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fd063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:59:19, skipping insertion in model container [2022-07-12 09:59:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 09:59:18" (2/3) ... [2022-07-12 09:59:19,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9fd063d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 09:59:19, skipping insertion in model container [2022-07-12 09:59:19,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:59:19" (3/3) ... [2022-07-12 09:59:19,219 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2022-07-12 09:59:19,223 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 09:59:19,229 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 09:59:19,230 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 09:59:19,230 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 09:59:19,276 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 09:59:19,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 178 places, 181 transitions, 378 flow [2022-07-12 09:59:19,343 INFO L129 PetriNetUnfolder]: 10/179 cut-off events. [2022-07-12 09:59:19,343 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 09:59:19,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 179 events. 10/179 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 433 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 135. Up to 3 conditions per place. [2022-07-12 09:59:19,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 181 transitions, 378 flow [2022-07-12 09:59:19,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 169 transitions, 347 flow [2022-07-12 09:59:19,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 09:59:19,363 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@7995cf88, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2df3a059 [2022-07-12 09:59:19,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 09:59:19,380 INFO L129 PetriNetUnfolder]: 4/135 cut-off events. [2022-07-12 09:59:19,380 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 09:59:19,380 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:19,381 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] [2022-07-12 09:59:19,381 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:19,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 157162230, now seen corresponding path program 1 times [2022-07-12 09:59:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:19,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092905405] [2022-07-12 09:59:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:19,672 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-12 09:59:19,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:19,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092905405] [2022-07-12 09:59:19,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092905405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:19,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:19,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 09:59:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133824107] [2022-07-12 09:59:19,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:19,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:59:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:59:19,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 09:59:19,712 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 181 [2022-07-12 09:59:19,715 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 169 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-12 09:59:19,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:19,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 181 [2022-07-12 09:59:19,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:19,832 INFO L129 PetriNetUnfolder]: 91/892 cut-off events. [2022-07-12 09:59:19,832 INFO L130 PetriNetUnfolder]: For 46/46 co-relation queries the response was YES. [2022-07-12 09:59:19,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 892 events. 91/892 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5312 event pairs, 15 based on Foata normal form. 61/880 useless extension candidates. Maximal degree in co-relation 903. Up to 96 conditions per place. [2022-07-12 09:59:19,840 INFO L132 encePairwiseOnDemand]: 172/181 looper letters, 19 selfloop transitions, 3 changer transitions 0/169 dead transitions. [2022-07-12 09:59:19,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 169 transitions, 397 flow [2022-07-12 09:59:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:59:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 09:59:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-07-12 09:59:19,856 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9429097605893186 [2022-07-12 09:59:19,857 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-07-12 09:59:19,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-07-12 09:59:19,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:19,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-07-12 09:59:19,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-12 09:59:19,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:19,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:19,872 INFO L186 Difference]: Start difference. First operand has 166 places, 169 transitions, 347 flow. Second operand 3 states and 512 transitions. [2022-07-12 09:59:19,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 169 transitions, 397 flow [2022-07-12 09:59:19,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 169 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 09:59:19,879 INFO L242 Difference]: Finished difference. Result has 162 places, 162 transitions, 343 flow [2022-07-12 09:59:19,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=162, PETRI_TRANSITIONS=162} [2022-07-12 09:59:19,883 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -4 predicate places. [2022-07-12 09:59:19,883 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 162 transitions, 343 flow [2022-07-12 09:59:19,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 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-12 09:59:19,884 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:19,884 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-12 09:59:19,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 09:59:19,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:19,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:19,885 INFO L85 PathProgramCache]: Analyzing trace with hash 443184425, now seen corresponding path program 1 times [2022-07-12 09:59:19,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:19,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823009631] [2022-07-12 09:59:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:19,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:19,942 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-12 09:59:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:19,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823009631] [2022-07-12 09:59:19,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823009631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:19,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:19,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 09:59:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70610068] [2022-07-12 09:59:19,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:19,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:59:19,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:19,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:59:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 09:59:19,946 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 181 [2022-07-12 09:59:19,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 162 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-12 09:59:19,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:19,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 181 [2022-07-12 09:59:19,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:19,998 INFO L129 PetriNetUnfolder]: 21/421 cut-off events. [2022-07-12 09:59:19,998 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-12 09:59:20,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 421 events. 21/421 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1378 event pairs, 4 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 376. Up to 16 conditions per place. [2022-07-12 09:59:20,001 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 9 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-07-12 09:59:20,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 165 transitions, 371 flow [2022-07-12 09:59:20,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:59:20,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 09:59:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-07-12 09:59:20,003 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9392265193370166 [2022-07-12 09:59:20,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2022-07-12 09:59:20,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2022-07-12 09:59:20,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:20,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2022-07-12 09:59:20,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-12 09:59:20,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:20,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:20,006 INFO L186 Difference]: Start difference. First operand has 162 places, 162 transitions, 343 flow. Second operand 3 states and 510 transitions. [2022-07-12 09:59:20,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 165 transitions, 371 flow [2022-07-12 09:59:20,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 165 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 09:59:20,013 INFO L242 Difference]: Finished difference. Result has 164 places, 162 transitions, 348 flow [2022-07-12 09:59:20,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2022-07-12 09:59:20,014 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, -2 predicate places. [2022-07-12 09:59:20,014 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 348 flow [2022-07-12 09:59:20,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 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-12 09:59:20,015 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:20,015 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] [2022-07-12 09:59:20,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 09:59:20,016 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2134398008, now seen corresponding path program 1 times [2022-07-12 09:59:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278155298] [2022-07-12 09:59:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:20,103 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-12 09:59:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:20,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278155298] [2022-07-12 09:59:20,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278155298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:20,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:20,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 09:59:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880939097] [2022-07-12 09:59:20,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 09:59:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 09:59:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 09:59:20,109 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 181 [2022-07-12 09:59:20,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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-12 09:59:20,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:20,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 181 [2022-07-12 09:59:20,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:20,199 INFO L129 PetriNetUnfolder]: 41/518 cut-off events. [2022-07-12 09:59:20,200 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-07-12 09:59:20,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 518 events. 41/518 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2041 event pairs, 13 based on Foata normal form. 0/487 useless extension candidates. Maximal degree in co-relation 403. Up to 37 conditions per place. [2022-07-12 09:59:20,203 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 16 selfloop transitions, 4 changer transitions 0/170 dead transitions. [2022-07-12 09:59:20,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 170 transitions, 409 flow [2022-07-12 09:59:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 09:59:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-12 09:59:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2022-07-12 09:59:20,205 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9185082872928176 [2022-07-12 09:59:20,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2022-07-12 09:59:20,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2022-07-12 09:59:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:20,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2022-07-12 09:59:20,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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-12 09:59:20,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:59:20,211 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 09:59:20,211 INFO L186 Difference]: Start difference. First operand has 164 places, 162 transitions, 348 flow. Second operand 4 states and 665 transitions. [2022-07-12 09:59:20,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 170 transitions, 409 flow [2022-07-12 09:59:20,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 09:59:20,216 INFO L242 Difference]: Finished difference. Result has 168 places, 165 transitions, 374 flow [2022-07-12 09:59:20,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2022-07-12 09:59:20,218 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 2 predicate places. [2022-07-12 09:59:20,218 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 374 flow [2022-07-12 09:59:20,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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-12 09:59:20,218 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:20,219 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] [2022-07-12 09:59:20,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 09:59:20,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:20,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:20,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2007153870, now seen corresponding path program 1 times [2022-07-12 09:59:20,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:20,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685873248] [2022-07-12 09:59:20,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:20,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:20,288 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-12 09:59:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:20,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685873248] [2022-07-12 09:59:20,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685873248] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 09:59:20,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023149722] [2022-07-12 09:59:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 09:59:20,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 09:59:20,291 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-12 09:59:20,292 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-12 09:59:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:20,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 09:59:20,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 09:59:20,598 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-12 09:59:20,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 09:59:20,693 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-12 09:59:20,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023149722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 09:59:20,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 09:59:20,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 09:59:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198375957] [2022-07-12 09:59:20,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 09:59:20,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 09:59:20,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 09:59:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 09:59:20,696 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 181 [2022-07-12 09:59:20,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 374 flow. Second operand has 10 states, 10 states have (on average 160.5) internal successors, (1605), 10 states have internal predecessors, (1605), 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-12 09:59:20,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:20,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 181 [2022-07-12 09:59:20,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:21,009 INFO L129 PetriNetUnfolder]: 176/1670 cut-off events. [2022-07-12 09:59:21,010 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2022-07-12 09:59:21,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1670 events. 176/1670 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10766 event pairs, 28 based on Foata normal form. 9/1586 useless extension candidates. Maximal degree in co-relation 1750. Up to 135 conditions per place. [2022-07-12 09:59:21,023 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 48 selfloop transitions, 14 changer transitions 0/211 dead transitions. [2022-07-12 09:59:21,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 211 transitions, 623 flow [2022-07-12 09:59:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 09:59:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 09:59:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1644 transitions. [2022-07-12 09:59:21,027 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9082872928176795 [2022-07-12 09:59:21,027 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1644 transitions. [2022-07-12 09:59:21,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1644 transitions. [2022-07-12 09:59:21,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:21,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1644 transitions. [2022-07-12 09:59:21,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 164.4) internal successors, (1644), 10 states have internal predecessors, (1644), 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-12 09:59:21,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 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-12 09:59:21,038 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 181.0) internal successors, (1991), 11 states have internal predecessors, (1991), 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-12 09:59:21,039 INFO L186 Difference]: Start difference. First operand has 168 places, 165 transitions, 374 flow. Second operand 10 states and 1644 transitions. [2022-07-12 09:59:21,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 211 transitions, 623 flow [2022-07-12 09:59:21,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 211 transitions, 621 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 09:59:21,044 INFO L242 Difference]: Finished difference. Result has 179 places, 178 transitions, 466 flow [2022-07-12 09:59:21,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=466, PETRI_PLACES=179, PETRI_TRANSITIONS=178} [2022-07-12 09:59:21,045 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places. [2022-07-12 09:59:21,045 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 178 transitions, 466 flow [2022-07-12 09:59:21,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 160.5) internal successors, (1605), 10 states have internal predecessors, (1605), 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-12 09:59:21,047 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:21,047 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] [2022-07-12 09:59:21,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 09:59:21,262 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-12 09:59:21,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:21,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 407932096, now seen corresponding path program 1 times [2022-07-12 09:59:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:21,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836020645] [2022-07-12 09:59:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 09:59:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:21,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836020645] [2022-07-12 09:59:21,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836020645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:21,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:21,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 09:59:21,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168201111] [2022-07-12 09:59:21,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:21,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 09:59:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:21,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 09:59:21,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 09:59:21,322 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2022-07-12 09:59:21,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 178 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-12 09:59:21,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:21,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2022-07-12 09:59:21,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:21,432 INFO L129 PetriNetUnfolder]: 50/1067 cut-off events. [2022-07-12 09:59:21,433 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-07-12 09:59:21,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 1067 events. 50/1067 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4635 event pairs, 10 based on Foata normal form. 12/1033 useless extension candidates. Maximal degree in co-relation 998. Up to 46 conditions per place. [2022-07-12 09:59:21,437 INFO L132 encePairwiseOnDemand]: 177/181 looper letters, 12 selfloop transitions, 4 changer transitions 0/175 dead transitions. [2022-07-12 09:59:21,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 477 flow [2022-07-12 09:59:21,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 09:59:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 09:59:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2022-07-12 09:59:21,439 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9116022099447514 [2022-07-12 09:59:21,439 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2022-07-12 09:59:21,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2022-07-12 09:59:21,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:21,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2022-07-12 09:59:21,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-12 09:59:21,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:21,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 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-12 09:59:21,443 INFO L186 Difference]: Start difference. First operand has 179 places, 178 transitions, 466 flow. Second operand 3 states and 495 transitions. [2022-07-12 09:59:21,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 477 flow [2022-07-12 09:59:21,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 175 transitions, 465 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-07-12 09:59:21,448 INFO L242 Difference]: Finished difference. Result has 179 places, 173 transitions, 434 flow [2022-07-12 09:59:21,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=179, PETRI_TRANSITIONS=173} [2022-07-12 09:59:21,450 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 13 predicate places. [2022-07-12 09:59:21,451 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 173 transitions, 434 flow [2022-07-12 09:59:21,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 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-12 09:59:21,452 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:21,452 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] [2022-07-12 09:59:21,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 09:59:21,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2081668345, now seen corresponding path program 1 times [2022-07-12 09:59:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:21,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549059511] [2022-07-12 09:59:21,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:21,564 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-12 09:59:21,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:21,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549059511] [2022-07-12 09:59:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549059511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:21,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 09:59:21,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344248886] [2022-07-12 09:59:21,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 09:59:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 09:59:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 09:59:21,568 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 181 [2022-07-12 09:59:21,569 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 173 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 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-12 09:59:21,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:21,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 181 [2022-07-12 09:59:21,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:21,777 INFO L129 PetriNetUnfolder]: 116/1221 cut-off events. [2022-07-12 09:59:21,777 INFO L130 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-07-12 09:59:21,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 1221 events. 116/1221 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6011 event pairs, 19 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1103. Up to 178 conditions per place. [2022-07-12 09:59:21,785 INFO L132 encePairwiseOnDemand]: 170/181 looper letters, 49 selfloop transitions, 13 changer transitions 0/201 dead transitions. [2022-07-12 09:59:21,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 643 flow [2022-07-12 09:59:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 09:59:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 09:59:21,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1389 transitions. [2022-07-12 09:59:21,798 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.852670349907919 [2022-07-12 09:59:21,798 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1389 transitions. [2022-07-12 09:59:21,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1389 transitions. [2022-07-12 09:59:21,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:21,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1389 transitions. [2022-07-12 09:59:21,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 154.33333333333334) internal successors, (1389), 9 states have internal predecessors, (1389), 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-12 09:59:21,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 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-12 09:59:21,804 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 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-12 09:59:21,804 INFO L186 Difference]: Start difference. First operand has 179 places, 173 transitions, 434 flow. Second operand 9 states and 1389 transitions. [2022-07-12 09:59:21,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 643 flow [2022-07-12 09:59:21,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 201 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 09:59:21,809 INFO L242 Difference]: Finished difference. Result has 191 places, 180 transitions, 518 flow [2022-07-12 09:59:21,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=191, PETRI_TRANSITIONS=180} [2022-07-12 09:59:21,811 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 25 predicate places. [2022-07-12 09:59:21,811 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 180 transitions, 518 flow [2022-07-12 09:59:21,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 150.28571428571428) internal successors, (1052), 7 states have internal predecessors, (1052), 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-12 09:59:21,816 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:21,816 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:59:21,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 09:59:21,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1775208827, now seen corresponding path program 1 times [2022-07-12 09:59:21,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:21,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153644326] [2022-07-12 09:59:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:22,560 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-12 09:59:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:22,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153644326] [2022-07-12 09:59:22,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153644326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:22,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:22,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-12 09:59:22,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815633253] [2022-07-12 09:59:22,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:22,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 09:59:22,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:22,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 09:59:22,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2022-07-12 09:59:22,564 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 181 [2022-07-12 09:59:22,566 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 180 transitions, 518 flow. Second operand has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 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-12 09:59:22,566 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:22,566 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 181 [2022-07-12 09:59:22,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:24,692 INFO L129 PetriNetUnfolder]: 1000/3952 cut-off events. [2022-07-12 09:59:24,693 INFO L130 PetriNetUnfolder]: For 568/568 co-relation queries the response was YES. [2022-07-12 09:59:24,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 3952 events. 1000/3952 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 28345 event pairs, 289 based on Foata normal form. 0/3830 useless extension candidates. Maximal degree in co-relation 4319. Up to 1518 conditions per place. [2022-07-12 09:59:24,718 INFO L132 encePairwiseOnDemand]: 145/181 looper letters, 238 selfloop transitions, 39 changer transitions 4/370 dead transitions. [2022-07-12 09:59:24,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 370 transitions, 1584 flow [2022-07-12 09:59:24,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 09:59:24,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-07-12 09:59:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3462 transitions. [2022-07-12 09:59:24,725 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5625609359766006 [2022-07-12 09:59:24,725 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3462 transitions. [2022-07-12 09:59:24,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3462 transitions. [2022-07-12 09:59:24,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:24,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3462 transitions. [2022-07-12 09:59:24,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 101.82352941176471) internal successors, (3462), 34 states have internal predecessors, (3462), 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-12 09:59:24,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 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-12 09:59:24,741 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 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-12 09:59:24,741 INFO L186 Difference]: Start difference. First operand has 191 places, 180 transitions, 518 flow. Second operand 34 states and 3462 transitions. [2022-07-12 09:59:24,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 370 transitions, 1584 flow [2022-07-12 09:59:24,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 370 transitions, 1571 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-07-12 09:59:24,748 INFO L242 Difference]: Finished difference. Result has 245 places, 212 transitions, 782 flow [2022-07-12 09:59:24,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=782, PETRI_PLACES=245, PETRI_TRANSITIONS=212} [2022-07-12 09:59:24,749 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 79 predicate places. [2022-07-12 09:59:24,750 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 212 transitions, 782 flow [2022-07-12 09:59:24,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 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-12 09:59:24,751 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:24,751 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:59:24,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 09:59:24,751 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -271614661, now seen corresponding path program 2 times [2022-07-12 09:59:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:24,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523443198] [2022-07-12 09:59:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:24,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 09:59:25,393 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-12 09:59:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 09:59:25,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523443198] [2022-07-12 09:59:25,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523443198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 09:59:25,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 09:59:25,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-12 09:59:25,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639028360] [2022-07-12 09:59:25,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 09:59:25,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 09:59:25,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 09:59:25,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 09:59:25,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-07-12 09:59:25,397 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 181 [2022-07-12 09:59:25,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 212 transitions, 782 flow. Second operand has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 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-12 09:59:25,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 09:59:25,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 181 [2022-07-12 09:59:25,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 09:59:27,712 INFO L129 PetriNetUnfolder]: 1157/4558 cut-off events. [2022-07-12 09:59:27,712 INFO L130 PetriNetUnfolder]: For 1241/1244 co-relation queries the response was YES. [2022-07-12 09:59:27,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9750 conditions, 4558 events. 1157/4558 cut-off events. For 1241/1244 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 34542 event pairs, 118 based on Foata normal form. 4/4481 useless extension candidates. Maximal degree in co-relation 5564. Up to 1307 conditions per place. [2022-07-12 09:59:27,745 INFO L132 encePairwiseOnDemand]: 146/181 looper letters, 239 selfloop transitions, 56 changer transitions 4/388 dead transitions. [2022-07-12 09:59:27,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 388 transitions, 1987 flow [2022-07-12 09:59:27,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 09:59:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-07-12 09:59:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3462 transitions. [2022-07-12 09:59:27,752 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.5625609359766006 [2022-07-12 09:59:27,752 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3462 transitions. [2022-07-12 09:59:27,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3462 transitions. [2022-07-12 09:59:27,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 09:59:27,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3462 transitions. [2022-07-12 09:59:27,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 101.82352941176471) internal successors, (3462), 34 states have internal predecessors, (3462), 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-12 09:59:27,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 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-12 09:59:27,768 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 181.0) internal successors, (6335), 35 states have internal predecessors, (6335), 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-12 09:59:27,768 INFO L186 Difference]: Start difference. First operand has 245 places, 212 transitions, 782 flow. Second operand 34 states and 3462 transitions. [2022-07-12 09:59:27,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 388 transitions, 1987 flow [2022-07-12 09:59:27,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 388 transitions, 1973 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-07-12 09:59:27,779 INFO L242 Difference]: Finished difference. Result has 284 places, 229 transitions, 1052 flow [2022-07-12 09:59:27,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1052, PETRI_PLACES=284, PETRI_TRANSITIONS=229} [2022-07-12 09:59:27,781 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 118 predicate places. [2022-07-12 09:59:27,781 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 229 transitions, 1052 flow [2022-07-12 09:59:27,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 96.51851851851852) internal successors, (2606), 27 states have internal predecessors, (2606), 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-12 09:59:27,782 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 09:59:27,783 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] [2022-07-12 09:59:27,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 09:59:27,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-12 09:59:27,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 09:59:27,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1605864085, now seen corresponding path program 1 times [2022-07-12 09:59:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 09:59:27,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068476900] [2022-07-12 09:59:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 09:59:27,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 09:59:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:59:27,833 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 09:59:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 09:59:27,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 09:59:27,944 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 09:59:27,945 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 09:59:27,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-07-12 09:59:27,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 09:59:27,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-12 09:59:27,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-12 09:59:27,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 09:59:27,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 09:59:27,947 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 09:59:27,952 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 09:59:27,952 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 09:59:28,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 09:59:28 BasicIcfg [2022-07-12 09:59:28,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 09:59:28,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 09:59:28,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 09:59:28,063 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 09:59:28,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 09:59:19" (3/4) ... [2022-07-12 09:59:28,065 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 09:59:28,123 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 09:59:28,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 09:59:28,124 INFO L158 Benchmark]: Toolchain (without parser) took 9825.27ms. Allocated memory was 113.2MB in the beginning and 304.1MB in the end (delta: 190.8MB). Free memory was 89.8MB in the beginning and 141.9MB in the end (delta: -52.1MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,124 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 09:59:28,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.91ms. Allocated memory is still 113.2MB. Free memory was 89.6MB in the beginning and 60.9MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.56ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 58.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,125 INFO L158 Benchmark]: Boogie Preprocessor took 45.58ms. Allocated memory is still 113.2MB. Free memory was 58.3MB in the beginning and 56.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,125 INFO L158 Benchmark]: RCFGBuilder took 414.53ms. Allocated memory is still 113.2MB. Free memory was 56.4MB in the beginning and 82.4MB in the end (delta: -25.9MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,125 INFO L158 Benchmark]: TraceAbstraction took 8848.27ms. Allocated memory was 113.2MB in the beginning and 304.1MB in the end (delta: 190.8MB). Free memory was 81.7MB in the beginning and 178.6MB in the end (delta: -96.9MB). Peak memory consumption was 214.8MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,125 INFO L158 Benchmark]: Witness Printer took 60.36ms. Allocated memory is still 304.1MB. Free memory was 178.6MB in the beginning and 141.9MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-12 09:59:28,127 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.09ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 60.0MB in the end (delta: 40.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.91ms. Allocated memory is still 113.2MB. Free memory was 89.6MB in the beginning and 60.9MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.56ms. Allocated memory is still 113.2MB. Free memory was 60.9MB in the beginning and 58.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.58ms. Allocated memory is still 113.2MB. Free memory was 58.3MB in the beginning and 56.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.53ms. Allocated memory is still 113.2MB. Free memory was 56.4MB in the beginning and 82.4MB in the end (delta: -25.9MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8848.27ms. Allocated memory was 113.2MB in the beginning and 304.1MB in the end (delta: 190.8MB). Free memory was 81.7MB in the beginning and 178.6MB in the end (delta: -96.9MB). Peak memory consumption was 214.8MB. Max. memory is 16.1GB. * Witness Printer took 60.36ms. Allocated memory is still 304.1MB. Free memory was 178.6MB in the beginning and 141.9MB in the end (delta: 36.7MB). Peak memory consumption was 37.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[(800)]; 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] [L1020] 0 pthread_t id1, id2; VAL [arr={5:0}, flag=0, id1={9:0}, id2={7:0}, m={6:0}, top=0] [L1022] 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))=10, top=0] [L989] 1 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L990] 1 unsigned int tmp; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, m={6:0}, top=0] [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() VAL [__VERIFIER_nondet_uint()=4294968095, arg={0:0}, arg={0:0}, arr={5:0}, flag=0, i=0, m={6:0}, tmp=799, top=0] [L1023] 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))=11, top=0] [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) VAL [\old(cond)=1, arr={5:0}, cond=1, flag=0, m={6:0}, top=0] [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) VAL [\old(x)=799, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=799] [L968] CALL, EXPR 1 get_top() [L953] 1 return top; VAL [\result=0, arr={5:0}, flag=0, m={6:0}, top=0] [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x VAL [\old(x)=799, arr={5:0}, flag=0, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, top=0, x=799] [L969] CALL 1 inc_top() [L945] 1 top++ VAL [arr={5:0}, flag=0, m={6:0}, top=1] [L969] RET 1 inc_top() [L971] 1 return 0; VAL [\old(x)=799, \result=0, arr={5:0}, flag=0, m={6:0}, stack={5:0}, stack={5:0}, top=1, x=799] [L996] RET, EXPR 1 push(arr,tmp) [L996] 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=799, top=1] [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, tmp=799, top=1] [L1005] 2 int i; VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, m={6:0}, top=1] [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1009] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=0, m={6:0}, top=1] [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=1, \result=0, arr={5:0}, flag=1, m={6:0}, top=1] [L975] RET, EXPR 2 get_top() [L975] 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] [L982] CALL 2 dec_top() [L949] 2 top-- VAL [arr={5:0}, flag=1, m={6:0}, top=0] [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L983] RET, EXPR 2 get_top() [L983] 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()]=799, top=0] [L983] 2 return stack[get_top()]; VAL [\result=799, arr={5:0}, flag=1, get_top()=0, m={6:0}, stack={5:0}, stack={5:0}, stack[get_top()]=799, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] 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)=799, top=0] [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1009] COND TRUE 2 \read(flag) VAL [arg={0:0}, arg={0:0}, arr={5:0}, flag=1, i=1, m={6:0}, top=0] [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; VAL [\result=0, \result=0, arr={5:0}, flag=1, m={6:0}, top=0] [L975] RET, EXPR 2 get_top() [L975] 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] [L978] 2 return (-2); VAL [\result=-2, arr={5:0}, flag=1, m={6:0}, stack={5:0}, stack={5:0}, top=0] [L1011] RET, EXPR 2 pop(arr) [L1011] 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] [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={5:0}, flag=1, m={6:0}, top=0] - UnprovableResult [Line: 1022]: 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, 290 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: 8.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 841 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 841 mSDsluCounter, 2411 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2791 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4296 IncrementalHoareTripleChecker+Invalid, 4342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 197 mSDtfsCounter, 4296 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1052occurred in iteration=8, InterpolantAutomatonStates: 100, 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.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1052 NumberOfCodeBlocks, 1052 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 6711 SizeOfPredicates, 2 NumberOfNonLiveVariables, 248 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-12 09:59:28,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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