/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-After.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 13:49:18,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:49:18,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:49:18,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:49:18,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:49:18,401 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:49:18,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:49:18,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:49:18,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:49:18,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:49:18,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:49:18,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:49:18,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:49:18,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:49:18,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:49:18,407 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:49:18,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:49:18,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:49:18,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:49:18,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:49:18,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:49:18,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:49:18,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:49:18,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:49:18,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:49:18,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:49:18,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:49:18,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:49:18,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:49:18,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:49:18,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:49:18,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:49:18,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:49:18,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:49:18,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:49:18,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:49:18,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:49:18,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:49:18,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:49:18,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:49:18,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:49:18,454 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-After.epf [2022-01-19 13:49:18,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:49:18,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:49:18,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:49:18,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:49:18,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:49:18,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:49:18,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:49:18,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:49:18,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:49:18,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:49:18,477 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:49:18,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:49:18,477 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:49:18,477 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 13:49:18,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:49:18,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:49:18,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:49:18,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:49:18,628 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:49:18,629 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 13:49:18,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b81d3a6b/b07378d4f0974b118ace0cef27d8b000/FLAGbbb3458e9 [2022-01-19 13:49:19,000 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:49:19,000 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2022-01-19 13:49:19,006 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b81d3a6b/b07378d4f0974b118ace0cef27d8b000/FLAGbbb3458e9 [2022-01-19 13:49:19,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b81d3a6b/b07378d4f0974b118ace0cef27d8b000 [2022-01-19 13:49:19,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:49:19,445 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:49:19,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:49:19,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:49:19,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:49:19,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7febc1b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19, skipping insertion in model container [2022-01-19 13:49:19,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:49:19,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:49:19,662 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 13:49:19,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:49:19,672 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:49:19,702 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 13:49:19,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:49:19,713 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:49:19,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19 WrapperNode [2022-01-19 13:49:19,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:49:19,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:49:19,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:49:19,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:49:19,719 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:49:19" (1/1) ... [2022-01-19 13:49:19,724 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:49:19" (1/1) ... [2022-01-19 13:49:19,738 INFO L137 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-01-19 13:49:19,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:49:19,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:49:19,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:49:19,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:49:19,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:49:19,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:49:19,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:49:19,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:49:19,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (1/1) ... [2022-01-19 13:49:19,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:49:19,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:19,783 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 13:49:19,788 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 13:49:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:49:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:49:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:49:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 13:49:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 13:49:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 13:49:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:49:19,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:49:19,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:49:19,820 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 13:49:19,877 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:49:19,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:49:20,106 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:49:20,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:49:20,168 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 13:49:20,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:49:20 BoogieIcfgContainer [2022-01-19 13:49:20,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:49:20,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:49:20,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:49:20,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:49:20,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:49:19" (1/3) ... [2022-01-19 13:49:20,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35952251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:49:20, skipping insertion in model container [2022-01-19 13:49:20,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:49:19" (2/3) ... [2022-01-19 13:49:20,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35952251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:49:20, skipping insertion in model container [2022-01-19 13:49:20,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:49:20" (3/3) ... [2022-01-19 13:49:20,175 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2022-01-19 13:49:20,178 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:49:20,178 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:49:20,178 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:49:20,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,200 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,201 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 13:49:20,201 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 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 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,202 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,203 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 13:49:20,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,203 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,204 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 13:49:20,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,204 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,206 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 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 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,209 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 13:49:20,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,210 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,210 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 13:49:20,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,211 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,211 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 13:49:20,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,212 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,213 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,216 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 13:49:20,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,217 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 13:49:20,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,217 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 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 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,218 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 13:49:20,218 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~tmp~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,219 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:49:20,221 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 13:49:20,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:49:20,257 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 13:49:20,257 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 13:49:20,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 13:49:20,307 INFO L129 PetriNetUnfolder]: 9/117 cut-off events. [2022-01-19 13:49:20,307 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:49:20,309 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 13:49:20,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 119 transitions, 254 flow [2022-01-19 13:49:20,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 108 transitions, 228 flow [2022-01-19 13:49:20,329 INFO L129 PetriNetUnfolder]: 9/107 cut-off events. [2022-01-19 13:49:20,330 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:49:20,330 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:20,330 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 13:49:20,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:20,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:20,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1888672242, now seen corresponding path program 1 times [2022-01-19 13:49:20,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:20,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574743560] [2022-01-19 13:49:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:20,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:20,668 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 13:49:20,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:20,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574743560] [2022-01-19 13:49:20,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574743560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:20,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:20,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:49:20,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403691433] [2022-01-19 13:49:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:20,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:49:20,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:49:20,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:49:20,706 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 119 [2022-01-19 13:49:20,713 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 13:49:20,713 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:20,713 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 119 [2022-01-19 13:49:20,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:20,840 INFO L129 PetriNetUnfolder]: 26/185 cut-off events. [2022-01-19 13:49:20,840 INFO L130 PetriNetUnfolder]: For 35/36 co-relation queries the response was YES. [2022-01-19 13:49:20,843 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 13:49:20,845 INFO L132 encePairwiseOnDemand]: 104/119 looper letters, 24 selfloop transitions, 3 changer transitions 8/113 dead transitions. [2022-01-19 13:49:20,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 317 flow [2022-01-19 13:49:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:49:20,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:49:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2022-01-19 13:49:20,862 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7935174069627852 [2022-01-19 13:49:20,863 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2022-01-19 13:49:20,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2022-01-19 13:49:20,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:20,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2022-01-19 13:49:20,874 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 13:49:20,882 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 13:49:20,882 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 13:49:20,884 INFO L186 Difference]: Start difference. First operand has 106 places, 108 transitions, 228 flow. Second operand 7 states and 661 transitions. [2022-01-19 13:49:20,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 317 flow [2022-01-19 13:49:20,888 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 13:49:20,890 INFO L242 Difference]: Finished difference. Result has 111 places, 101 transitions, 225 flow [2022-01-19 13:49:20,892 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 13:49:20,894 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 13:49:20,895 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 101 transitions, 225 flow [2022-01-19 13:49:20,895 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 13:49:20,895 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:20,896 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 13:49:20,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:49:20,896 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:20,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:20,897 INFO L85 PathProgramCache]: Analyzing trace with hash 397909448, now seen corresponding path program 1 times [2022-01-19 13:49:20,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:20,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543610600] [2022-01-19 13:49:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:20,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:21,018 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 13:49:21,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:21,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543610600] [2022-01-19 13:49:21,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543610600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:21,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:21,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:49:21,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108143654] [2022-01-19 13:49:21,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:21,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:49:21,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:21,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:49:21,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:49:21,023 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 13:49:21,024 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 13:49:21,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:21,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 13:49:21,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:21,174 INFO L129 PetriNetUnfolder]: 95/406 cut-off events. [2022-01-19 13:49:21,175 INFO L130 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-01-19 13:49:21,177 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 13:49:21,179 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 37 selfloop transitions, 8 changer transitions 0/119 dead transitions. [2022-01-19 13:49:21,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 119 transitions, 356 flow [2022-01-19 13:49:21,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:49:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:49:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 726 transitions. [2022-01-19 13:49:21,181 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7626050420168067 [2022-01-19 13:49:21,181 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 726 transitions. [2022-01-19 13:49:21,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 726 transitions. [2022-01-19 13:49:21,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:21,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 726 transitions. [2022-01-19 13:49:21,189 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 13:49:21,191 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 13:49:21,191 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 13:49:21,191 INFO L186 Difference]: Start difference. First operand has 111 places, 101 transitions, 225 flow. Second operand 8 states and 726 transitions. [2022-01-19 13:49:21,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 119 transitions, 356 flow [2022-01-19 13:49:21,194 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 13:49:21,196 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 254 flow [2022-01-19 13:49:21,196 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 13:49:21,197 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 5 predicate places. [2022-01-19 13:49:21,197 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 254 flow [2022-01-19 13:49:21,197 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 13:49:21,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:21,198 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 13:49:21,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:49:21,199 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1293595690, now seen corresponding path program 1 times [2022-01-19 13:49:21,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:21,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940024143] [2022-01-19 13:49:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:21,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:21,306 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 13:49:21,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:21,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940024143] [2022-01-19 13:49:21,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940024143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:49:21,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:49:21,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:49:21,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694393106] [2022-01-19 13:49:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:21,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:49:21,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:49:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:49:21,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 13:49:21,311 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 13:49:21,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:21,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 13:49:21,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:21,414 INFO L129 PetriNetUnfolder]: 81/328 cut-off events. [2022-01-19 13:49:21,414 INFO L130 PetriNetUnfolder]: For 48/51 co-relation queries the response was YES. [2022-01-19 13:49:21,415 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 13:49:21,416 INFO L132 encePairwiseOnDemand]: 110/119 looper letters, 25 selfloop transitions, 6 changer transitions 11/116 dead transitions. [2022-01-19 13:49:21,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 116 transitions, 365 flow [2022-01-19 13:49:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 13:49:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 13:49:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 722 transitions. [2022-01-19 13:49:21,418 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7584033613445378 [2022-01-19 13:49:21,418 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 722 transitions. [2022-01-19 13:49:21,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 722 transitions. [2022-01-19 13:49:21,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:21,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 722 transitions. [2022-01-19 13:49:21,420 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 13:49:21,421 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 13:49:21,422 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 13:49:21,422 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 254 flow. Second operand 8 states and 722 transitions. [2022-01-19 13:49:21,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 116 transitions, 365 flow [2022-01-19 13:49:21,424 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 13:49:21,427 INFO L242 Difference]: Finished difference. Result has 116 places, 102 transitions, 248 flow [2022-01-19 13:49:21,427 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 13:49:21,429 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 13:49:21,429 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 248 flow [2022-01-19 13:49:21,429 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 13:49:21,429 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:21,430 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 13:49:21,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:49:21,430 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash -63413436, now seen corresponding path program 1 times [2022-01-19 13:49:21,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713194948] [2022-01-19 13:49:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:21,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:21,520 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 13:49:21,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713194948] [2022-01-19 13:49:21,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713194948] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:21,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443074508] [2022-01-19 13:49:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:21,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:21,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:21,522 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 13:49:21,523 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 13:49:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:21,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:49:21,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:21,829 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 13:49:21,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:22,046 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 13:49:22,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443074508] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:22,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 13:49:22,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 13:49:22,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648470413] [2022-01-19 13:49:22,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:22,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:49:22,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:22,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:49:22,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:49:22,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 13:49:22,049 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 13:49:22,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:22,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 13:49:22,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:22,127 INFO L129 PetriNetUnfolder]: 70/263 cut-off events. [2022-01-19 13:49:22,127 INFO L130 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-01-19 13:49:22,128 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 13:49:22,129 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 27 selfloop transitions, 7 changer transitions 0/108 dead transitions. [2022-01-19 13:49:22,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 333 flow [2022-01-19 13:49:22,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:49:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:49:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 13:49:22,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 13:49:22,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:22,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,132 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 13:49:22,133 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 13:49:22,133 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 13:49:22,133 INFO L186 Difference]: Start difference. First operand has 116 places, 102 transitions, 248 flow. Second operand 7 states and 629 transitions. [2022-01-19 13:49:22,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 333 flow [2022-01-19 13:49:22,134 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 13:49:22,136 INFO L242 Difference]: Finished difference. Result has 112 places, 104 transitions, 259 flow [2022-01-19 13:49:22,136 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 13:49:22,136 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 6 predicate places. [2022-01-19 13:49:22,136 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 104 transitions, 259 flow [2022-01-19 13:49:22,137 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 13:49:22,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:22,137 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 13:49:22,155 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 13:49:22,357 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 13:49:22,358 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:22,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1317879854, now seen corresponding path program 1 times [2022-01-19 13:49:22,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:22,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089155743] [2022-01-19 13:49:22,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:22,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:22,434 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 13:49:22,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:22,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089155743] [2022-01-19 13:49:22,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089155743] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:22,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743300281] [2022-01-19 13:49:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:22,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:22,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:22,452 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 13:49:22,452 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 13:49:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:22,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:49:22,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:22,677 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 13:49:22,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:22,884 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 13:49:22,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743300281] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:22,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 13:49:22,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 13:49:22,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939375077] [2022-01-19 13:49:22,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:49:22,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:49:22,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:22,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:49:22,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:49:22,886 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 119 [2022-01-19 13:49:22,887 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 13:49:22,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:22,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 119 [2022-01-19 13:49:22,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:22,970 INFO L129 PetriNetUnfolder]: 59/261 cut-off events. [2022-01-19 13:49:22,970 INFO L130 PetriNetUnfolder]: For 76/90 co-relation queries the response was YES. [2022-01-19 13:49:22,971 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 13:49:22,972 INFO L132 encePairwiseOnDemand]: 111/119 looper letters, 29 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2022-01-19 13:49:22,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 352 flow [2022-01-19 13:49:22,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:49:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:49:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2022-01-19 13:49:22,973 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2022-01-19 13:49:22,973 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:22,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2022-01-19 13:49:22,975 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 13:49:22,976 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 13:49:22,976 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 13:49:22,976 INFO L186 Difference]: Start difference. First operand has 112 places, 104 transitions, 259 flow. Second operand 7 states and 629 transitions. [2022-01-19 13:49:22,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 110 transitions, 352 flow [2022-01-19 13:49:22,977 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 13:49:22,978 INFO L242 Difference]: Finished difference. Result has 116 places, 105 transitions, 278 flow [2022-01-19 13:49:22,978 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 13:49:22,979 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 10 predicate places. [2022-01-19 13:49:22,979 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 278 flow [2022-01-19 13:49:22,979 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 13:49:22,979 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:22,979 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 13:49:22,997 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 13:49:23,195 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 13:49:23,196 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:23,196 INFO L85 PathProgramCache]: Analyzing trace with hash -622709836, now seen corresponding path program 1 times [2022-01-19 13:49:23,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:23,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582756449] [2022-01-19 13:49:23,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:23,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:23,453 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 13:49:23,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:23,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582756449] [2022-01-19 13:49:23,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582756449] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:23,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861693166] [2022-01-19 13:49:23,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:23,454 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:23,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:23,455 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 13:49:23,456 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 13:49:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:23,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 13:49:23,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:23,808 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 13:49:23,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:23,931 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:23,931 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 13:49:23,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 13:49:23,946 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:23,947 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 13:49:24,076 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 13:49:24,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861693166] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:49:24,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:49:24,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 13:49:24,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471034442] [2022-01-19 13:49:24,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:49:24,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 13:49:24,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:24,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 13:49:24,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2022-01-19 13:49:24,078 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 13:49:24,079 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 13:49:24,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:24,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 13:49:24,079 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:24,990 INFO L129 PetriNetUnfolder]: 795/1701 cut-off events. [2022-01-19 13:49:24,990 INFO L130 PetriNetUnfolder]: For 987/987 co-relation queries the response was YES. [2022-01-19 13:49:24,994 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 13:49:25,000 INFO L132 encePairwiseOnDemand]: 100/119 looper letters, 176 selfloop transitions, 65 changer transitions 8/301 dead transitions. [2022-01-19 13:49:25,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 301 transitions, 1424 flow [2022-01-19 13:49:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 13:49:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 13:49:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2469 transitions. [2022-01-19 13:49:25,007 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5607540313422666 [2022-01-19 13:49:25,007 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2469 transitions. [2022-01-19 13:49:25,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2469 transitions. [2022-01-19 13:49:25,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:25,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2469 transitions. [2022-01-19 13:49:25,014 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 13:49:25,019 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 13:49:25,020 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 13:49:25,020 INFO L186 Difference]: Start difference. First operand has 116 places, 105 transitions, 278 flow. Second operand 37 states and 2469 transitions. [2022-01-19 13:49:25,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 301 transitions, 1424 flow [2022-01-19 13:49:25,024 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 13:49:25,026 INFO L242 Difference]: Finished difference. Result has 164 places, 165 transitions, 737 flow [2022-01-19 13:49:25,027 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 13:49:25,027 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 58 predicate places. [2022-01-19 13:49:25,027 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 165 transitions, 737 flow [2022-01-19 13:49:25,028 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 13:49:25,028 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:25,028 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 13:49:25,059 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 13:49:25,243 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 13:49:25,245 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2137444122, now seen corresponding path program 2 times [2022-01-19 13:49:25,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:25,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821437459] [2022-01-19 13:49:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:25,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:25,444 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 13:49:25,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821437459] [2022-01-19 13:49:25,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821437459] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:25,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921128585] [2022-01-19 13:49:25,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:49:25,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:25,445 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 13:49:25,446 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 13:49:25,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 13:49:25,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:49:25,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 13:49:25,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:25,833 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 13:49:25,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:26,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:26,006 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 13:49:26,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 13:49:26,020 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:26,021 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 13:49:26,156 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 13:49:26,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921128585] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:49:26,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:49:26,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2022-01-19 13:49:26,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702788131] [2022-01-19 13:49:26,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:49:26,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-19 13:49:26,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:26,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-19 13:49:26,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-01-19 13:49:26,159 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 119 [2022-01-19 13:49:26,160 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 13:49:26,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:26,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 119 [2022-01-19 13:49:26,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:27,337 INFO L129 PetriNetUnfolder]: 1520/3226 cut-off events. [2022-01-19 13:49:27,338 INFO L130 PetriNetUnfolder]: For 7175/7175 co-relation queries the response was YES. [2022-01-19 13:49:27,347 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 13:49:27,358 INFO L132 encePairwiseOnDemand]: 99/119 looper letters, 230 selfloop transitions, 128 changer transitions 8/418 dead transitions. [2022-01-19 13:49:27,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 418 transitions, 2732 flow [2022-01-19 13:49:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-19 13:49:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2022-01-19 13:49:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 2890 transitions. [2022-01-19 13:49:27,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5647840531561462 [2022-01-19 13:49:27,365 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 2890 transitions. [2022-01-19 13:49:27,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 2890 transitions. [2022-01-19 13:49:27,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:27,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 2890 transitions. [2022-01-19 13:49:27,373 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 13:49:27,378 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 13:49:27,379 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 13:49:27,379 INFO L186 Difference]: Start difference. First operand has 164 places, 165 transitions, 737 flow. Second operand 43 states and 2890 transitions. [2022-01-19 13:49:27,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 418 transitions, 2732 flow [2022-01-19 13:49:27,396 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 13:49:27,403 INFO L242 Difference]: Finished difference. Result has 202 places, 254 transitions, 1697 flow [2022-01-19 13:49:27,403 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 13:49:27,404 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 96 predicate places. [2022-01-19 13:49:27,404 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 254 transitions, 1697 flow [2022-01-19 13:49:27,404 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 13:49:27,404 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:27,405 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 13:49:27,432 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 13:49:27,622 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 13:49:27,623 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:27,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:27,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1477858140, now seen corresponding path program 3 times [2022-01-19 13:49:27,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:27,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402151124] [2022-01-19 13:49:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:27,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:49:27,908 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 13:49:27,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:49:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402151124] [2022-01-19 13:49:27,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402151124] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:49:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139412843] [2022-01-19 13:49:27,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 13:49:27,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:49:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:49:27,911 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 13:49:27,912 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 13:49:27,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 13:49:27,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:49:27,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjunts are in the unsatisfiable core [2022-01-19 13:49:27,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:49:28,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 13:49:28,354 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 13:49:28,506 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 13:49:28,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:49:28,656 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 13:49:28,698 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 13:49:28,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 13:49:28,718 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 13:49:28,720 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 13:49:28,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 13:49:28,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 13:49:28,762 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 13:49:29,271 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 13:49:29,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139412843] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:49:29,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:49:29,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 39 [2022-01-19 13:49:29,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484225233] [2022-01-19 13:49:29,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:49:29,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-01-19 13:49:29,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:49:29,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-01-19 13:49:29,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1208, Unknown=2, NotChecked=142, Total=1482 [2022-01-19 13:49:29,275 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 119 [2022-01-19 13:49:29,277 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 13:49:29,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:49:29,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 119 [2022-01-19 13:49:29,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:49:31,032 INFO L129 PetriNetUnfolder]: 2636/5520 cut-off events. [2022-01-19 13:49:31,032 INFO L130 PetriNetUnfolder]: For 18664/18672 co-relation queries the response was YES. [2022-01-19 13:49:31,056 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 13:49:31,080 INFO L132 encePairwiseOnDemand]: 96/119 looper letters, 339 selfloop transitions, 131 changer transitions 8/527 dead transitions. [2022-01-19 13:49:31,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 527 transitions, 4597 flow [2022-01-19 13:49:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 13:49:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 13:49:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2302 transitions. [2022-01-19 13:49:31,085 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5228253463547581 [2022-01-19 13:49:31,085 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 2302 transitions. [2022-01-19 13:49:31,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 2302 transitions. [2022-01-19 13:49:31,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:49:31,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 2302 transitions. [2022-01-19 13:49:31,090 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 13:49:31,094 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 13:49:31,095 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 13:49:31,095 INFO L186 Difference]: Start difference. First operand has 202 places, 254 transitions, 1697 flow. Second operand 37 states and 2302 transitions. [2022-01-19 13:49:31,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 527 transitions, 4597 flow [2022-01-19 13:49:31,177 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 13:49:31,183 INFO L242 Difference]: Finished difference. Result has 241 places, 348 transitions, 2639 flow [2022-01-19 13:49:31,183 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 13:49:31,185 INFO L334 CegarLoopForPetriNet]: 106 programPoint places, 135 predicate places. [2022-01-19 13:49:31,185 INFO L470 AbstractCegarLoop]: Abstraction has has 241 places, 348 transitions, 2639 flow [2022-01-19 13:49:31,185 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 13:49:31,186 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:49:31,186 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 13:49:31,204 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 13:49:31,395 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 13:49:31,396 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:49:31,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:49:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash 639403628, now seen corresponding path program 4 times [2022-01-19 13:49:31,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:49:31,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028555565] [2022-01-19 13:49:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:49:31,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:49:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 13:49:31,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 13:49:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 13:49:31,453 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 13:49:31,453 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 13:49:31,454 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 13:49:31,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 13:49:31,455 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 13:49:31,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:49:31,457 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-01-19 13:49:31,461 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 13:49:31,461 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 13:49:31,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 01:49:31 BasicIcfg [2022-01-19 13:49:31,511 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 13:49:31,511 INFO L158 Benchmark]: Toolchain (without parser) took 12065.76ms. Allocated memory was 438.3MB in the beginning and 713.0MB in the end (delta: 274.7MB). Free memory was 382.9MB in the beginning and 342.5MB in the end (delta: 40.4MB). Peak memory consumption was 317.4MB. Max. memory is 16.0GB. [2022-01-19 13:49:31,511 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 438.3MB. Free memory is still 400.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 13:49:31,511 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.60ms. Allocated memory was 438.3MB in the beginning and 593.5MB in the end (delta: 155.2MB). Free memory was 382.8MB in the beginning and 563.2MB in the end (delta: -180.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.0GB. [2022-01-19 13:49:31,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.06ms. Allocated memory is still 593.5MB. Free memory was 563.2MB in the beginning and 561.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 13:49:31,512 INFO L158 Benchmark]: Boogie Preprocessor took 16.27ms. Allocated memory is still 593.5MB. Free memory was 561.1MB in the beginning and 560.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 13:49:31,512 INFO L158 Benchmark]: RCFGBuilder took 413.96ms. Allocated memory is still 593.5MB. Free memory was 560.1MB in the beginning and 534.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2022-01-19 13:49:31,512 INFO L158 Benchmark]: TraceAbstraction took 11340.34ms. Allocated memory was 593.5MB in the beginning and 713.0MB in the end (delta: 119.5MB). Free memory was 534.9MB in the beginning and 342.5MB in the end (delta: 192.4MB). Peak memory consumption was 316.1MB. Max. memory is 16.0GB. [2022-01-19 13:49:31,513 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 438.3MB. Free memory is still 400.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 261.60ms. Allocated memory was 438.3MB in the beginning and 593.5MB in the end (delta: 155.2MB). Free memory was 382.8MB in the beginning and 563.2MB in the end (delta: -180.4MB). Peak memory consumption was 10.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.06ms. Allocated memory is still 593.5MB. Free memory was 563.2MB in the beginning and 561.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 16.27ms. Allocated memory is still 593.5MB. Free memory was 561.1MB in the beginning and 560.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 413.96ms. Allocated memory is still 593.5MB. Free memory was 560.1MB in the beginning and 534.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 11340.34ms. Allocated memory was 593.5MB in the beginning and 713.0MB in the end (delta: 119.5MB). Free memory was 534.9MB in the beginning and 342.5MB in the end (delta: 192.4MB). Peak memory consumption was 316.1MB. 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