/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 01:28:15,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 01:28:15,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 01:28:15,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 01:28:15,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 01:28:15,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 01:28:15,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 01:28:15,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 01:28:15,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 01:28:15,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 01:28:15,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 01:28:15,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 01:28:15,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 01:28:15,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 01:28:15,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 01:28:15,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 01:28:15,411 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 01:28:15,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 01:28:15,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 01:28:15,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 01:28:15,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 01:28:15,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 01:28:15,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 01:28:15,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 01:28:15,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 01:28:15,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 01:28:15,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 01:28:15,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 01:28:15,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 01:28:15,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 01:28:15,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 01:28:15,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 01:28:15,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 01:28:15,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 01:28:15,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 01:28:15,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 01:28:15,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 01:28:15,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 01:28:15,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 01:28:15,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 01:28:15,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 01:28:15,436 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-NoLbe.epf [2022-01-19 01:28:15,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 01:28:15,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 01:28:15,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 01:28:15,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 01:28:15,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 01:28:15,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 01:28:15,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 01:28:15,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 01:28:15,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 01:28:15,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 01:28:15,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 01:28:15,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 01:28:15,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 01:28:15,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 01:28:15,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 01:28:15,460 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 01:28:15,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 01:28:15,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 01:28:15,616 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 01:28:15,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 01:28:15,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 01:28:15,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 01:28:15,634 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 01:28:15,634 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 [2022-01-19 01:28:15,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c0356a/09ce1951f6224bc49b3bb7b8cc3156ff/FLAGdb43a4d99 [2022-01-19 01:28:16,059 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 01:28:16,059 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-01-19 01:28:16,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c0356a/09ce1951f6224bc49b3bb7b8cc3156ff/FLAGdb43a4d99 [2022-01-19 01:28:16,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863c0356a/09ce1951f6224bc49b3bb7b8cc3156ff [2022-01-19 01:28:16,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 01:28:16,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 01:28:16,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 01:28:16,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 01:28:16,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 01:28:16,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc65297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16, skipping insertion in model container [2022-01-19 01:28:16,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 01:28:16,500 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 01:28:16,623 WARN L230 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] [2022-01-19 01:28:16,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 01:28:16,636 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 01:28:16,647 WARN L230 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] [2022-01-19 01:28:16,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 01:28:16,661 INFO L208 MainTranslator]: Completed translation [2022-01-19 01:28:16,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16 WrapperNode [2022-01-19 01:28:16,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 01:28:16,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 01:28:16,662 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 01:28:16,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 01:28:16,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,686 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-01-19 01:28:16,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 01:28:16,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 01:28:16,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 01:28:16,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 01:28:16,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,702 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 01:28:16,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 01:28:16,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 01:28:16,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 01:28:16,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (1/1) ... [2022-01-19 01:28:16,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 01:28:16,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:16,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 01:28:16,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 01:28:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 01:28:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 01:28:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 01:28:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 01:28:16,749 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 01:28:16,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 01:28:16,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 01:28:16,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 01:28:16,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 01:28:16,751 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 01:28:16,803 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 01:28:16,804 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 01:28:17,009 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 01:28:17,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 01:28:17,091 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 01:28:17,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:28:17 BoogieIcfgContainer [2022-01-19 01:28:17,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 01:28:17,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 01:28:17,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 01:28:17,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 01:28:17,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:28:16" (1/3) ... [2022-01-19 01:28:17,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28244993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:28:17, skipping insertion in model container [2022-01-19 01:28:17,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:28:16" (2/3) ... [2022-01-19 01:28:17,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28244993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:28:17, skipping insertion in model container [2022-01-19 01:28:17,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:28:17" (3/3) ... [2022-01-19 01:28:17,102 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-01-19 01:28:17,106 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 01:28:17,106 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 01:28:17,106 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 01:28:17,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,152 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,153 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,154 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,155 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,156 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,157 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,158 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,159 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,160 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,161 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,162 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,163 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,166 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,167 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,171 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,172 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,174 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,175 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,175 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,176 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,177 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 01:28:17,178 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 01:28:17,207 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 01:28:17,214 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 01:28:17,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 01:28:17,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 01:28:17,257 INFO L129 PetriNetUnfolder]: 9/117 cut-off events. [2022-01-19 01:28:17,257 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 01:28:17,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 117 events. 9/117 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-01-19 01:28:17,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 01:28:17,263 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 108 transitions, 228 flow [2022-01-19 01:28:17,281 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2022-01-19 01:28:17,281 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 01:28:17,285 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:17,285 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:17,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:17,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1888672242, now seen corresponding path program 1 times [2022-01-19 01:28:17,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:17,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242026591] [2022-01-19 01:28:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:17,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 01:28:17,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:17,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242026591] [2022-01-19 01:28:17,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242026591] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:28:17,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:28:17,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 01:28:17,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083012424] [2022-01-19 01:28:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:28:17,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 01:28:17,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 01:28:17,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 01:28:17,640 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2022-01-19 01:28:17,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 108 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:17,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2022-01-19 01:28:17,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:17,771 INFO L129 PetriNetUnfolder]: 26/185 cut-off events. [2022-01-19 01:28:17,771 INFO L130 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-01-19 01:28:17,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 185 events. 26/185 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 447 event pairs, 6 based on Foata normal form. 22/193 useless extension candidates. Maximal degree in co-relation 122. Up to 39 conditions per place. [2022-01-19 01:28:17,774 INFO L132 encePairwiseOnDemand]: 104/119 looper letters, 24 selfloop transitions, 3 changer transitions 8/113 dead transitions. [2022-01-19 01:28:17,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 317 flow [2022-01-19 01:28:17,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 01:28:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 01:28:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2022-01-19 01:28:17,794 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7935174069627852 [2022-01-19 01:28:17,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2022-01-19 01:28:17,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2022-01-19 01:28:17,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:17,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2022-01-19 01:28:17,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,812 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,813 INFO L186 Difference]: Start difference. First operand has 106 places, 108 transitions, 228 flow. Second operand 7 states and 661 transitions. [2022-01-19 01:28:17,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 317 flow [2022-01-19 01:28:17,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 113 transitions, 303 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 01:28:17,821 INFO L242 Difference]: Finished difference. Result has 111 places, 101 transitions, 225 flow [2022-01-19 01:28:17,822 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=225, PETRI_PLACES=111, PETRI_TRANSITIONS=101} [2022-01-19 01:28:17,824 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 01:28:17,824 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 225 flow [2022-01-19 01:28:17,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,825 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:17,825 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:17,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 01:28:17,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:17,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 397909448, now seen corresponding path program 1 times [2022-01-19 01:28:17,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691950250] [2022-01-19 01:28:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:17,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 01:28:17,980 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:17,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691950250] [2022-01-19 01:28:17,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691950250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:28:17,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:28:17,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 01:28:17,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221043989] [2022-01-19 01:28:17,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:28:17,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:28:17,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:17,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:28:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 01:28:17,983 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 01:28:17,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 101 transitions, 225 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:17,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:17,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 01:28:17,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:18,134 INFO L129 PetriNetUnfolder]: 95/406 cut-off events. [2022-01-19 01:28:18,134 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 01:28:18,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 406 events. 95/406 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1804 event pairs, 42 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 654. Up to 136 conditions per place. [2022-01-19 01:28:18,139 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 37 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2022-01-19 01:28:18,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 119 transitions, 356 flow [2022-01-19 01:28:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 01:28:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 01:28:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2022-01-19 01:28:18,141 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7626050420168067 [2022-01-19 01:28:18,141 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 726 transitions. [2022-01-19 01:28:18,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 726 transitions. [2022-01-19 01:28:18,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:18,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 726 transitions. [2022-01-19 01:28:18,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,151 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,151 INFO L186 Difference]: Start difference. First operand has 111 places, 101 transitions, 225 flow. Second operand 8 states and 726 transitions. [2022-01-19 01:28:18,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 119 transitions, 356 flow [2022-01-19 01:28:18,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 119 transitions, 349 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 01:28:18,156 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 254 flow [2022-01-19 01:28:18,156 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=254, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2022-01-19 01:28:18,157 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 01:28:18,157 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 254 flow [2022-01-19 01:28:18,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,158 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:18,158 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:18,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 01:28:18,158 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1293595690, now seen corresponding path program 1 times [2022-01-19 01:28:18,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:18,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591349334] [2022-01-19 01:28:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:18,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 01:28:18,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:18,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591349334] [2022-01-19 01:28:18,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591349334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 01:28:18,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 01:28:18,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 01:28:18,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955112142] [2022-01-19 01:28:18,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:28:18,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:28:18,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:18,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:28:18,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 01:28:18,266 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 01:28:18,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:18,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 01:28:18,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:18,364 INFO L129 PetriNetUnfolder]: 81/328 cut-off events. [2022-01-19 01:28:18,364 INFO L130 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-01-19 01:28:18,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 328 events. 81/328 cut-off events. For 48/51 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1272 event pairs, 47 based on Foata normal form. 3/306 useless extension candidates. Maximal degree in co-relation 422. Up to 144 conditions per place. [2022-01-19 01:28:18,366 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 25 selfloop transitions, 6 changer transitions 11/116 dead transitions. [2022-01-19 01:28:18,366 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 365 flow [2022-01-19 01:28:18,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 01:28:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 01:28:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 722 transitions. [2022-01-19 01:28:18,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7584033613445378 [2022-01-19 01:28:18,368 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 722 transitions. [2022-01-19 01:28:18,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 722 transitions. [2022-01-19 01:28:18,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:18,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 722 transitions. [2022-01-19 01:28:18,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 90.25) internal successors, (722), 8 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,372 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,372 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 254 flow. Second operand 8 states and 722 transitions. [2022-01-19 01:28:18,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 365 flow [2022-01-19 01:28:18,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 01:28:18,376 INFO L242 Difference]: Finished difference. Result has 116 places, 102 transitions, 248 flow [2022-01-19 01:28:18,376 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=248, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2022-01-19 01:28:18,376 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 01:28:18,376 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 248 flow [2022-01-19 01:28:18,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:18,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:18,377 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:18,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 01:28:18,377 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:18,377 INFO L85 PathProgramCache]: Analyzing trace with hash -63413436, now seen corresponding path program 1 times [2022-01-19 01:28:18,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:18,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755579035] [2022-01-19 01:28:18,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:18,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:18,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755579035] [2022-01-19 01:28:18,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755579035] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:18,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822740046] [2022-01-19 01:28:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:18,471 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:18,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 01:28:18,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 01:28:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:18,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 01:28:18,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:28:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:18,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:28:19,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:19,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822740046] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:19,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 01:28:19,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 01:28:19,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799162007] [2022-01-19 01:28:19,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:28:19,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:28:19,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:19,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:28:19,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 01:28:19,022 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 01:28:19,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:19,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 01:28:19,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:19,095 INFO L129 PetriNetUnfolder]: 70/263 cut-off events. [2022-01-19 01:28:19,095 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-01-19 01:28:19,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 263 events. 70/263 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 858 event pairs, 17 based on Foata normal form. 9/265 useless extension candidates. Maximal degree in co-relation 420. Up to 79 conditions per place. [2022-01-19 01:28:19,097 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 27 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2022-01-19 01:28:19,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 333 flow [2022-01-19 01:28:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 01:28:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 01:28:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 01:28:19,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 01:28:19,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:19,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,101 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,101 INFO L186 Difference]: Start difference. First operand has 116 places, 102 transitions, 248 flow. Second operand 7 states and 629 transitions. [2022-01-19 01:28:19,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 333 flow [2022-01-19 01:28:19,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 307 flow, removed 7 selfloop flow, removed 9 redundant places. [2022-01-19 01:28:19,103 INFO L242 Difference]: Finished difference. Result has 112 places, 104 transitions, 259 flow [2022-01-19 01:28:19,104 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=112, PETRI_TRANSITIONS=104} [2022-01-19 01:28:19,104 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 6 predicate places. [2022-01-19 01:28:19,104 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 259 flow [2022-01-19 01:28:19,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:19,105 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:19,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 01:28:19,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:19,320 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1317879854, now seen corresponding path program 1 times [2022-01-19 01:28:19,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952596770] [2022-01-19 01:28:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:19,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:19,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:19,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952596770] [2022-01-19 01:28:19,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952596770] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:19,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160163930] [2022-01-19 01:28:19,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:19,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:19,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:19,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 01:28:19,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 01:28:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:19,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 01:28:19,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:28:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:19,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:28:19,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:19,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160163930] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:19,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 01:28:19,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 01:28:19,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942287644] [2022-01-19 01:28:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 01:28:19,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 01:28:19,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:19,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 01:28:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 01:28:19,771 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 01:28:19,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 104 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:19,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 01:28:19,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:19,840 INFO L129 PetriNetUnfolder]: 59/261 cut-off events. [2022-01-19 01:28:19,840 INFO L130 PetriNetUnfolder]: For 76/90 co-relation queries the response was YES. [2022-01-19 01:28:19,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 261 events. 59/261 cut-off events. For 76/90 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 783 event pairs, 20 based on Foata normal form. 14/262 useless extension candidates. Maximal degree in co-relation 418. Up to 67 conditions per place. [2022-01-19 01:28:19,842 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 29 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2022-01-19 01:28:19,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 352 flow [2022-01-19 01:28:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 01:28:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 01:28:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 01:28:19,843 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 01:28:19,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:19,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 01:28:19,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,846 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,846 INFO L186 Difference]: Start difference. First operand has 112 places, 104 transitions, 259 flow. Second operand 7 states and 629 transitions. [2022-01-19 01:28:19,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 352 flow [2022-01-19 01:28:19,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 110 transitions, 343 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 01:28:19,848 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 278 flow [2022-01-19 01:28:19,848 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2022-01-19 01:28:19,849 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 01:28:19,849 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 278 flow [2022-01-19 01:28:19,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:19,849 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:19,849 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:19,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 01:28:20,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:20,059 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:20,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:20,060 INFO L85 PathProgramCache]: Analyzing trace with hash -622709836, now seen corresponding path program 1 times [2022-01-19 01:28:20,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:20,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689326380] [2022-01-19 01:28:20,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:20,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:20,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:20,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689326380] [2022-01-19 01:28:20,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689326380] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:20,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297244950] [2022-01-19 01:28:20,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:20,291 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:20,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 01:28:20,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 01:28:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:20,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 01:28:20,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:28:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:20,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:28:20,787 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:28:20,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-01-19 01:28:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:28:20,808 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:28:20,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-19 01:28:20,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:20,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297244950] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:28:20,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:28:20,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 01:28:20,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55850980] [2022-01-19 01:28:20,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:28:20,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 01:28:20,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:20,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 01:28:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-19 01:28:20,941 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 01:28:20,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 278 flow. Second operand has 23 states, 23 states have (on average 63.43478260869565) internal successors, (1459), 23 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:20,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:20,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 01:28:20,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:21,834 INFO L129 PetriNetUnfolder]: 795/1701 cut-off events. [2022-01-19 01:28:21,835 INFO L130 PetriNetUnfolder]: For 987/987 co-relation queries the response was YES. [2022-01-19 01:28:21,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 1701 events. 795/1701 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10402 event pairs, 82 based on Foata normal form. 2/1696 useless extension candidates. Maximal degree in co-relation 3998. Up to 473 conditions per place. [2022-01-19 01:28:21,842 INFO L132 encePairwiseOnDemand]: 100/119 looper letters, 176 selfloop transitions, 65 changer transitions 8/301 dead transitions. [2022-01-19 01:28:21,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 301 transitions, 1424 flow [2022-01-19 01:28:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 01:28:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 01:28:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2469 transitions. [2022-01-19 01:28:21,848 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5607540313422666 [2022-01-19 01:28:21,848 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2469 transitions. [2022-01-19 01:28:21,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2469 transitions. [2022-01-19 01:28:21,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:21,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2469 transitions. [2022-01-19 01:28:21,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 66.72972972972973) internal successors, (2469), 37 states have internal predecessors, (2469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:21,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:21,859 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:21,859 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 278 flow. Second operand 37 states and 2469 transitions. [2022-01-19 01:28:21,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 301 transitions, 1424 flow [2022-01-19 01:28:21,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 301 transitions, 1390 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 01:28:21,866 INFO L242 Difference]: Finished difference. Result has 164 places, 165 transitions, 737 flow [2022-01-19 01:28:21,867 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=737, PETRI_PLACES=164, PETRI_TRANSITIONS=165} [2022-01-19 01:28:21,868 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 58 predicate places. [2022-01-19 01:28:21,868 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 165 transitions, 737 flow [2022-01-19 01:28:21,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.43478260869565) internal successors, (1459), 23 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:21,870 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:21,870 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:21,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 01:28:22,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:22,088 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:22,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2137444122, now seen corresponding path program 2 times [2022-01-19 01:28:22,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283258600] [2022-01-19 01:28:22,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:22,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:22,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:22,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283258600] [2022-01-19 01:28:22,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283258600] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:22,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316274365] [2022-01-19 01:28:22,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 01:28:22,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:22,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:22,311 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 01:28:22,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 01:28:22,376 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 01:28:22,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:28:22,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 01:28:22,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:28:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:22,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:28:22,803 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:28:22,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2022-01-19 01:28:22,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:28:22,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:28:22,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-01-19 01:28:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:22,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316274365] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:28:22,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:28:22,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 01:28:22,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417888607] [2022-01-19 01:28:22,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:28:22,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 01:28:22,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 01:28:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-01-19 01:28:22,941 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 01:28:22,942 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 165 transitions, 737 flow. Second operand has 23 states, 23 states have (on average 63.56521739130435) internal successors, (1462), 23 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:22,942 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:22,942 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 01:28:22,942 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:24,130 INFO L129 PetriNetUnfolder]: 1520/3226 cut-off events. [2022-01-19 01:28:24,130 INFO L130 PetriNetUnfolder]: For 7175/7175 co-relation queries the response was YES. [2022-01-19 01:28:24,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9937 conditions, 3226 events. 1520/3226 cut-off events. For 7175/7175 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 23880 event pairs, 111 based on Foata normal form. 2/3221 useless extension candidates. Maximal degree in co-relation 9880. Up to 556 conditions per place. [2022-01-19 01:28:24,150 INFO L132 encePairwiseOnDemand]: 99/119 looper letters, 230 selfloop transitions, 128 changer transitions 8/418 dead transitions. [2022-01-19 01:28:24,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 418 transitions, 2732 flow [2022-01-19 01:28:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 01:28:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 01:28:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2890 transitions. [2022-01-19 01:28:24,155 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5647840531561462 [2022-01-19 01:28:24,155 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2890 transitions. [2022-01-19 01:28:24,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2890 transitions. [2022-01-19 01:28:24,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:24,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2890 transitions. [2022-01-19 01:28:24,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 67.20930232558139) internal successors, (2890), 43 states have internal predecessors, (2890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:24,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 119.0) internal successors, (5236), 44 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:24,166 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 119.0) internal successors, (5236), 44 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:24,166 INFO L186 Difference]: Start difference. First operand has 164 places, 165 transitions, 737 flow. Second operand 43 states and 2890 transitions. [2022-01-19 01:28:24,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 418 transitions, 2732 flow [2022-01-19 01:28:24,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 418 transitions, 2568 flow, removed 71 selfloop flow, removed 11 redundant places. [2022-01-19 01:28:24,184 INFO L242 Difference]: Finished difference. Result has 202 places, 254 transitions, 1697 flow [2022-01-19 01:28:24,184 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=1697, PETRI_PLACES=202, PETRI_TRANSITIONS=254} [2022-01-19 01:28:24,185 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 96 predicate places. [2022-01-19 01:28:24,185 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 254 transitions, 1697 flow [2022-01-19 01:28:24,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 63.56521739130435) internal successors, (1462), 23 states have internal predecessors, (1462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:24,185 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:24,185 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:24,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 01:28:24,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:24,400 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1477858140, now seen corresponding path program 3 times [2022-01-19 01:28:24,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:24,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111406887] [2022-01-19 01:28:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:24,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:24,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 01:28:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:24,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 01:28:24,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111406887] [2022-01-19 01:28:24,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111406887] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 01:28:24,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380447961] [2022-01-19 01:28:24,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 01:28:24,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:24,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 01:28:24,639 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 01:28:24,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 01:28:24,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 01:28:24,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 01:28:24,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-19 01:28:24,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 01:28:25,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:28:25,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-19 01:28:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:25,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 01:28:25,380 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_151 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset) c_~counter~0)) (forall ((v_ArrVal_151 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-01-19 01:28:25,402 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_151 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork0_~tmp~0#1|)) (forall ((v_ArrVal_151 (Array Int Int))) (<= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_151) c_~A~0.base) c_~A~0.offset)))) is different from false [2022-01-19 01:28:25,419 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 01:28:25,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2022-01-19 01:28:25,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-01-19 01:28:25,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 01:28:25,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 01:28:25,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 3 [2022-01-19 01:28:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 01:28:25,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380447961] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 01:28:25,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 01:28:25,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2022-01-19 01:28:25,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914868472] [2022-01-19 01:28:25,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 01:28:25,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 01:28:25,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 01:28:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 01:28:25,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1208, Unknown=2, NotChecked=142, Total=1482 [2022-01-19 01:28:25,955 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119 [2022-01-19 01:28:25,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 254 transitions, 1697 flow. Second operand has 39 states, 39 states have (on average 57.743589743589745) internal successors, (2252), 39 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:25,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 01:28:25,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119 [2022-01-19 01:28:25,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 01:28:27,642 INFO L129 PetriNetUnfolder]: 2636/5520 cut-off events. [2022-01-19 01:28:27,642 INFO L130 PetriNetUnfolder]: For 18664/18672 co-relation queries the response was YES. [2022-01-19 01:28:27,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19090 conditions, 5520 events. 2636/5520 cut-off events. For 18664/18672 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 45930 event pairs, 318 based on Foata normal form. 8/5515 useless extension candidates. Maximal degree in co-relation 19007. Up to 2486 conditions per place. [2022-01-19 01:28:27,676 INFO L132 encePairwiseOnDemand]: 96/119 looper letters, 339 selfloop transitions, 131 changer transitions 8/527 dead transitions. [2022-01-19 01:28:27,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 527 transitions, 4597 flow [2022-01-19 01:28:27,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 01:28:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 01:28:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2302 transitions. [2022-01-19 01:28:27,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5228253463547581 [2022-01-19 01:28:27,680 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2302 transitions. [2022-01-19 01:28:27,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2302 transitions. [2022-01-19 01:28:27,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 01:28:27,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2302 transitions. [2022-01-19 01:28:27,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 62.21621621621622) internal successors, (2302), 37 states have internal predecessors, (2302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:27,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:27,690 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 119.0) internal successors, (4522), 38 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:27,690 INFO L186 Difference]: Start difference. First operand has 202 places, 254 transitions, 1697 flow. Second operand 37 states and 2302 transitions. [2022-01-19 01:28:27,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 527 transitions, 4597 flow [2022-01-19 01:28:27,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 527 transitions, 3744 flow, removed 407 selfloop flow, removed 15 redundant places. [2022-01-19 01:28:27,780 INFO L242 Difference]: Finished difference. Result has 241 places, 348 transitions, 2639 flow [2022-01-19 01:28:27,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=2639, PETRI_PLACES=241, PETRI_TRANSITIONS=348} [2022-01-19 01:28:27,781 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 135 predicate places. [2022-01-19 01:28:27,781 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 348 transitions, 2639 flow [2022-01-19 01:28:27,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 57.743589743589745) internal successors, (2252), 39 states have internal predecessors, (2252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 01:28:27,782 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 01:28:27,782 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 01:28:27,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 01:28:27,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 01:28:27,995 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 01:28:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 01:28:27,996 INFO L85 PathProgramCache]: Analyzing trace with hash 639403628, now seen corresponding path program 4 times [2022-01-19 01:28:27,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 01:28:27,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26164731] [2022-01-19 01:28:27,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 01:28:27,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 01:28:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 01:28:28,009 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 01:28:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 01:28:28,039 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 01:28:28,039 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 01:28:28,039 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 01:28:28,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 01:28:28,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 01:28:28,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 01:28:28,043 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-01-19 01:28:28,050 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 01:28:28,050 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 01:28:28,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 01:28:28 BasicIcfg [2022-01-19 01:28:28,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 01:28:28,123 INFO L158 Benchmark]: Toolchain (without parser) took 11647.61ms. Allocated memory was 413.1MB in the beginning and 721.4MB in the end (delta: 308.3MB). Free memory was 357.4MB in the beginning and 521.3MB in the end (delta: -163.9MB). Peak memory consumption was 146.1MB. Max. memory is 16.0GB. [2022-01-19 01:28:28,123 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 413.1MB. Free memory is still 373.7MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 01:28:28,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.94ms. Allocated memory was 413.1MB in the beginning and 551.6MB in the end (delta: 138.4MB). Free memory was 357.3MB in the beginning and 522.1MB in the end (delta: -164.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. [2022-01-19 01:28:28,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.14ms. Allocated memory is still 551.6MB. Free memory was 522.1MB in the beginning and 520.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 01:28:28,124 INFO L158 Benchmark]: Boogie Preprocessor took 16.85ms. Allocated memory is still 551.6MB. Free memory was 520.0MB in the beginning and 518.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 01:28:28,124 INFO L158 Benchmark]: RCFGBuilder took 388.60ms. Allocated memory is still 551.6MB. Free memory was 518.9MB in the beginning and 494.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2022-01-19 01:28:28,124 INFO L158 Benchmark]: TraceAbstraction took 11029.21ms. Allocated memory was 551.6MB in the beginning and 721.4MB in the end (delta: 169.9MB). Free memory was 494.8MB in the beginning and 521.3MB in the end (delta: -26.5MB). Peak memory consumption was 144.4MB. Max. memory is 16.0GB. [2022-01-19 01:28:28,125 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.11ms. Allocated memory is still 413.1MB. Free memory is still 373.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 183.94ms. Allocated memory was 413.1MB in the beginning and 551.6MB in the end (delta: 138.4MB). Free memory was 357.3MB in the beginning and 522.1MB in the end (delta: -164.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.14ms. Allocated memory is still 551.6MB. Free memory was 522.1MB in the beginning and 520.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 16.85ms. Allocated memory is still 551.6MB. Free memory was 520.0MB in the beginning and 518.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 388.60ms. Allocated memory is still 551.6MB. Free memory was 518.9MB in the beginning and 494.8MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 11029.21ms. Allocated memory was 551.6MB in the beginning and 721.4MB in the end (delta: 169.9MB). Free memory was 494.8MB in the beginning and 521.3MB in the end (delta: -26.5MB). Peak memory consumption was 144.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 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; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, counter=0, N=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, counter=0, N=0, t1={5:0}, t2={3:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, A={0:0}, counter=0, N=1, t1={5:0}, t2={3:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [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) VAL [\old(cond)=1, A={0:0}, cond=1, counter=0, N=1] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, malloc(sizeof(int) * (size_t)size)={-2:0}, N=1, size=1] [L97] 0 int i = 0; VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L97] COND TRUE 0 i < size VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [\old(size)=1, __VERIFIER_nondet_int()=-7, A={0:0}, arr={-2:0}, counter=0, i=0, N=1, size=1] [L97] 0 i++ VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L97] COND FALSE 0 !(i < size) VAL [\old(size)=1, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L100] 0 return arr; VAL [\old(size)=1, \result={-2:0}, A={0:0}, arr={-2:0}, counter=0, i=1, N=1, size=1] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={-2:0}, counter=0, create_fresh_int_array(N)={-2:0}, N=1, t1={5:0}, t2={3:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, counter=0, N=1, pthread_create(&t1, 0, thread1, 0)=-1, t1={5:0}, t2={3:0}] [L49] 1 int i=0; VAL [A={-2:0}, counter=0, i=0, N=1] [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]); [L62] 2 int i=0; VAL [A={-2:0}, counter=0, i=0, N=1] [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]); [L67] 2 counter = tmp VAL [A={-2:0}, counter=7, i=0, N=1, tmp=7] [L62] 2 i++ VAL [A={-2:0}, counter=7, i=1, N=1, tmp=7] [L62] COND FALSE 2 !(i