/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:15:32,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:15:32,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:15:32,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:15:32,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:15:32,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:15:32,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:15:32,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:15:32,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:15:32,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:15:32,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:15:32,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:15:32,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:15:32,086 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:15:32,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:15:32,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:15:32,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:15:32,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:15:32,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:15:32,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:15:32,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:15:32,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:15:32,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:15:32,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:15:32,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:15:32,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:15:32,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:15:32,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:15:32,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:15:32,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:15:32,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:15:32,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:15:32,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:15:32,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:15:32,109 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:15:32,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:15:32,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:15:32,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:15:32,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:15:32,110 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:15:32,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:15:32,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-27 21:15:32,136 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:15:32,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:15:32,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:15:32,137 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:15:32,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:15:32,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:15:32,138 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:15:32,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:15:32,138 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:15:32,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:15:32,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:15:32,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:15:32,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:15:32,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:15:32,141 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:15:32,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:15:32,141 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 21:15:32,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:15:32,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:15:32,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:15:32,303 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:15:32,304 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:15:32,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-01-27 21:15:33,208 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:15:33,386 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:15:33,386 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-01-27 21:15:33,391 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7e0c8e5/7a27871bb349431b8bdee9e20bca9f7f/FLAGa96554e6e [2023-01-27 21:15:33,400 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b7e0c8e5/7a27871bb349431b8bdee9e20bca9f7f [2023-01-27 21:15:33,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:15:33,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:15:33,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:15:33,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:15:33,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:15:33,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a79ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33, skipping insertion in model container [2023-01-27 21:15:33,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:15:33,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:15:33,517 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-01-27 21:15:33,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:15:33,530 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:15:33,541 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-01-27 21:15:33,544 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:15:33,549 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:15:33,549 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:15:33,554 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:15:33,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33 WrapperNode [2023-01-27 21:15:33,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:15:33,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:15:33,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:15:33,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:15:33,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,579 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-01-27 21:15:33,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:15:33,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:15:33,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:15:33,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:15:33,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:15:33,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:15:33,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:15:33,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:15:33,601 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (1/1) ... [2023-01-27 21:15:33,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:15:33,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:33,621 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) [2023-01-27 21:15:33,623 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 [2023-01-27 21:15:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:15:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:15:33,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:15:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:15:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:15:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:15:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:15:33,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:15:33,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:15:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:15:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:15:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:15:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:15:33,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:15:33,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:15:33,663 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 21:15:33,733 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:15:33,734 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:15:33,982 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:15:34,054 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:15:34,055 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 21:15:34,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:15:34 BoogieIcfgContainer [2023-01-27 21:15:34,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:15:34,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:15:34,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:15:34,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:15:34,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:15:33" (1/3) ... [2023-01-27 21:15:34,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698875a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:15:34, skipping insertion in model container [2023-01-27 21:15:34,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:15:33" (2/3) ... [2023-01-27 21:15:34,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698875a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:15:34, skipping insertion in model container [2023-01-27 21:15:34,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:15:34" (3/3) ... [2023-01-27 21:15:34,062 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-01-27 21:15:34,073 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:15:34,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:15:34,073 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:15:34,131 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 21:15:34,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 238 flow [2023-01-27 21:15:34,194 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2023-01-27 21:15:34,194 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 21:15:34,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 9/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-01-27 21:15:34,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 111 transitions, 238 flow [2023-01-27 21:15:34,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 101 transitions, 214 flow [2023-01-27 21:15:34,202 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:15:34,208 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 101 transitions, 214 flow [2023-01-27 21:15:34,210 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 101 transitions, 214 flow [2023-01-27 21:15:34,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 101 transitions, 214 flow [2023-01-27 21:15:34,228 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-01-27 21:15:34,228 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 21:15:34,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 9/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-01-27 21:15:34,230 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-01-27 21:15:36,653 INFO L134 LiptonReduction]: Checked pairs total: 830 [2023-01-27 21:15:36,653 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-01-27 21:15:36,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:15:36,679 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53af04ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:15:36,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 21:15:36,687 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2023-01-27 21:15:36,687 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 21:15:36,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:36,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:36,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:36,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 41387086, now seen corresponding path program 1 times [2023-01-27 21:15:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546458564] [2023-01-27 21:15:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:15:36,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:36,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546458564] [2023-01-27 21:15:36,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546458564] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:15:36,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:15:36,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 21:15:36,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201107120] [2023-01-27 21:15:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:36,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 21:15:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 21:15:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 21:15:36,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 208 [2023-01-27 21:15:37,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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) [2023-01-27 21:15:37,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:37,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 208 [2023-01-27 21:15:37,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:37,076 INFO L130 PetriNetUnfolder]: 114/197 cut-off events. [2023-01-27 21:15:37,076 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-27 21:15:37,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 114/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 703 event pairs, 24 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-01-27 21:15:37,078 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 25 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-01-27 21:15:37,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-01-27 21:15:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 21:15:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 21:15:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2023-01-27 21:15:37,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-27 21:15:37,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2023-01-27 21:15:37,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2023-01-27 21:15:37,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:37,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2023-01-27 21:15:37,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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) [2023-01-27 21:15:37,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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) [2023-01-27 21:15:37,107 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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) [2023-01-27 21:15:37,108 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 312 transitions. [2023-01-27 21:15:37,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-01-27 21:15:37,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 21:15:37,112 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-01-27 21:15:37,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2023-01-27 21:15:37,116 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-01-27 21:15:37,117 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-01-27 21:15:37,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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) [2023-01-27 21:15:37,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:37,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:37,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:15:37,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:37,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:37,118 INFO L85 PathProgramCache]: Analyzing trace with hash -370799563, now seen corresponding path program 1 times [2023-01-27 21:15:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629078158] [2023-01-27 21:15:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:15:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:37,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629078158] [2023-01-27 21:15:37,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629078158] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:15:37,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:15:37,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:15:37,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085047087] [2023-01-27 21:15:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:15:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:15:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:15:37,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-27 21:15:37,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-01-27 21:15:37,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:37,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-27 21:15:37,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:37,378 INFO L130 PetriNetUnfolder]: 178/329 cut-off events. [2023-01-27 21:15:37,378 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-01-27 21:15:37,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 329 events. 178/329 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1385 event pairs, 83 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 276. Up to 207 conditions per place. [2023-01-27 21:15:37,383 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 39 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-01-27 21:15:37,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 210 flow [2023-01-27 21:15:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:15:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:15:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-01-27 21:15:37,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40865384615384615 [2023-01-27 21:15:37,386 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-01-27 21:15:37,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-01-27 21:15:37,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:37,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-01-27 21:15:37,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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) [2023-01-27 21:15:37,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,390 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,390 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 425 transitions. [2023-01-27 21:15:37,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 210 flow [2023-01-27 21:15:37,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 21:15:37,391 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 86 flow [2023-01-27 21:15:37,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2023-01-27 21:15:37,392 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-01-27 21:15:37,392 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 86 flow [2023-01-27 21:15:37,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-01-27 21:15:37,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:37,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:37,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:15:37,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:37,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1378138269, now seen corresponding path program 1 times [2023-01-27 21:15:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776377699] [2023-01-27 21:15:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:15:37,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:37,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776377699] [2023-01-27 21:15:37,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776377699] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:15:37,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:15:37,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:15:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714709131] [2023-01-27 21:15:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:37,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:15:37,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:37,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:15:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:15:37,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-27 21:15:37,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-01-27 21:15:37,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:37,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-27 21:15:37,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:37,572 INFO L130 PetriNetUnfolder]: 132/246 cut-off events. [2023-01-27 21:15:37,573 INFO L131 PetriNetUnfolder]: For 50/57 co-relation queries the response was YES. [2023-01-27 21:15:37,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 246 events. 132/246 cut-off events. For 50/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 937 event pairs, 81 based on Foata normal form. 7/234 useless extension candidates. Maximal degree in co-relation 482. Up to 205 conditions per place. [2023-01-27 21:15:37,575 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 19 selfloop transitions, 2 changer transitions 16/38 dead transitions. [2023-01-27 21:15:37,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 191 flow [2023-01-27 21:15:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:15:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:15:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2023-01-27 21:15:37,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2023-01-27 21:15:37,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 420 transitions. [2023-01-27 21:15:37,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 420 transitions. [2023-01-27 21:15:37,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:37,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 420 transitions. [2023-01-27 21:15:37,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.0) internal successors, (420), 5 states have internal predecessors, (420), 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) [2023-01-27 21:15:37,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,579 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,579 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 86 flow. Second operand 5 states and 420 transitions. [2023-01-27 21:15:37,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 191 flow [2023-01-27 21:15:37,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 187 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 21:15:37,582 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 78 flow [2023-01-27 21:15:37,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-01-27 21:15:37,583 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-01-27 21:15:37,585 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 78 flow [2023-01-27 21:15:37,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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) [2023-01-27 21:15:37,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:37,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:37,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:15:37,586 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:37,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1007847617, now seen corresponding path program 1 times [2023-01-27 21:15:37,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:37,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048171338] [2023-01-27 21:15:37,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:37,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048171338] [2023-01-27 21:15:37,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048171338] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:37,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743647102] [2023-01-27 21:15:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:37,691 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) [2023-01-27 21:15:37,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 21:15:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:37,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 21:15:37,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:15:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:37,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743647102] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 21:15:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-01-27 21:15:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272052568] [2023-01-27 21:15:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:37,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:15:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:15:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-27 21:15:37,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-27 21:15:37,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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) [2023-01-27 21:15:37,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:37,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-27 21:15:37,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:37,969 INFO L130 PetriNetUnfolder]: 117/205 cut-off events. [2023-01-27 21:15:37,969 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-01-27 21:15:37,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 205 events. 117/205 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 696 event pairs, 35 based on Foata normal form. 16/220 useless extension candidates. Maximal degree in co-relation 522. Up to 112 conditions per place. [2023-01-27 21:15:37,970 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-01-27 21:15:37,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 161 flow [2023-01-27 21:15:37,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:15:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:15:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-01-27 21:15:37,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2023-01-27 21:15:37,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-01-27 21:15:37,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-01-27 21:15:37,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:37,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-01-27 21:15:37,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 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) [2023-01-27 21:15:37,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,975 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:37,975 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 78 flow. Second operand 5 states and 412 transitions. [2023-01-27 21:15:37,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 161 flow [2023-01-27 21:15:37,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 143 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-01-27 21:15:37,976 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 91 flow [2023-01-27 21:15:37,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-01-27 21:15:37,977 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-01-27 21:15:37,977 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 91 flow [2023-01-27 21:15:37,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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) [2023-01-27 21:15:37,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:37,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:37,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 21:15:38,182 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 [2023-01-27 21:15:38,184 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:38,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:38,185 INFO L85 PathProgramCache]: Analyzing trace with hash 53783691, now seen corresponding path program 1 times [2023-01-27 21:15:38,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:38,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076942957] [2023-01-27 21:15:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:38,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076942957] [2023-01-27 21:15:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076942957] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293274787] [2023-01-27 21:15:38,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:38,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:38,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:38,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:15:38,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 21:15:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:38,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-27 21:15:38,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:15:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:38,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 21:15:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293274787] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 21:15:38,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-01-27 21:15:38,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531323229] [2023-01-27 21:15:38,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:15:38,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:15:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:15:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-01-27 21:15:38,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 208 [2023-01-27 21:15:38,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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) [2023-01-27 21:15:38,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:38,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 208 [2023-01-27 21:15:38,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:38,455 INFO L130 PetriNetUnfolder]: 94/169 cut-off events. [2023-01-27 21:15:38,455 INFO L131 PetriNetUnfolder]: For 123/141 co-relation queries the response was YES. [2023-01-27 21:15:38,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 169 events. 94/169 cut-off events. For 123/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 514 event pairs, 30 based on Foata normal form. 18/174 useless extension candidates. Maximal degree in co-relation 459. Up to 93 conditions per place. [2023-01-27 21:15:38,456 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 25 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2023-01-27 21:15:38,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 192 flow [2023-01-27 21:15:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:15:38,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:15:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2023-01-27 21:15:38,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39615384615384613 [2023-01-27 21:15:38,457 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 412 transitions. [2023-01-27 21:15:38,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 412 transitions. [2023-01-27 21:15:38,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:38,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 412 transitions. [2023-01-27 21:15:38,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 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) [2023-01-27 21:15:38,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:38,460 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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) [2023-01-27 21:15:38,460 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 91 flow. Second operand 5 states and 412 transitions. [2023-01-27 21:15:38,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 192 flow [2023-01-27 21:15:38,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 21:15:38,461 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 111 flow [2023-01-27 21:15:38,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-01-27 21:15:38,462 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-01-27 21:15:38,462 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 111 flow [2023-01-27 21:15:38,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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) [2023-01-27 21:15:38,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:38,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:38,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 21:15:38,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:38,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:38,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1841708852, now seen corresponding path program 1 times [2023-01-27 21:15:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102920446] [2023-01-27 21:15:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:15:39,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:15:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102920446] [2023-01-27 21:15:39,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102920446] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:15:39,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899871615] [2023-01-27 21:15:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:15:39,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 21:15:39,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 21:15:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:15:39,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2023-01-27 21:15:39,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:15:39,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 21:15:39,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:15:39,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:15:39,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 21:15:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:15:39,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:15:39,756 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~counter~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) .cse0)) (forall ((v_ArrVal_133 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-01-27 21:15:39,776 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) .cse0)) (forall ((v_ArrVal_133 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-01-27 21:15:39,799 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-01-27 21:15:39,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:39,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-01-27 21:15:39,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2023-01-27 21:15:39,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-01-27 21:15:39,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-01-27 21:15:39,859 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:15:39,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-01-27 21:15:39,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:15:39,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-01-27 21:15:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-27 21:15:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899871615] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:15:39,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:15:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-01-27 21:15:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794203333] [2023-01-27 21:15:39,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:15:39,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-01-27 21:15:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:15:39,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-01-27 21:15:39,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=9, NotChecked=138, Total=702 [2023-01-27 21:15:39,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 208 [2023-01-27 21:15:39,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 111 flow. Second operand has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 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) [2023-01-27 21:15:39,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:15:39,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 208 [2023-01-27 21:15:39,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:15:40,515 INFO L130 PetriNetUnfolder]: 329/582 cut-off events. [2023-01-27 21:15:40,516 INFO L131 PetriNetUnfolder]: For 526/526 co-relation queries the response was YES. [2023-01-27 21:15:40,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 582 events. 329/582 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2347 event pairs, 12 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 1898. Up to 188 conditions per place. [2023-01-27 21:15:40,518 INFO L137 encePairwiseOnDemand]: 199/208 looper letters, 113 selfloop transitions, 38 changer transitions 2/153 dead transitions. [2023-01-27 21:15:40,519 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 153 transitions, 950 flow [2023-01-27 21:15:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-27 21:15:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-27 21:15:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1471 transitions. [2023-01-27 21:15:40,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3214597902097902 [2023-01-27 21:15:40,522 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1471 transitions. [2023-01-27 21:15:40,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1471 transitions. [2023-01-27 21:15:40,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:15:40,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1471 transitions. [2023-01-27 21:15:40,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 66.86363636363636) internal successors, (1471), 22 states have internal predecessors, (1471), 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) [2023-01-27 21:15:40,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 208.0) internal successors, (4784), 23 states have internal predecessors, (4784), 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) [2023-01-27 21:15:40,529 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 208.0) internal successors, (4784), 23 states have internal predecessors, (4784), 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) [2023-01-27 21:15:40,529 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 111 flow. Second operand 22 states and 1471 transitions. [2023-01-27 21:15:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 153 transitions, 950 flow [2023-01-27 21:15:40,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 153 transitions, 922 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 21:15:40,532 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 512 flow [2023-01-27 21:15:40,532 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=512, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2023-01-27 21:15:40,532 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 37 predicate places. [2023-01-27 21:15:40,532 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 512 flow [2023-01-27 21:15:40,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 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) [2023-01-27 21:15:40,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:15:40,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 21:15:40,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-27 21:15:40,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:15:40,738 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 21:15:40,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:15:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 269516194, now seen corresponding path program 2 times [2023-01-27 21:15:40,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:15:40,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758653272] [2023-01-27 21:15:40,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:15:40,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:15:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 21:15:40,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 21:15:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 21:15:40,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 21:15:40,792 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 21:15:40,793 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-27 21:15:40,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-27 21:15:40,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-27 21:15:40,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 21:15:40,794 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-01-27 21:15:40,797 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 21:15:40,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 21:15:40,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 09:15:40 BasicIcfg [2023-01-27 21:15:40,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 21:15:40,837 INFO L158 Benchmark]: Toolchain (without parser) took 7435.03ms. Allocated memory was 702.5MB in the beginning and 876.6MB in the end (delta: 174.1MB). Free memory was 662.4MB in the beginning and 530.2MB in the end (delta: 132.2MB). Peak memory consumption was 306.7MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 408.9MB. Free memory is still 358.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 151.52ms. Allocated memory is still 702.5MB. Free memory was 662.4MB in the beginning and 650.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.48ms. Allocated memory is still 702.5MB. Free memory was 650.6MB in the beginning and 649.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: Boogie Preprocessor took 19.66ms. Allocated memory is still 702.5MB. Free memory was 649.0MB in the beginning and 647.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: RCFGBuilder took 456.16ms. Allocated memory is still 702.5MB. Free memory was 647.3MB in the beginning and 620.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,838 INFO L158 Benchmark]: TraceAbstraction took 6779.43ms. Allocated memory was 702.5MB in the beginning and 876.6MB in the end (delta: 174.1MB). Free memory was 620.5MB in the beginning and 530.2MB in the end (delta: 90.3MB). Peak memory consumption was 264.8MB. Max. memory is 16.0GB. [2023-01-27 21:15:40,839 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.10ms. Allocated memory is still 408.9MB. Free memory is still 358.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 151.52ms. Allocated memory is still 702.5MB. Free memory was 662.4MB in the beginning and 650.6MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.48ms. Allocated memory is still 702.5MB. Free memory was 650.6MB in the beginning and 649.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 19.66ms. Allocated memory is still 702.5MB. Free memory was 649.0MB in the beginning and 647.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 456.16ms. Allocated memory is still 702.5MB. Free memory was 647.3MB in the beginning and 620.9MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 6779.43ms. Allocated memory was 702.5MB in the beginning and 876.6MB in the end (delta: 174.1MB). Free memory was 620.5MB in the beginning and 530.2MB in the end (delta: 90.3MB). Peak memory consumption was 264.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 99 PlacesBefore, 23 PlacesAfterwards, 101 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 97 TotalNumberOfCompositions, 830 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 681, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 681, independent: 355, independent conditional: 0, independent unconditional: 355, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 299, unknown conditional: 0, unknown unconditional: 299] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={5:0}, t2={6:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t2, 0, thread2, 0)=-1, t1={5:0}, t2={6:0}] [L83] 0 \read(t1) VAL [A={3:0}, N=1, \read(t1)=-2, counter=0, t1={5:0}, t2={6:0}] [L62] 2 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L49] 1 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={3:0}, N=1, counter=-4, i=1, tmp=-4] [L49] COND FALSE 1 !(i