/usr/bin/java -Xmx8000000000 -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-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/fork_multiple_parameter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 17:53:17,895 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 17:53:17,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 17:53:17,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 17:53:17,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 17:53:17,929 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 17:53:17,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 17:53:17,935 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 17:53:17,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 17:53:17,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 17:53:17,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 17:53:17,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 17:53:17,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 17:53:17,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 17:53:17,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 17:53:17,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 17:53:17,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 17:53:17,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 17:53:17,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 17:53:17,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 17:53:17,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 17:53:17,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 17:53:17,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 17:53:17,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 17:53:17,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 17:53:17,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 17:53:17,967 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 17:53:17,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 17:53:17,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 17:53:17,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 17:53:17,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 17:53:17,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 17:53:17,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 17:53:17,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 17:53:17,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 17:53:17,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 17:53:17,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 17:53:17,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 17:53:17,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 17:53:17,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 17:53:17,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 17:53:17,977 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-OGIterative-CovSimpl-Hitting.epf [2021-08-13 17:53:18,004 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 17:53:18,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 17:53:18,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 17:53:18,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 17:53:18,007 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 17:53:18,008 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 17:53:18,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 17:53:18,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 17:53:18,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 17:53:18,009 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 17:53:18,009 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 17:53:18,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 17:53:18,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 17:53:18,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 17:53:18,011 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=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-08-13 17:53:18,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 17:53:18,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 17:53:18,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 17:53:18,299 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-13 17:53:18,304 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-13 17:53:18,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_multiple_parameter.bpl [2021-08-13 17:53:18,305 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_multiple_parameter.bpl' [2021-08-13 17:53:18,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 17:53:18,329 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-13 17:53:18,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 17:53:18,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 17:53:18,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 17:53:18,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 17:53:18,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 17:53:18,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 17:53:18,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 17:53:18,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/1) ... [2021-08-13 17:53:18,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 17:53:18,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 17:53:18,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 17:53:18,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 17:53:18,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (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-08-13 17:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure add [2021-08-13 17:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2021-08-13 17:53:18,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 17:53:18,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 17:53:18,421 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 17:53:18,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 17:53:18,548 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-08-13 17:53:18,549 INFO L202 PluginConnector]: Adding new model fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:53:18 BoogieIcfgContainer [2021-08-13 17:53:18,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 17:53:18,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 17:53:18,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 17:53:18,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 17:53:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.08 05:53:18" (1/2) ... [2021-08-13 17:53:18,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41544ca6 and model type fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 05:53:18, skipping insertion in model container [2021-08-13 17:53:18,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 05:53:18" (2/2) ... [2021-08-13 17:53:18,555 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_multiple_parameter.bpl [2021-08-13 17:53:18,558 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 17:53:18,559 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 17:53:18,559 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 17:53:18,577 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,577 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,577 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,578 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,581 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 17:53:18,592 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-08-13 17:53:18,613 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-13 17:53:18,636 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 17:53:18,637 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 17:53:18,637 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 17:53:18,637 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 17:53:18,637 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 17:53:18,637 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 17:53:18,637 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 17:53:18,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 17:53:18,643 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 17 places, 13 transitions, 34 flow [2021-08-13 17:53:18,654 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-08-13 17:53:18,654 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-08-13 17:53:18,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17 conditions, 12 events. 0/12 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 4 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-08-13 17:53:18,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 13 transitions, 34 flow [2021-08-13 17:53:18,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 10 transitions, 26 flow [2021-08-13 17:53:18,659 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-08-13 17:53:18,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 17:53:18,660 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 17:53:18,660 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-08-13 17:53:18,660 INFO L430 AbstractCegarLoop]: === Iteration 1 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 17:53:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 17:53:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1444345, now seen corresponding path program 1 times [2021-08-13 17:53:18,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 17:53:18,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88189645] [2021-08-13 17:53:18,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 17:53:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 17:53:18,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,764 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-08-13 17:53:18,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 17:53:18,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 17:53:18,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88189645] [2021-08-13 17:53:18,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88189645] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 17:53:18,774 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 17:53:18,775 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 17:53:18,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846371553] [2021-08-13 17:53:18,780 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-08-13 17:53:18,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 17:53:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-13 17:53:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-13 17:53:18,807 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 13 [2021-08-13 17:53:18,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 10 transitions, 26 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08-13 17:53:18,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 17:53:18,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 13 [2021-08-13 17:53:18,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 17:53:18,868 INFO L129 PetriNetUnfolder]: 2/13 cut-off events. [2021-08-13 17:53:18,868 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-13 17:53:18,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 13 events. 2/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 15. Up to 6 conditions per place. [2021-08-13 17:53:18,870 INFO L132 encePairwiseOnDemand]: 9/13 looper letters, 5 selfloop transitions, 3 changer transitions 0/11 dead transitions. [2021-08-13 17:53:18,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 44 flow [2021-08-13 17:53:18,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-13 17:53:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-08-13 17:53:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-08-13 17:53:18,877 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2021-08-13 17:53:18,877 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 35 transitions. [2021-08-13 17:53:18,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 35 transitions. [2021-08-13 17:53:18,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 17:53:18,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 35 transitions. [2021-08-13 17:53:18,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-08-13 17:53:18,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-08-13 17:53:18,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-08-13 17:53:18,884 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 3 predicate places. [2021-08-13 17:53:18,884 INFO L482 AbstractCegarLoop]: Abstraction has has 17 places, 11 transitions, 44 flow [2021-08-13 17:53:18,884 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-08-13 17:53:18,884 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 17:53:18,884 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 17:53:18,884 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 17:53:18,884 INFO L430 AbstractCegarLoop]: === Iteration 2 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 17:53:18,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 17:53:18,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1520910336, now seen corresponding path program 1 times [2021-08-13 17:53:18,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 17:53:18,885 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766951996] [2021-08-13 17:53:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 17:53:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 17:53:18,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 17:53:18,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 17:53:18,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:18,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:18,984 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 17:53:18,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 17:53:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 17:53:19,000 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 17:53:19,000 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766951996] [2021-08-13 17:53:19,001 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766951996] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 17:53:19,002 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 17:53:19,002 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 17:53:19,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982434912] [2021-08-13 17:53:19,003 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 17:53:19,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 17:53:19,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 17:53:19,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 17:53:19,008 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 17:53:19,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 11 transitions, 44 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 17:53:19,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 17:53:19,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 17:53:19,184 INFO L129 PetriNetUnfolder]: 1/15 cut-off events. [2021-08-13 17:53:19,184 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-08-13 17:53:19,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 15 events. 1/15 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 2/17 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2021-08-13 17:53:19,185 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 4 selfloop transitions, 6 changer transitions 3/14 dead transitions. [2021-08-13 17:53:19,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 14 transitions, 83 flow [2021-08-13 17:53:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 17:53:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 17:53:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2021-08-13 17:53:19,188 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2021-08-13 17:53:19,189 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 39 transitions. [2021-08-13 17:53:19,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 39 transitions. [2021-08-13 17:53:19,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 17:53:19,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 39 transitions. [2021-08-13 17:53:19,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 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-08-13 17:53:19,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-08-13 17:53:19,195 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-08-13 17:53:19,195 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 11 predicate places. [2021-08-13 17:53:19,196 INFO L482 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 83 flow [2021-08-13 17:53:19,196 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,196 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 17:53:19,196 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 17:53:19,196 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 17:53:19,196 INFO L430 AbstractCegarLoop]: === Iteration 3 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 17:53:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 17:53:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1807797666, now seen corresponding path program 2 times [2021-08-13 17:53:19,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 17:53:19,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406066418] [2021-08-13 17:53:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 17:53:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 17:53:19,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 17:53:19,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 17:53:19,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 17:53:19,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,281 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 17:53:19,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 17:53:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 17:53:19,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 17:53:19,293 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406066418] [2021-08-13 17:53:19,293 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406066418] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 17:53:19,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 17:53:19,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 17:53:19,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94733063] [2021-08-13 17:53:19,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 17:53:19,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 17:53:19,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 17:53:19,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 17:53:19,297 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 17:53:19,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 83 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 17:53:19,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 17:53:19,298 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 17:53:19,440 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-08-13 17:53:19,440 INFO L130 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2021-08-13 17:53:19,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 18 events. 0/18 cut-off events. For 20/23 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 4/22 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2021-08-13 17:53:19,440 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 4 selfloop transitions, 4 changer transitions 7/16 dead transitions. [2021-08-13 17:53:19,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 126 flow [2021-08-13 17:53:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 17:53:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 17:53:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2021-08-13 17:53:19,441 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3418803418803419 [2021-08-13 17:53:19,441 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 40 transitions. [2021-08-13 17:53:19,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 40 transitions. [2021-08-13 17:53:19,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 17:53:19,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 40 transitions. [2021-08-13 17:53:19,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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-08-13 17:53:19,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-08-13 17:53:19,442 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-08-13 17:53:19,442 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 19 predicate places. [2021-08-13 17:53:19,443 INFO L482 AbstractCegarLoop]: Abstraction has has 33 places, 16 transitions, 126 flow [2021-08-13 17:53:19,443 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,443 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 17:53:19,443 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 17:53:19,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 17:53:19,443 INFO L430 AbstractCegarLoop]: === Iteration 4 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 17:53:19,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 17:53:19,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1530741366, now seen corresponding path program 3 times [2021-08-13 17:53:19,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 17:53:19,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529160605] [2021-08-13 17:53:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 17:53:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 17:53:19,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 17:53:19,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 17:53:19,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 17:53:19,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 17:53:19,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 17:53:19,488 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 17:53:19,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 17:53:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 17:53:19,497 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 17:53:19,497 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529160605] [2021-08-13 17:53:19,497 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529160605] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 17:53:19,497 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 17:53:19,497 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 17:53:19,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523458554] [2021-08-13 17:53:19,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 17:53:19,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 17:53:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 17:53:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 17:53:19,499 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 17:53:19,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 16 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 17:53:19,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 17:53:19,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 17:53:19,635 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-08-13 17:53:19,636 INFO L130 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2021-08-13 17:53:19,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 17 events. 0/17 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 27 event pairs, 0 based on Foata normal form. 4/21 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2021-08-13 17:53:19,636 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 0 selfloop transitions, 0 changer transitions 15/15 dead transitions. [2021-08-13 17:53:19,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 15 transitions, 146 flow [2021-08-13 17:53:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 17:53:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 17:53:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-08-13 17:53:19,637 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2021-08-13 17:53:19,637 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 42 transitions. [2021-08-13 17:53:19,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 42 transitions. [2021-08-13 17:53:19,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 17:53:19,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 42 transitions. [2021-08-13 17:53:19,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 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-08-13 17:53:19,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 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-08-13 17:53:19,638 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 13.0) internal successors, (143), 11 states have internal predecessors, (143), 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-08-13 17:53:19,638 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 27 predicate places. [2021-08-13 17:53:19,638 INFO L482 AbstractCegarLoop]: Abstraction has has 41 places, 15 transitions, 146 flow [2021-08-13 17:53:19,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 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-08-13 17:53:19,638 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 17:53:19,681 INFO L742 CegarLoopForPetriNet]: Computed Owicki-Gries annotation of size 1630 in 41115438ns [2021-08-13 17:53:19,682 INFO L113 kiGriesValidityCheck]: 9#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np8_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,686 INFO L113 kiGriesValidityCheck]: 7#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np6_1 (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np6_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,688 INFO L113 kiGriesValidityCheck]: 12#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2))) [2021-08-13 17:53:19,690 INFO L113 kiGriesValidityCheck]: 8#(and (not v_np3_1) (not v_np2_1) (not v_np9_1) (not v_np8_1) v_np7_1 (not v_np1_1) (not v_np6_1) (not v_np5_1)) [2021-08-13 17:53:19,694 INFO L113 kiGriesValidityCheck]: 10#(and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (not v_np2_1) v_np9_1 (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (<= ULTIMATE.start_x ULTIMATE.start_y) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (< ULTIMATE.start_y (+ ULTIMATE.start_x 1)) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) [2021-08-13 17:53:19,695 INFO L113 kiGriesValidityCheck]: 14#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np6_1 (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) v_np5_1 (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np5_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np8_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np6_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,695 INFO L113 kiGriesValidityCheck]: 6#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) v_np5_1 (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np5_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,696 INFO L113 kiGriesValidityCheck]: 11#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np6_1 (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (not v_np2_1) (<= 3 addThread1of1ForFork0_sum) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) v_np5_1 (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np8_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,699 INFO L113 kiGriesValidityCheck]: 2#(and v_np1_1 (not v_np3_1) (not v_np2_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (<= 1 ULTIMATE.start_x) (not v_np6_1) (not v_np5_1) (not v_np7_1)) [2021-08-13 17:53:19,701 INFO L113 kiGriesValidityCheck]: 3#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np5_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) v_np6_1 (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 17:53:19,703 INFO L113 kiGriesValidityCheck]: 13#(or (and (<= 2 ULTIMATE.start_y) v_np3_1 (not v_np2_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (<= 1 ULTIMATE.start_x) (not v_np6_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1)) (and v_np1_1 (not v_np3_1) (not v_np2_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (<= 1 ULTIMATE.start_x) (not v_np6_1) (not v_np5_1) (not v_np7_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (not v_np2_1) v_np9_1 (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) (not v_np3_1) (<= ULTIMATE.start_x ULTIMATE.start_y) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (< ULTIMATE.start_y (+ ULTIMATE.start_x 1)) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (not v_np3_1) (not v_np2_1) (not v_np9_1) (not v_np8_1) v_np7_1 (not v_np1_1) (not v_np6_1) (not v_np5_1))) [2021-08-13 17:53:19,703 INFO L113 kiGriesValidityCheck]: 4#(and (<= 2 ULTIMATE.start_y) v_np3_1 (not v_np2_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (<= 1 ULTIMATE.start_x) (not v_np6_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1)) [2021-08-13 17:53:19,706 INFO L113 kiGriesValidityCheck]: 12#(or (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x)) (and (<= addThread1of1ForFork0_num1 1) (<= 2 ULTIMATE.start_y) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (<= ULTIMATE.start_x 1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2))) [2021-08-13 17:53:19,744 INFO L748 CegarLoopForPetriNet]: Checked inductivity and non-interference of Owicki-Gries annotation in 64405342ns [2021-08-13 17:53:19,746 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 17:53:19,749 INFO L202 PluginConnector]: Adding new model fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 05:53:19 BasicIcfg [2021-08-13 17:53:19,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 17:53:19,750 INFO L168 Benchmark]: Toolchain (without parser) took 1420.80 ms. Allocated memory is still 182.5 MB. Free memory was 163.4 MB in the beginning and 130.5 MB in the end (delta: 32.9 MB). Peak memory consumption was 34.3 MB. Max. memory is 8.0 GB. [2021-08-13 17:53:19,750 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 182.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 17:53:19,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.00 ms. Allocated memory is still 182.5 MB. Free memory was 163.3 MB in the beginning and 161.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 17:53:19,751 INFO L168 Benchmark]: Boogie Preprocessor took 11.42 ms. Allocated memory is still 182.5 MB. Free memory was 161.8 MB in the beginning and 161.0 MB in the end (delta: 826.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 17:53:19,751 INFO L168 Benchmark]: RCFGBuilder took 187.18 ms. Allocated memory is still 182.5 MB. Free memory was 160.9 MB in the beginning and 152.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-08-13 17:53:19,751 INFO L168 Benchmark]: TraceAbstraction took 1198.06 ms. Allocated memory is still 182.5 MB. Free memory was 152.0 MB in the beginning and 131.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 8.0 GB. [2021-08-13 17:53:19,753 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.10 ms. Allocated memory is still 182.5 MB. Free memory is still 164.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 20.00 ms. Allocated memory is still 182.5 MB. Free memory was 163.3 MB in the beginning and 161.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 11.42 ms. Allocated memory is still 182.5 MB. Free memory was 161.8 MB in the beginning and 161.0 MB in the end (delta: 826.9 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 187.18 ms. Allocated memory is still 182.5 MB. Free memory was 160.9 MB in the beginning and 152.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 1198.06 ms. Allocated memory is still 182.5 MB. Free memory was 152.0 MB in the beginning and 131.0 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 20 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 1005.2ms, OverallIterations: 4, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 573.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 20.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22 SDtfs, 52 SDslu, 38 SDs, 0 SdLazy, 89 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 521.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=4, InterpolantAutomatonStates: 33, 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: 3.7ms SsaConstructionTime, 24.9ms SatisfiabilityAnalysisTime, 295.0ms InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...