/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 03:10:29,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 03:10:29,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 03:10:29,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 03:10:29,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 03:10:29,120 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 03:10:29,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 03:10:29,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 03:10:29,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 03:10:29,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 03:10:29,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 03:10:29,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 03:10:29,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 03:10:29,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 03:10:29,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 03:10:29,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 03:10:29,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 03:10:29,136 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 03:10:29,137 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 03:10:29,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 03:10:29,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 03:10:29,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 03:10:29,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 03:10:29,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 03:10:29,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 03:10:29,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 03:10:29,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 03:10:29,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 03:10:29,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 03:10:29,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 03:10:29,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 03:10:29,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 03:10:29,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 03:10:29,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 03:10:29,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 03:10:29,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 03:10:29,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 03:10:29,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 03:10:29,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 03:10:29,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 03:10:29,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 03:10:29,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 03:10:29,179 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 03:10:29,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 03:10:29,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 03:10:29,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 03:10:29,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 03:10:29,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 03:10:29,180 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 03:10:29,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 03:10:29,180 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 03:10:29,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 03:10:29,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 03:10:29,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 03:10:29,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 03:10:29,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 03:10:29,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 03:10:29,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:10:29,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 03:10:29,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 03:10:29,183 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 03:10:29,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 03:10:29,184 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 03:10:29,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 03:10:29,184 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 03:10:29,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 03:10:29,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 03:10:29,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 03:10:29,359 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 03:10:29,361 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 03:10:29,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2022-01-19 03:10:29,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9070380b0/bed3d89ccb964024bacc135d28771dce/FLAGa8b007c4b [2022-01-19 03:10:29,838 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 03:10:29,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2022-01-19 03:10:29,857 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9070380b0/bed3d89ccb964024bacc135d28771dce/FLAGa8b007c4b [2022-01-19 03:10:30,200 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9070380b0/bed3d89ccb964024bacc135d28771dce [2022-01-19 03:10:30,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 03:10:30,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 03:10:30,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 03:10:30,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 03:10:30,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 03:10:30,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1520e1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30, skipping insertion in model container [2022-01-19 03:10:30,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 03:10:30,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 03:10:30,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2022-01-19 03:10:30,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:10:30,566 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 03:10:30,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i[39757,39770] [2022-01-19 03:10:30,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 03:10:30,638 INFO L208 MainTranslator]: Completed translation [2022-01-19 03:10:30,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30 WrapperNode [2022-01-19 03:10:30,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 03:10:30,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 03:10:30,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 03:10:30,639 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 03:10:30,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,699 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-01-19 03:10:30,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 03:10:30,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 03:10:30,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 03:10:30,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 03:10:30,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 03:10:30,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 03:10:30,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 03:10:30,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 03:10:30,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (1/1) ... [2022-01-19 03:10:30,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 03:10:30,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:30,777 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 03:10:30,791 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 03:10:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 03:10:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 03:10:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-01-19 03:10:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 03:10:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 03:10:30,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 03:10:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 03:10:30,828 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 03:10:30,994 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 03:10:30,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 03:10:31,224 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 03:10:31,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 03:10:31,230 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 03:10:31,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:10:31 BoogieIcfgContainer [2022-01-19 03:10:31,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 03:10:31,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 03:10:31,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 03:10:31,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 03:10:31,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 03:10:30" (1/3) ... [2022-01-19 03:10:31,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0beb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:10:31, skipping insertion in model container [2022-01-19 03:10:31,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 03:10:30" (2/3) ... [2022-01-19 03:10:31,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31c0beb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 03:10:31, skipping insertion in model container [2022-01-19 03:10:31,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 03:10:31" (3/3) ... [2022-01-19 03:10:31,239 INFO L111 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2022-01-19 03:10:31,244 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 03:10:31,244 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 03:10:31,244 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 03:10:31,271 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,272 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,273 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,274 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,275 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,276 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,277 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,278 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,279 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,280 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,281 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,281 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,282 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,283 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,283 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,284 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,285 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,286 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,288 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,288 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,288 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,289 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~j~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,291 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,292 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 03:10:31,294 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 03:10:31,323 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 03:10:31,328 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 03:10:31,329 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 03:10:31,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 135 transitions, 286 flow [2022-01-19 03:10:31,407 INFO L129 PetriNetUnfolder]: 10/133 cut-off events. [2022-01-19 03:10:31,407 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:10:31,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 133 events. 10/133 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 140 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-01-19 03:10:31,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 135 transitions, 286 flow [2022-01-19 03:10:31,419 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 121 transitions, 254 flow [2022-01-19 03:10:31,435 INFO L129 PetriNetUnfolder]: 8/120 cut-off events. [2022-01-19 03:10:31,435 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:10:31,435 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:31,436 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 03:10:31,436 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash 546892702, now seen corresponding path program 1 times [2022-01-19 03:10:31,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:31,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927734860] [2022-01-19 03:10:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:31,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:31,701 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 03:10:31,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:31,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927734860] [2022-01-19 03:10:31,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927734860] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:31,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:31,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 03:10:31,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040656888] [2022-01-19 03:10:31,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:31,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 03:10:31,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:31,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 03:10:31,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 03:10:31,780 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 135 [2022-01-19 03:10:31,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 121 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 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 03:10:31,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:31,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 135 [2022-01-19 03:10:31,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:31,834 INFO L129 PetriNetUnfolder]: 4/117 cut-off events. [2022-01-19 03:10:31,834 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 03:10:31,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 117 events. 4/117 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 7/120 useless extension candidates. Maximal degree in co-relation 84. Up to 5 conditions per place. [2022-01-19 03:10:31,847 INFO L132 encePairwiseOnDemand]: 131/135 looper letters, 4 selfloop transitions, 0 changer transitions 0/117 dead transitions. [2022-01-19 03:10:31,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 254 flow [2022-01-19 03:10:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 03:10:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 03:10:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions. [2022-01-19 03:10:31,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2022-01-19 03:10:31,861 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions. [2022-01-19 03:10:31,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions. [2022-01-19 03:10:31,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:31,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions. [2022-01-19 03:10:31,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 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 03:10:31,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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 03:10:31,875 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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 03:10:31,876 INFO L186 Difference]: Start difference. First operand has 120 places, 121 transitions, 254 flow. Second operand 2 states and 258 transitions. [2022-01-19 03:10:31,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 254 flow [2022-01-19 03:10:31,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 246 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 03:10:31,881 INFO L242 Difference]: Finished difference. Result has 117 places, 117 transitions, 238 flow [2022-01-19 03:10:31,883 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=238, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2022-01-19 03:10:31,885 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-01-19 03:10:31,885 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 238 flow [2022-01-19 03:10:31,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 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 03:10:31,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:31,885 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 03:10:31,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 03:10:31,886 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:31,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:31,886 INFO L85 PathProgramCache]: Analyzing trace with hash -494092674, now seen corresponding path program 1 times [2022-01-19 03:10:31,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:31,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088859980] [2022-01-19 03:10:31,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:31,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:31,971 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 03:10:31,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:31,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088859980] [2022-01-19 03:10:31,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088859980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:31,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:31,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:10:31,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162226029] [2022-01-19 03:10:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:31,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:31,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:31,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:31,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:10:31,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 135 [2022-01-19 03:10:31,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 03:10:31,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:31,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 135 [2022-01-19 03:10:31,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:32,011 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2022-01-19 03:10:32,011 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 03:10:32,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 200 events. 18/200 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 549 event pairs, 3 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 240. Up to 22 conditions per place. [2022-01-19 03:10:32,013 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 12 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2022-01-19 03:10:32,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 275 flow [2022-01-19 03:10:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:32,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2022-01-19 03:10:32,014 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9185185185185185 [2022-01-19 03:10:32,015 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2022-01-19 03:10:32,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2022-01-19 03:10:32,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:32,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2022-01-19 03:10:32,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 03:10:32,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:32,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:32,018 INFO L186 Difference]: Start difference. First operand has 117 places, 117 transitions, 238 flow. Second operand 3 states and 372 transitions. [2022-01-19 03:10:32,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 275 flow [2022-01-19 03:10:32,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 121 transitions, 275 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:10:32,020 INFO L242 Difference]: Finished difference. Result has 120 places, 118 transitions, 250 flow [2022-01-19 03:10:32,021 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=120, PETRI_TRANSITIONS=118} [2022-01-19 03:10:32,021 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 0 predicate places. [2022-01-19 03:10:32,021 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 118 transitions, 250 flow [2022-01-19 03:10:32,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 03:10:32,022 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:32,022 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] [2022-01-19 03:10:32,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 03:10:32,022 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:32,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -963664370, now seen corresponding path program 1 times [2022-01-19 03:10:32,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:32,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392786810] [2022-01-19 03:10:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:32,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 03:10:32,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:32,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392786810] [2022-01-19 03:10:32,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392786810] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:32,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380143092] [2022-01-19 03:10:32,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:32,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:32,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:32,092 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 03:10:32,093 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 03:10:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:32,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-19 03:10:32,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:32,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:32,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380143092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:32,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 03:10:32,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-01-19 03:10:32,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045756671] [2022-01-19 03:10:32,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:32,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:32,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:32,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:32,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 03:10:32,344 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 135 [2022-01-19 03:10:32,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 118 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 03:10:32,345 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:32,345 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 135 [2022-01-19 03:10:32,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:32,386 INFO L129 PetriNetUnfolder]: 20/195 cut-off events. [2022-01-19 03:10:32,386 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-01-19 03:10:32,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 195 events. 20/195 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 547 event pairs, 7 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 241. Up to 28 conditions per place. [2022-01-19 03:10:32,390 INFO L132 encePairwiseOnDemand]: 132/135 looper letters, 15 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2022-01-19 03:10:32,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 295 flow [2022-01-19 03:10:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:32,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:32,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-01-19 03:10:32,392 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9111111111111111 [2022-01-19 03:10:32,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-01-19 03:10:32,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-01-19 03:10:32,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:32,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-01-19 03:10:32,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 03:10:32,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:32,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:32,395 INFO L186 Difference]: Start difference. First operand has 120 places, 118 transitions, 250 flow. Second operand 3 states and 369 transitions. [2022-01-19 03:10:32,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 123 transitions, 295 flow [2022-01-19 03:10:32,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:32,400 INFO L242 Difference]: Finished difference. Result has 122 places, 119 transitions, 260 flow [2022-01-19 03:10:32,401 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2022-01-19 03:10:32,402 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 2 predicate places. [2022-01-19 03:10:32,402 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 260 flow [2022-01-19 03:10:32,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 03:10:32,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:32,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:32,421 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 03:10:32,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:32,622 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash -786293827, now seen corresponding path program 1 times [2022-01-19 03:10:32,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:32,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146106123] [2022-01-19 03:10:32,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:32,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:32,700 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 03:10:32,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:32,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146106123] [2022-01-19 03:10:32,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146106123] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:32,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978706402] [2022-01-19 03:10:32,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:32,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:32,704 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 03:10:32,705 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 03:10:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:32,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:10:32,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:33,028 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 03:10:33,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:33,209 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 03:10:33,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978706402] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:33,210 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:33,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-19 03:10:33,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024651484] [2022-01-19 03:10:33,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:33,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 03:10:33,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 03:10:33,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-01-19 03:10:33,214 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 135 [2022-01-19 03:10:33,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 260 flow. Second operand has 10 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 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 03:10:33,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:33,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 135 [2022-01-19 03:10:33,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:33,329 INFO L129 PetriNetUnfolder]: 26/229 cut-off events. [2022-01-19 03:10:33,330 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 03:10:33,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 229 events. 26/229 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 540 event pairs, 4 based on Foata normal form. 4/223 useless extension candidates. Maximal degree in co-relation 312. Up to 17 conditions per place. [2022-01-19 03:10:33,333 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 18 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2022-01-19 03:10:33,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 134 transitions, 353 flow [2022-01-19 03:10:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 03:10:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 03:10:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2022-01-19 03:10:33,337 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8979423868312757 [2022-01-19 03:10:33,338 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2022-01-19 03:10:33,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2022-01-19 03:10:33,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:33,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2022-01-19 03:10:33,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 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 03:10:33,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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 03:10:33,345 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 135.0) internal successors, (1350), 10 states have internal predecessors, (1350), 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 03:10:33,346 INFO L186 Difference]: Start difference. First operand has 122 places, 119 transitions, 260 flow. Second operand 9 states and 1091 transitions. [2022-01-19 03:10:33,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 134 transitions, 353 flow [2022-01-19 03:10:33,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 134 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:33,356 INFO L242 Difference]: Finished difference. Result has 132 places, 125 transitions, 308 flow [2022-01-19 03:10:33,356 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=308, PETRI_PLACES=132, PETRI_TRANSITIONS=125} [2022-01-19 03:10:33,357 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 12 predicate places. [2022-01-19 03:10:33,357 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 125 transitions, 308 flow [2022-01-19 03:10:33,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 120.1) internal successors, (1201), 10 states have internal predecessors, (1201), 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 03:10:33,358 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:33,359 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:33,383 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 03:10:33,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 03:10:33,579 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:33,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 211684319, now seen corresponding path program 2 times [2022-01-19 03:10:33,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:33,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175053725] [2022-01-19 03:10:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:33,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 03:10:33,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:33,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175053725] [2022-01-19 03:10:33,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175053725] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:33,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224911246] [2022-01-19 03:10:33,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 03:10:33,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:33,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:33,677 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 03:10:33,678 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 03:10:33,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 03:10:33,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:10:33,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 03:10:33,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-19 03:10:33,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 03:10:33,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224911246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:33,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 03:10:33,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-01-19 03:10:33,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55614462] [2022-01-19 03:10:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:33,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 03:10:33,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:33,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 03:10:33,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-19 03:10:33,986 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 135 [2022-01-19 03:10:33,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 125 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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 03:10:33,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:33,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 135 [2022-01-19 03:10:33,987 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:34,170 INFO L129 PetriNetUnfolder]: 307/1229 cut-off events. [2022-01-19 03:10:34,170 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-01-19 03:10:34,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1229 events. 307/1229 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7020 event pairs, 41 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1942. Up to 186 conditions per place. [2022-01-19 03:10:34,177 INFO L132 encePairwiseOnDemand]: 126/135 looper letters, 32 selfloop transitions, 18 changer transitions 0/160 dead transitions. [2022-01-19 03:10:34,177 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 160 transitions, 484 flow [2022-01-19 03:10:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 03:10:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 03:10:34,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 851 transitions. [2022-01-19 03:10:34,179 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9005291005291005 [2022-01-19 03:10:34,179 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 851 transitions. [2022-01-19 03:10:34,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 851 transitions. [2022-01-19 03:10:34,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:34,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 851 transitions. [2022-01-19 03:10:34,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.57142857142857) internal successors, (851), 7 states have internal predecessors, (851), 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 03:10:34,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 03:10:34,182 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 03:10:34,182 INFO L186 Difference]: Start difference. First operand has 132 places, 125 transitions, 308 flow. Second operand 7 states and 851 transitions. [2022-01-19 03:10:34,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 160 transitions, 484 flow [2022-01-19 03:10:34,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 160 transitions, 478 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:34,186 INFO L242 Difference]: Finished difference. Result has 143 places, 143 transitions, 442 flow [2022-01-19 03:10:34,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=143, PETRI_TRANSITIONS=143} [2022-01-19 03:10:34,187 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 23 predicate places. [2022-01-19 03:10:34,187 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 143 transitions, 442 flow [2022-01-19 03:10:34,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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 03:10:34,187 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:34,187 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:34,215 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 03:10:34,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:34,401 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:34,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1479845303, now seen corresponding path program 3 times [2022-01-19 03:10:34,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:34,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386386050] [2022-01-19 03:10:34,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:34,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 03:10:34,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386386050] [2022-01-19 03:10:34,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386386050] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:34,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823512790] [2022-01-19 03:10:34,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 03:10:34,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:34,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:34,443 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 03:10:34,479 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 03:10:34,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-19 03:10:34,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:10:34,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 03:10:34,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:34,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:34,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823512790] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:34,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:34,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 12 [2022-01-19 03:10:34,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337978326] [2022-01-19 03:10:34,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:34,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 03:10:34,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:34,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 03:10:34,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-01-19 03:10:34,920 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 135 [2022-01-19 03:10:34,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 143 transitions, 442 flow. Second operand has 12 states, 12 states have (on average 112.75) internal successors, (1353), 12 states have internal predecessors, (1353), 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 03:10:34,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:34,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 135 [2022-01-19 03:10:34,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:35,661 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][315], [2413#(and (<= |thread1Thread1of1ForFork1_#t~post7| 1) (<= thread1Thread1of1ForFork1_~i~0 1)), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, Black: 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 135#true, 21#L885-1true, 1117#(<= 1 ~num~0), 1104#(and (< |thread1Thread1of1ForFork1_#t~post7| 3) (<= thread1Thread1of1ForFork1_~i~0 1))]) [2022-01-19 03:10:35,662 INFO L384 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][316], [1106#(and (< thread1Thread1of1ForFork1_~i~0 4) (< |thread1Thread1of1ForFork1_#t~post7| 3)), 2420#(and (<= |thread1Thread1of1ForFork1_#t~post7| 1) (<= thread1Thread1of1ForFork1_~i~0 2)), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), 57#L885-2true, Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, Black: 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 135#true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,662 INFO L384 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-01-19 03:10:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-01-19 03:10:35,663 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][321], [102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, 863#(< thread1Thread1of1ForFork1_~i~0 4), 106#L878-2true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 1845#(<= thread1Thread1of1ForFork1_~i~0 2), 135#true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,663 INFO L384 tUnfolder$Statistics]: this new event has 122 ancestors and is cut-off event [2022-01-19 03:10:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-01-19 03:10:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-01-19 03:10:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 122 ancestors and is cut-off event [2022-01-19 03:10:35,675 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L885-->L885-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post7_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_1|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7][285], [2413#(and (<= |thread1Thread1of1ForFork1_#t~post7| 1) (<= thread1Thread1of1ForFork1_~i~0 1)), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, Black: 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 135#true, 21#L885-1true, 1117#(<= 1 ~num~0), 1104#(and (< |thread1Thread1of1ForFork1_#t~post7| 3) (<= thread1Thread1of1ForFork1_~i~0 1))]) [2022-01-19 03:10:35,676 INFO L384 tUnfolder$Statistics]: this new event has 124 ancestors and is cut-off event [2022-01-19 03:10:35,676 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,676 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,676 INFO L387 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-01-19 03:10:35,676 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][321], [102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 863#(< thread1Thread1of1ForFork1_~i~0 4), 27#L897true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 1845#(<= thread1Thread1of1ForFork1_~i~0 2), 135#true, 1117#(<= 1 ~num~0), 23#L879true]) [2022-01-19 03:10:35,677 INFO L384 tUnfolder$Statistics]: this new event has 123 ancestors and is cut-off event [2022-01-19 03:10:35,677 INFO L387 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-01-19 03:10:35,677 INFO L387 tUnfolder$Statistics]: existing Event has 123 ancestors and is cut-off event [2022-01-19 03:10:35,677 INFO L387 tUnfolder$Statistics]: existing Event has 127 ancestors and is cut-off event [2022-01-19 03:10:35,757 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][376], [102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 57#L885-2true, 2428#(and (<= thread1Thread1of1ForFork1_~i~0 3) (<= |thread1Thread1of1ForFork1_#t~post7| 2)), 27#L897true, Black: 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), 135#true, 1117#(<= 1 ~num~0), 439#true]) [2022-01-19 03:10:35,757 INFO L384 tUnfolder$Statistics]: this new event has 136 ancestors and is cut-off event [2022-01-19 03:10:35,757 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L387 tUnfolder$Statistics]: existing Event has 132 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][375], [2426#(and (<= |thread1Thread1of1ForFork1_#t~post7| 2) (<= thread1Thread1of1ForFork1_~i~0 2)), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 863#(< thread1Thread1of1ForFork1_~i~0 4), 27#L897true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 135#true, 21#L885-1true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,758 INFO L384 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,758 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,759 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][381], [1880#(<= thread1Thread1of1ForFork1_~i~0 3), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, 106#L878-2true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), 135#true, 1117#(<= 1 ~num~0), 439#true]) [2022-01-19 03:10:35,759 INFO L384 tUnfolder$Statistics]: this new event has 133 ancestors and is cut-off event [2022-01-19 03:10:35,759 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-01-19 03:10:35,759 INFO L387 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-01-19 03:10:35,759 INFO L387 tUnfolder$Statistics]: existing Event has 133 ancestors and is cut-off event [2022-01-19 03:10:35,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L885-->L885-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post7_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_1|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7][344], [2426#(and (<= |thread1Thread1of1ForFork1_#t~post7| 2) (<= thread1Thread1of1ForFork1_~i~0 2)), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 863#(< thread1Thread1of1ForFork1_~i~0 4), 27#L897true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 21#L885-1true, 135#true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,765 INFO L384 tUnfolder$Statistics]: this new event has 135 ancestors and is cut-off event [2022-01-19 03:10:35,765 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,765 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,765 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-01-19 03:10:35,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][381], [1880#(<= thread1Thread1of1ForFork1_~i~0 3), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 27#L897true, 863#(< thread1Thread1of1ForFork1_~i~0 4), Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 135#true, 1117#(<= 1 ~num~0), 23#L879true]) [2022-01-19 03:10:35,766 INFO L384 tUnfolder$Statistics]: this new event has 134 ancestors and is cut-off event [2022-01-19 03:10:35,766 INFO L387 tUnfolder$Statistics]: existing Event has 138 ancestors and is cut-off event [2022-01-19 03:10:35,766 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-01-19 03:10:35,766 INFO L387 tUnfolder$Statistics]: existing Event has 134 ancestors and is cut-off event [2022-01-19 03:10:35,804 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([351] L894-3-->L897: Formula: (= (+ v_~total~0_2 v_thread2Thread1of1ForFork0_~j~0_11) v_~total~0_1) InVars {thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_2} OutVars{thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_11, ~total~0=v_~total~0_1} AuxVars[] AssignedVars[~total~0][381], [1880#(<= thread1Thread1of1ForFork1_~i~0 3), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 863#(< thread1Thread1of1ForFork1_~i~0 4), 27#L897true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 21#L885-1true, 135#true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,804 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 03:10:35,804 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,804 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,804 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,807 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([333] L885-->L885-1: Formula: (= |v_thread1Thread1of1ForFork1_#t~post7_1| v_thread1Thread1of1ForFork1_~i~0_9) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} OutVars{thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_1|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post7][387], [1880#(<= thread1Thread1of1ForFork1_~i~0 3), 102#L914-4true, Black: 1265#(<= 0 ~num~0), Black: 1113#true, Black: 140#(= thread1Thread1of1ForFork1_~i~0 0), Black: 1511#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 0 ~num~0)), Black: 1513#(and (<= 0 |thread1Thread1of1ForFork1_#t~post6|) (<= 1 ~num~0)), Black: 1326#(<= 0 |thread1Thread1of1ForFork1_#t~post6|), 863#(< thread1Thread1of1ForFork1_~i~0 4), 27#L897true, Black: 409#(<= thread2Thread1of1ForFork0_~j~0 0), Black: 443#(<= thread1Thread1of1ForFork1_~i~0 1), Black: 439#true, 21#L885-1true, 135#true, 1117#(<= 1 ~num~0)]) [2022-01-19 03:10:35,807 INFO L384 tUnfolder$Statistics]: this new event has 146 ancestors and is cut-off event [2022-01-19 03:10:35,807 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,807 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,807 INFO L387 tUnfolder$Statistics]: existing Event has 142 ancestors and is cut-off event [2022-01-19 03:10:35,820 INFO L129 PetriNetUnfolder]: 1090/3724 cut-off events. [2022-01-19 03:10:35,820 INFO L130 PetriNetUnfolder]: For 2004/2119 co-relation queries the response was YES. [2022-01-19 03:10:35,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8282 conditions, 3724 events. 1090/3724 cut-off events. For 2004/2119 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 27883 event pairs, 77 based on Foata normal form. 109/3761 useless extension candidates. Maximal degree in co-relation 8268. Up to 293 conditions per place. [2022-01-19 03:10:35,846 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 177 selfloop transitions, 109 changer transitions 0/401 dead transitions. [2022-01-19 03:10:35,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 401 transitions, 1868 flow [2022-01-19 03:10:35,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-01-19 03:10:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2022-01-19 03:10:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 6406 transitions. [2022-01-19 03:10:35,856 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8473544973544973 [2022-01-19 03:10:35,857 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 6406 transitions. [2022-01-19 03:10:35,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 6406 transitions. [2022-01-19 03:10:35,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:35,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 6406 transitions. [2022-01-19 03:10:35,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 114.39285714285714) internal successors, (6406), 56 states have internal predecessors, (6406), 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 03:10:35,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 135.0) internal successors, (7695), 57 states have internal predecessors, (7695), 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 03:10:35,878 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 135.0) internal successors, (7695), 57 states have internal predecessors, (7695), 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 03:10:35,878 INFO L186 Difference]: Start difference. First operand has 143 places, 143 transitions, 442 flow. Second operand 56 states and 6406 transitions. [2022-01-19 03:10:35,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 401 transitions, 1868 flow [2022-01-19 03:10:35,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 401 transitions, 1868 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 03:10:35,888 INFO L242 Difference]: Finished difference. Result has 239 places, 242 transitions, 1357 flow [2022-01-19 03:10:35,888 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=1357, PETRI_PLACES=239, PETRI_TRANSITIONS=242} [2022-01-19 03:10:35,889 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 119 predicate places. [2022-01-19 03:10:35,889 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 242 transitions, 1357 flow [2022-01-19 03:10:35,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.75) internal successors, (1353), 12 states have internal predecessors, (1353), 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 03:10:35,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:35,890 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:35,908 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 03:10:36,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:36,106 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:36,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1766245062, now seen corresponding path program 4 times [2022-01-19 03:10:36,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:36,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986793745] [2022-01-19 03:10:36,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:36,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-01-19 03:10:36,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:36,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986793745] [2022-01-19 03:10:36,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986793745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 03:10:36,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 03:10:36,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 03:10:36,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306345227] [2022-01-19 03:10:36,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 03:10:36,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 03:10:36,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 03:10:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 03:10:36,143 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 135 [2022-01-19 03:10:36,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 242 transitions, 1357 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 03:10:36,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:36,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 135 [2022-01-19 03:10:36,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:36,336 INFO L129 PetriNetUnfolder]: 257/1530 cut-off events. [2022-01-19 03:10:36,336 INFO L130 PetriNetUnfolder]: For 5341/5367 co-relation queries the response was YES. [2022-01-19 03:10:36,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4200 conditions, 1530 events. 257/1530 cut-off events. For 5341/5367 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9437 event pairs, 33 based on Foata normal form. 128/1647 useless extension candidates. Maximal degree in co-relation 4145. Up to 194 conditions per place. [2022-01-19 03:10:36,354 INFO L132 encePairwiseOnDemand]: 127/135 looper letters, 16 selfloop transitions, 8 changer transitions 0/234 dead transitions. [2022-01-19 03:10:36,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 234 transitions, 1353 flow [2022-01-19 03:10:36,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 03:10:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 03:10:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2022-01-19 03:10:36,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8617283950617284 [2022-01-19 03:10:36,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2022-01-19 03:10:36,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2022-01-19 03:10:36,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:36,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2022-01-19 03:10:36,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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 03:10:36,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:36,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 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 03:10:36,357 INFO L186 Difference]: Start difference. First operand has 239 places, 242 transitions, 1357 flow. Second operand 3 states and 349 transitions. [2022-01-19 03:10:36,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 234 transitions, 1353 flow [2022-01-19 03:10:36,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 234 transitions, 1221 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-01-19 03:10:36,385 INFO L242 Difference]: Finished difference. Result has 231 places, 232 transitions, 1183 flow [2022-01-19 03:10:36,385 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=231, PETRI_TRANSITIONS=232} [2022-01-19 03:10:36,385 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 111 predicate places. [2022-01-19 03:10:36,385 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 232 transitions, 1183 flow [2022-01-19 03:10:36,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 03:10:36,386 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:36,386 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 03:10:36,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 03:10:36,386 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:36,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:36,386 INFO L85 PathProgramCache]: Analyzing trace with hash -211696674, now seen corresponding path program 5 times [2022-01-19 03:10:36,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:36,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126787983] [2022-01-19 03:10:36,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:36,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:36,467 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 03:10:36,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:36,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126787983] [2022-01-19 03:10:36,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126787983] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:36,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082219805] [2022-01-19 03:10:36,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 03:10:36,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:36,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:36,471 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 03:10:36,475 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 03:10:36,552 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-19 03:10:36,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:10:36,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 03:10:36,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 03:10:36,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 19 proven. 23 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 03:10:36,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082219805] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:36,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:36,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-01-19 03:10:36,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344760781] [2022-01-19 03:10:36,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:36,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 03:10:36,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:36,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 03:10:36,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-19 03:10:36,883 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 135 [2022-01-19 03:10:36,884 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 232 transitions, 1183 flow. Second operand has 11 states, 11 states have (on average 118.72727272727273) internal successors, (1306), 11 states have internal predecessors, (1306), 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 03:10:36,884 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:36,884 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 135 [2022-01-19 03:10:36,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:37,140 INFO L129 PetriNetUnfolder]: 349/2048 cut-off events. [2022-01-19 03:10:37,140 INFO L130 PetriNetUnfolder]: For 12066/12158 co-relation queries the response was YES. [2022-01-19 03:10:37,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5981 conditions, 2048 events. 349/2048 cut-off events. For 12066/12158 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13541 event pairs, 55 based on Foata normal form. 87/2109 useless extension candidates. Maximal degree in co-relation 5927. Up to 245 conditions per place. [2022-01-19 03:10:37,157 INFO L132 encePairwiseOnDemand]: 129/135 looper letters, 27 selfloop transitions, 56 changer transitions 0/254 dead transitions. [2022-01-19 03:10:37,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 254 transitions, 1515 flow [2022-01-19 03:10:37,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 03:10:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 03:10:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1433 transitions. [2022-01-19 03:10:37,159 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8845679012345679 [2022-01-19 03:10:37,159 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1433 transitions. [2022-01-19 03:10:37,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1433 transitions. [2022-01-19 03:10:37,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:37,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1433 transitions. [2022-01-19 03:10:37,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.41666666666667) internal successors, (1433), 12 states have internal predecessors, (1433), 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 03:10:37,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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 03:10:37,164 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 135.0) internal successors, (1755), 13 states have internal predecessors, (1755), 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 03:10:37,164 INFO L186 Difference]: Start difference. First operand has 231 places, 232 transitions, 1183 flow. Second operand 12 states and 1433 transitions. [2022-01-19 03:10:37,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 254 transitions, 1515 flow [2022-01-19 03:10:37,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 254 transitions, 1507 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 03:10:37,186 INFO L242 Difference]: Finished difference. Result has 244 places, 238 transitions, 1433 flow [2022-01-19 03:10:37,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1433, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2022-01-19 03:10:37,188 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 124 predicate places. [2022-01-19 03:10:37,188 INFO L470 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 1433 flow [2022-01-19 03:10:37,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.72727272727273) internal successors, (1306), 11 states have internal predecessors, (1306), 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 03:10:37,188 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:37,189 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:37,205 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 03:10:37,405 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 03:10:37,405 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:37,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:37,405 INFO L85 PathProgramCache]: Analyzing trace with hash 870212256, now seen corresponding path program 6 times [2022-01-19 03:10:37,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:37,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854533241] [2022-01-19 03:10:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:37,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 99 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-19 03:10:37,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854533241] [2022-01-19 03:10:37,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854533241] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:37,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279768966] [2022-01-19 03:10:37,506 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-19 03:10:37,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:37,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 03:10:37,661 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-19 03:10:37,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 03:10:37,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 03:10:37,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-19 03:10:37,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 67 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-01-19 03:10:37,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279768966] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:37,990 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:37,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 13 [2022-01-19 03:10:37,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355003054] [2022-01-19 03:10:37,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:37,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 03:10:37,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:37,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 03:10:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-19 03:10:37,992 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 135 [2022-01-19 03:10:37,993 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 1433 flow. Second operand has 13 states, 13 states have (on average 116.15384615384616) internal successors, (1510), 13 states have internal predecessors, (1510), 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 03:10:37,993 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:37,993 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 135 [2022-01-19 03:10:37,993 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:38,133 INFO L129 PetriNetUnfolder]: 142/871 cut-off events. [2022-01-19 03:10:38,134 INFO L130 PetriNetUnfolder]: For 6016/6053 co-relation queries the response was YES. [2022-01-19 03:10:38,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 871 events. 142/871 cut-off events. For 6016/6053 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3486 event pairs, 41 based on Foata normal form. 85/942 useless extension candidates. Maximal degree in co-relation 2788. Up to 71 conditions per place. [2022-01-19 03:10:38,141 INFO L132 encePairwiseOnDemand]: 124/135 looper letters, 18 selfloop transitions, 11 changer transitions 0/207 dead transitions. [2022-01-19 03:10:38,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 207 transitions, 1203 flow [2022-01-19 03:10:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 03:10:38,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 03:10:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 931 transitions. [2022-01-19 03:10:38,143 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.862037037037037 [2022-01-19 03:10:38,143 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 931 transitions. [2022-01-19 03:10:38,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 931 transitions. [2022-01-19 03:10:38,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:38,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 931 transitions. [2022-01-19 03:10:38,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.375) internal successors, (931), 8 states have internal predecessors, (931), 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 03:10:38,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 135.0) internal successors, (1215), 9 states have internal predecessors, (1215), 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 03:10:38,147 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 135.0) internal successors, (1215), 9 states have internal predecessors, (1215), 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 03:10:38,147 INFO L186 Difference]: Start difference. First operand has 244 places, 238 transitions, 1433 flow. Second operand 8 states and 931 transitions. [2022-01-19 03:10:38,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 207 transitions, 1203 flow [2022-01-19 03:10:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 207 transitions, 972 flow, removed 70 selfloop flow, removed 22 redundant places. [2022-01-19 03:10:38,163 INFO L242 Difference]: Finished difference. Result has 219 places, 200 transitions, 930 flow [2022-01-19 03:10:38,164 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=930, PETRI_PLACES=219, PETRI_TRANSITIONS=200} [2022-01-19 03:10:38,164 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 99 predicate places. [2022-01-19 03:10:38,164 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 200 transitions, 930 flow [2022-01-19 03:10:38,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 116.15384615384616) internal successors, (1510), 13 states have internal predecessors, (1510), 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 03:10:38,165 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 03:10:38,165 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:38,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:38,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:38,379 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 03:10:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 03:10:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -698864358, now seen corresponding path program 7 times [2022-01-19 03:10:38,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 03:10:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654492617] [2022-01-19 03:10:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 03:10:38,380 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 03:10:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:38,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 03:10:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654492617] [2022-01-19 03:10:38,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654492617] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 03:10:38,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867929391] [2022-01-19 03:10:38,746 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-19 03:10:38,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:38,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 03:10:38,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 03:10:38,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 03:10:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 03:10:38,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 32 conjunts are in the unsatisfiable core [2022-01-19 03:10:38,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 03:10:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 141 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:39,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 03:10:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 03:10:40,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867929391] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 03:10:40,562 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 03:10:40,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 18] total 44 [2022-01-19 03:10:40,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353856898] [2022-01-19 03:10:40,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 03:10:40,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-19 03:10:40,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 03:10:40,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-19 03:10:40,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2022-01-19 03:10:40,567 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 135 [2022-01-19 03:10:40,570 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 200 transitions, 930 flow. Second operand has 44 states, 44 states have (on average 113.88636363636364) internal successors, (5011), 44 states have internal predecessors, (5011), 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 03:10:40,570 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 03:10:40,570 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 135 [2022-01-19 03:10:40,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 03:10:41,054 INFO L129 PetriNetUnfolder]: 128/791 cut-off events. [2022-01-19 03:10:41,055 INFO L130 PetriNetUnfolder]: For 2298/2336 co-relation queries the response was YES. [2022-01-19 03:10:41,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 791 events. 128/791 cut-off events. For 2298/2336 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3015 event pairs, 38 based on Foata normal form. 33/811 useless extension candidates. Maximal degree in co-relation 2255. Up to 51 conditions per place. [2022-01-19 03:10:41,059 INFO L132 encePairwiseOnDemand]: 126/135 looper letters, 0 selfloop transitions, 0 changer transitions 211/211 dead transitions. [2022-01-19 03:10:41,059 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 211 transitions, 1094 flow [2022-01-19 03:10:41,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 03:10:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 03:10:41,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2280 transitions. [2022-01-19 03:10:41,062 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2022-01-19 03:10:41,062 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2280 transitions. [2022-01-19 03:10:41,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2280 transitions. [2022-01-19 03:10:41,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 03:10:41,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2280 transitions. [2022-01-19 03:10:41,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 114.0) internal successors, (2280), 20 states have internal predecessors, (2280), 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 03:10:41,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 135.0) internal successors, (2835), 21 states have internal predecessors, (2835), 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 03:10:41,068 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 135.0) internal successors, (2835), 21 states have internal predecessors, (2835), 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 03:10:41,068 INFO L186 Difference]: Start difference. First operand has 219 places, 200 transitions, 930 flow. Second operand 20 states and 2280 transitions. [2022-01-19 03:10:41,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 211 transitions, 1094 flow [2022-01-19 03:10:41,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 211 transitions, 1070 flow, removed 1 selfloop flow, removed 7 redundant places. [2022-01-19 03:10:41,077 INFO L242 Difference]: Finished difference. Result has 229 places, 0 transitions, 0 flow [2022-01-19 03:10:41,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=135, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=0, PETRI_PLACES=229, PETRI_TRANSITIONS=0} [2022-01-19 03:10:41,078 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 109 predicate places. [2022-01-19 03:10:41,078 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 0 transitions, 0 flow [2022-01-19 03:10:41,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 113.88636363636364) internal successors, (5011), 44 states have internal predecessors, (5011), 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 03:10:41,081 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-19 03:10:41,081 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-01-19 03:10:41,081 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-01-19 03:10:41,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 03:10:41,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 03:10:41,301 INFO L732 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-01-19 03:10:41,302 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 03:10:41,302 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 03:10:41,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 03:10:41 BasicIcfg [2022-01-19 03:10:41,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 03:10:41,304 INFO L158 Benchmark]: Toolchain (without parser) took 11101.52ms. Allocated memory was 390.1MB in the beginning and 736.1MB in the end (delta: 346.0MB). Free memory was 335.4MB in the beginning and 561.8MB in the end (delta: -226.3MB). Peak memory consumption was 121.8MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,304 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 03:10:41,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.12ms. Allocated memory was 390.1MB in the beginning and 608.2MB in the end (delta: 218.1MB). Free memory was 335.2MB in the beginning and 566.0MB in the end (delta: -230.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.57ms. Allocated memory is still 608.2MB. Free memory was 566.0MB in the beginning and 563.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,305 INFO L158 Benchmark]: Boogie Preprocessor took 34.41ms. Allocated memory is still 608.2MB. Free memory was 563.9MB in the beginning and 561.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,305 INFO L158 Benchmark]: RCFGBuilder took 482.52ms. Allocated memory is still 608.2MB. Free memory was 561.8MB in the beginning and 545.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,305 INFO L158 Benchmark]: TraceAbstraction took 10069.99ms. Allocated memory was 608.2MB in the beginning and 736.1MB in the end (delta: 127.9MB). Free memory was 543.9MB in the beginning and 561.8MB in the end (delta: -17.8MB). Peak memory consumption was 113.6MB. Max. memory is 16.0GB. [2022-01-19 03:10:41,306 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 390.1MB. Free memory is still 353.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 434.12ms. Allocated memory was 390.1MB in the beginning and 608.2MB in the end (delta: 218.1MB). Free memory was 335.2MB in the beginning and 566.0MB in the end (delta: -230.7MB). Peak memory consumption was 6.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.57ms. Allocated memory is still 608.2MB. Free memory was 566.0MB in the beginning and 563.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.41ms. Allocated memory is still 608.2MB. Free memory was 563.9MB in the beginning and 561.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 482.52ms. Allocated memory is still 608.2MB. Free memory was 561.8MB in the beginning and 545.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 10069.99ms. Allocated memory was 608.2MB in the beginning and 736.1MB in the end (delta: 127.9MB). Free memory was 543.9MB in the beginning and 561.8MB in the end (delta: -17.8MB). Peak memory consumption was 113.6MB. 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 - PositiveResult [Line: 919]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 171 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 555 mSDsluCounter, 299 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 526 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1250 IncrementalHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 75 mSDtfsCounter, 1250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1878 GetRequests, 1710 SyntacticMatches, 5 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1433occurred in iteration=8, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2282 NumberOfCodeBlocks, 2141 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 3010 ConstructedInterpolants, 0 QuantifiedInterpolants, 8614 SizeOfPredicates, 28 NumberOfNonLiveVariables, 2199 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 789/1405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-01-19 03:10:41,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...