/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 03:55:07,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 03:55:07,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 03:55:07,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 03:55:07,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 03:55:07,766 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 03:55:07,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 03:55:07,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 03:55:07,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 03:55:07,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 03:55:07,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 03:55:07,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 03:55:07,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 03:55:07,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 03:55:07,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 03:55:07,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 03:55:07,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 03:55:07,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 03:55:07,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 03:55:07,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 03:55:07,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 03:55:07,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 03:55:07,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 03:55:07,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 03:55:07,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 03:55:07,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 03:55:07,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 03:55:07,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 03:55:07,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 03:55:07,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 03:55:07,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 03:55:07,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 03:55:07,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 03:55:07,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 03:55:07,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 03:55:07,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 03:55:07,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 03:55:07,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 03:55:07,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 03:55:07,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 03:55:07,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 03:55:07,859 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-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 03:55:07,914 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 03:55:07,915 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 03:55:07,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 03:55:07,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 03:55:07,919 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 03:55:07,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 03:55:07,920 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 03:55:07,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 03:55:07,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 03:55:07,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 03:55:07,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 03:55:07,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 03:55:07,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 03:55:07,922 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 03:55:07,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 03:55:07,923 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 03:55:07,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 03:55:07,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 03:55:07,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 03:55:07,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 03:55:07,924 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 03:55:07,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 03:55:07,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 03:55:07,925 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 03:55:07,925 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 03:55:07,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 03:55:07,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 03:55:07,926 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 03:55:07,926 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 03:55:07,926 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 03:55:07,926 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-04-29 03:55:08,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 03:55:08,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 03:55:08,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 03:55:08,417 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-04-29 03:55:08,418 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-04-29 03:55:08,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl [2021-04-29 03:55:08,420 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_in_loop.bpl' [2021-04-29 03:55:08,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 03:55:08,499 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-04-29 03:55:08,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 03:55:08,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 03:55:08,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 03:55:08,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,537 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 03:55:08,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 03:55:08,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 03:55:08,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 03:55:08,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... [2021-04-29 03:55:08,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 03:55:08,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 03:55:08,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 03:55:08,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 03:55:08,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 03:55:08,671 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2021-04-29 03:55:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2021-04-29 03:55:08,671 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2021-04-29 03:55:08,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 03:55:08,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 03:55:08,673 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 03:55:08,873 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 03:55:08,874 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-04-29 03:55:08,875 INFO L202 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 03:55:08 BoogieIcfgContainer [2021-04-29 03:55:08,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 03:55:08,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 03:55:08,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 03:55:08,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 03:55:08,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 29.04 03:55:08" (1/2) ... [2021-04-29 03:55:08,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179bebcc and model type fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 03:55:08, skipping insertion in model container [2021-04-29 03:55:08,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 03:55:08" (2/2) ... [2021-04-29 03:55:08,884 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_in_loop.bpl [2021-04-29 03:55:08,891 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 03:55:08,896 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-04-29 03:55:08,897 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 03:55:08,920 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,921 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,921 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,922 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,924 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,930 WARN L313 ript$VariableManager]: TermVariabe fooThread1of1ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:08,942 INFO L149 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2021-04-29 03:55:08,989 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-04-29 03:55:09,061 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 03:55:09,065 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 03:55:09,065 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 03:55:09,065 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 03:55:09,066 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 03:55:09,066 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 03:55:09,066 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 03:55:09,066 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 03:55:09,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 78 flow [2021-04-29 03:55:09,142 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-04-29 03:55:09,142 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-04-29 03:55:09,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 03:55:09,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 25 transitions, 78 flow [2021-04-29 03:55:09,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 45 flow [2021-04-29 03:55:09,152 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:09,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 45 flow [2021-04-29 03:55:09,174 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 45 flow [2021-04-29 03:55:09,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 45 flow [2021-04-29 03:55:09,183 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-04-29 03:55:09,184 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-04-29 03:55:09,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 03:55:09,186 INFO L146 LiptonReduction]: Number of co-enabled transitions 32 [2021-04-29 03:55:09,296 INFO L158 LiptonReduction]: Checked pairs total: 14 [2021-04-29 03:55:09,296 INFO L160 LiptonReduction]: Total number of compositions: 5 [2021-04-29 03:55:09,300 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-04-29 03:55:09,313 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2021-04-29 03:55:09,313 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 03:55:09,314 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:09,314 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-29 03:55:09,315 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-04-29 03:55:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 61985709, now seen corresponding path program 1 times [2021-04-29 03:55:09,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:09,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275637596] [2021-04-29 03:55:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:09,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:09,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:09,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:09,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:09,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275637596] [2021-04-29 03:55:09,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:09,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 03:55:09,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146109993] [2021-04-29 03:55:09,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 03:55:09,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 03:55:09,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-29 03:55:09,547 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 30 [2021-04-29 03:55:09,549 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-04-29 03:55:09,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:09,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 30 [2021-04-29 03:55:09,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:09,653 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-04-29 03:55:09,654 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-04-29 03:55:09,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 19 events. 0/19 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 0 based on Foata normal form. 1/13 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2021-04-29 03:55:09,657 INFO L132 encePairwiseOnDemand]: 22/30 looper letters, 5 selfloop transitions, 4 changer transitions 6/19 dead transitions. [2021-04-29 03:55:09,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 77 flow [2021-04-29 03:55:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 03:55:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 03:55:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2021-04-29 03:55:09,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2021-04-29 03:55:09,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 71 transitions. [2021-04-29 03:55:09,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 71 transitions. [2021-04-29 03:55:09,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:09,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 71 transitions. [2021-04-29 03:55:09,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2021-04-29 03:55:09,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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) [2021-04-29 03:55:09,707 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 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) [2021-04-29 03:55:09,709 INFO L185 Difference]: Start difference. First operand has 23 places, 18 transitions, 49 flow. Second operand 4 states and 71 transitions. [2021-04-29 03:55:09,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 77 flow [2021-04-29 03:55:09,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 73 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:09,723 INFO L241 Difference]: Finished difference. Result has 24 places, 13 transitions, 46 flow [2021-04-29 03:55:09,727 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=46, PETRI_PLACES=24, PETRI_TRANSITIONS=13} [2021-04-29 03:55:09,728 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 1 predicate places. [2021-04-29 03:55:09,729 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:09,729 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 13 transitions, 46 flow [2021-04-29 03:55:09,730 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 13 transitions, 46 flow [2021-04-29 03:55:09,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 20 places, 13 transitions, 46 flow [2021-04-29 03:55:09,746 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-04-29 03:55:09,747 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-04-29 03:55:09,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 13 events. 0/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 6 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 03:55:09,752 INFO L146 LiptonReduction]: Number of co-enabled transitions 12 [2021-04-29 03:55:09,754 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 03:55:09,755 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:09,755 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-04-29 03:55:09,757 INFO L480 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 46 flow [2021-04-29 03:55:09,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) [2021-04-29 03:55:09,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:09,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:09,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 03:55:09,758 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-04-29 03:55:09,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:09,759 INFO L82 PathProgramCache]: Analyzing trace with hash -838848383, now seen corresponding path program 1 times [2021-04-29 03:55:09,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:09,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639046866] [2021-04-29 03:55:09,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:09,775 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:09,786 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:09,805 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 03:55:09,805 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 03:55:09,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 03:55:09,808 WARN L342 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-04-29 03:55:09,809 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-04-29 03:55:09,816 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,816 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,816 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,817 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,817 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,817 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,818 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,818 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,818 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,821 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork0_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,824 WARN L313 ript$VariableManager]: TermVariabe fooThread1of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,826 WARN L313 ript$VariableManager]: TermVariabe fooThread2of2ForFork1_y not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 03:55:09,842 INFO L149 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2021-04-29 03:55:09,843 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-04-29 03:55:09,845 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 03:55:09,845 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 03:55:09,845 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 03:55:09,846 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 03:55:09,846 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 03:55:09,846 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 03:55:09,846 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 03:55:09,846 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 03:55:09,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 37 transitions, 134 flow [2021-04-29 03:55:09,876 INFO L129 PetriNetUnfolder]: 14/111 cut-off events. [2021-04-29 03:55:09,877 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-04-29 03:55:09,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 111 events. 14/111 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 400 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 80. Up to 15 conditions per place. [2021-04-29 03:55:09,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 37 transitions, 134 flow [2021-04-29 03:55:09,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 120 flow [2021-04-29 03:55:09,882 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:09,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 33 transitions, 120 flow [2021-04-29 03:55:09,883 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 33 transitions, 120 flow [2021-04-29 03:55:09,884 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 33 transitions, 120 flow [2021-04-29 03:55:09,904 INFO L129 PetriNetUnfolder]: 14/101 cut-off events. [2021-04-29 03:55:09,905 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2021-04-29 03:55:09,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 101 events. 14/101 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 367 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 80. Up to 15 conditions per place. [2021-04-29 03:55:09,908 INFO L146 LiptonReduction]: Number of co-enabled transitions 280 [2021-04-29 03:55:09,990 INFO L158 LiptonReduction]: Checked pairs total: 98 [2021-04-29 03:55:09,991 INFO L160 LiptonReduction]: Total number of compositions: 7 [2021-04-29 03:55:09,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-04-29 03:55:09,998 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-04-29 03:55:09,998 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-04-29 03:55:09,998 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:09,999 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2021-04-29 03:55:09,999 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-04-29 03:55:09,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash -445383994, now seen corresponding path program 1 times [2021-04-29 03:55:10,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:10,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556448510] [2021-04-29 03:55:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:10,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:10,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:10,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 03:55:10,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556448510] [2021-04-29 03:55:10,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:10,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 03:55:10,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152097293] [2021-04-29 03:55:10,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 03:55:10,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:10,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 03:55:10,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-04-29 03:55:10,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 44 [2021-04-29 03:55:10,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2021-04-29 03:55:10,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:10,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 44 [2021-04-29 03:55:10,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:10,086 INFO L129 PetriNetUnfolder]: 1/36 cut-off events. [2021-04-29 03:55:10,087 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2021-04-29 03:55:10,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 36 events. 1/36 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 58 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 75. Up to 14 conditions per place. [2021-04-29 03:55:10,088 INFO L132 encePairwiseOnDemand]: 37/44 looper letters, 10 selfloop transitions, 4 changer transitions 8/32 dead transitions. [2021-04-29 03:55:10,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 136 flow [2021-04-29 03:55:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 03:55:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 03:55:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2021-04-29 03:55:10,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6534090909090909 [2021-04-29 03:55:10,091 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2021-04-29 03:55:10,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2021-04-29 03:55:10,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:10,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2021-04-29 03:55:10,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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) [2021-04-29 03:55:10,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2021-04-29 03:55:10,095 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 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) [2021-04-29 03:55:10,095 INFO L185 Difference]: Start difference. First operand has 37 places, 35 transitions, 124 flow. Second operand 4 states and 115 transitions. [2021-04-29 03:55:10,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 136 flow [2021-04-29 03:55:10,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 03:55:10,098 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 93 flow [2021-04-29 03:55:10,099 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2021-04-29 03:55:10,099 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-04-29 03:55:10,099 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:10,099 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 23 transitions, 93 flow [2021-04-29 03:55:10,100 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 23 transitions, 93 flow [2021-04-29 03:55:10,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 93 flow [2021-04-29 03:55:10,106 INFO L129 PetriNetUnfolder]: 1/27 cut-off events. [2021-04-29 03:55:10,106 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-04-29 03:55:10,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 27 events. 1/27 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2021-04-29 03:55:10,107 INFO L146 LiptonReduction]: Number of co-enabled transitions 60 [2021-04-29 03:55:10,110 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 03:55:10,110 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:10,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-04-29 03:55:10,113 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 93 flow [2021-04-29 03:55:10,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 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) [2021-04-29 03:55:10,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:10,114 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:10,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 03:55:10,115 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-04-29 03:55:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:10,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917506, now seen corresponding path program 1 times [2021-04-29 03:55:10,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:10,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300729387] [2021-04-29 03:55:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 03:55:10,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 03:55:10,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:10,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:10,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 03:55:10,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 03:55:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-04-29 03:55:10,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300729387] [2021-04-29 03:55:10,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 03:55:10,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 03:55:10,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573291186] [2021-04-29 03:55:10,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 03:55:10,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 03:55:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 03:55:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-04-29 03:55:10,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 44 [2021-04-29 03:55:10,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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) [2021-04-29 03:55:10,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 03:55:10,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 44 [2021-04-29 03:55:10,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 03:55:10,217 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-04-29 03:55:10,218 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-04-29 03:55:10,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 25 events. 1/25 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 2/25 useless extension candidates. Maximal degree in co-relation 31. Up to 7 conditions per place. [2021-04-29 03:55:10,218 INFO L132 encePairwiseOnDemand]: 37/44 looper letters, 8 selfloop transitions, 5 changer transitions 3/24 dead transitions. [2021-04-29 03:55:10,219 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 121 flow [2021-04-29 03:55:10,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 03:55:10,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 03:55:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2021-04-29 03:55:10,221 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2021-04-29 03:55:10,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 136 transitions. [2021-04-29 03:55:10,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 136 transitions. [2021-04-29 03:55:10,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 03:55:10,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 136 transitions. [2021-04-29 03:55:10,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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) [2021-04-29 03:55:10,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2021-04-29 03:55:10,225 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 44.0) internal successors, (264), 6 states have internal predecessors, (264), 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) [2021-04-29 03:55:10,226 INFO L185 Difference]: Start difference. First operand has 30 places, 23 transitions, 93 flow. Second operand 5 states and 136 transitions. [2021-04-29 03:55:10,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 121 flow [2021-04-29 03:55:10,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 24 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 03:55:10,228 INFO L241 Difference]: Finished difference. Result has 32 places, 20 transitions, 95 flow [2021-04-29 03:55:10,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2021-04-29 03:55:10,229 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2021-04-29 03:55:10,230 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 03:55:10,230 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 95 flow [2021-04-29 03:55:10,230 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 20 transitions, 95 flow [2021-04-29 03:55:10,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 95 flow [2021-04-29 03:55:10,236 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-04-29 03:55:10,236 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-04-29 03:55:10,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 21 events. 1/21 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 21. Up to 5 conditions per place. [2021-04-29 03:55:10,237 INFO L146 LiptonReduction]: Number of co-enabled transitions 24 [2021-04-29 03:55:10,239 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 03:55:10,239 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 03:55:10,239 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-04-29 03:55:10,241 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 95 flow [2021-04-29 03:55:10,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 5 states have internal predecessors, (133), 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) [2021-04-29 03:55:10,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 03:55:10,242 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 03:55:10,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 03:55:10,242 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-04-29 03:55:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 03:55:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1089586133, now seen corresponding path program 1 times [2021-04-29 03:55:10,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 03:55:10,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413814744] [2021-04-29 03:55:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 03:55:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:10,255 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 03:55:10,265 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 03:55:10,270 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 03:55:10,270 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 03:55:10,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 03:55:10,292 INFO L202 PluginConnector]: Adding new model fork_in_loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 03:55:10 BasicIcfg [2021-04-29 03:55:10,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 03:55:10,294 INFO L168 Benchmark]: Toolchain (without parser) took 1838.41 ms. Allocated memory is still 302.0 MB. Free memory was 271.5 MB in the beginning and 231.7 MB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:10,295 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.79 ms. Allocated memory is still 302.0 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 03:55:10,296 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.58 ms. Allocated memory is still 302.0 MB. Free memory was 268.5 MB in the beginning and 285.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:10,296 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 ms. Allocated memory is still 302.0 MB. Free memory was 285.5 MB in the beginning and 284.5 MB in the end (delta: 954.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:10,297 INFO L168 Benchmark]: RCFGBuilder took 304.52 ms. Allocated memory is still 302.0 MB. Free memory was 284.5 MB in the beginning and 282.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:10,298 INFO L168 Benchmark]: TraceAbstraction took 1415.10 ms. Allocated memory is still 302.0 MB. Free memory was 281.8 MB in the beginning and 231.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 53.2 MB. Max. memory is 16.0 GB. [2021-04-29 03:55:10,301 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.79 ms. Allocated memory is still 302.0 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.58 ms. Allocated memory is still 302.0 MB. Free memory was 268.5 MB in the beginning and 285.5 MB in the end (delta: -17.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.14 ms. Allocated memory is still 302.0 MB. Free memory was 285.5 MB in the beginning and 284.5 MB in the end (delta: 954.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 304.52 ms. Allocated memory is still 302.0 MB. Free memory was 284.5 MB in the beginning and 282.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 1415.10 ms. Allocated memory is still 302.0 MB. Free memory was 281.8 MB in the beginning and 231.7 MB in the end (delta: 50.1 MB). Peak memory consumption was 53.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.9ms, 21 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 18 TransitionsAfterwards, 32 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.6ms, 24 PlacesBefore, 20 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 14, Positive conditional cache size: 14, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.0ms, 35 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 35 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 98 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 98, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 98, positive: 98, positive conditional: 0, positive unconditional: 98, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 98, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 98, unknown conditional: 98, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 98, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.3ms, 35 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 98, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9ms, 32 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 98, Positive conditional cache size: 98, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 35]: assertion can be violated assertion can be violated We found a FailurePath: [L20] 0 x := 1; VAL [x=1] [L22] COND TRUE 0 x < 2 VAL [x=1] [L23] FORK 0 fork x foo(x); VAL [i=1, x=1] [L24] 0 x := x + 1; VAL [i=1, x=2] [L22] COND FALSE 0 !(x < 2) [L26] 0 x := 1; VAL [i=1, x=1] [L42] 1 y := 4; [L27] JOIN 1 join x; VAL [i=1, x=1, y=4] [L28] COND TRUE 0 x < 3 VAL [i=1, x=1, y=4] [L29] FORK 0 fork x foo(x); VAL [i=1, x=1, y=4] [L30] 0 x := x + 1; VAL [i=1, x=2, y=4] [L28] COND TRUE 0 x < 3 VAL [i=1, x=2, y=4] [L29] FORK 0 fork x foo(x); VAL [i=2, x=2, y=4] [L42] 3 y := 4; [L42] 2 y := 4; [L30] 0 x := x + 1; VAL [i=2, x=3, y=4] [L28] COND FALSE 0 !(x < 3) VAL [i=2, x=3, y=4] [L33] JOIN 2 join 1; VAL [i=2, x=3, y=4] [L34] JOIN 3 join 2; VAL [i=2, x=3, y=4] [L35] 0 assert false; VAL [i=2, x=3, y=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 2 CEGAR loops. EmptinessCheckTime: 10.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 1185.0ms, OverallIterations: 5, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 316.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 388.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3 SDtfs, 19 SDslu, 0 SDs, 0 SdLazy, 69 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 108.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.0ms SsaConstructionTime, 53.6ms SatisfiabilityAnalysisTime, 123.5ms InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 12/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...