/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.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 02:38:43,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 02:38:43,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 02:38:43,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 02:38:43,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 02:38:43,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 02:38:43,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 02:38:43,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 02:38:43,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 02:38:43,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 02:38:43,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 02:38:43,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 02:38:43,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 02:38:43,525 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 02:38:43,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 02:38:43,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 02:38:43,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 02:38:43,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 02:38:43,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 02:38:43,531 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 02:38:43,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 02:38:43,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 02:38:43,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 02:38:43,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 02:38:43,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 02:38:43,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 02:38:43,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 02:38:43,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 02:38:43,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 02:38:43,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 02:38:43,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 02:38:43,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 02:38:43,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 02:38:43,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 02:38:43,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 02:38:43,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 02:38:43,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 02:38:43,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 02:38:43,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 02:38:43,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 02:38:43,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 02:38:43,545 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.epf [2021-08-13 02:38:43,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 02:38:43,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 02:38:43,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 02:38:43,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 02:38:43,571 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 02:38:43,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 02:38:43,571 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 02:38:43,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 02:38:43,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 02:38:43,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 02:38:43,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 02:38:43,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 02:38:43,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 02:38:43,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 02:38:43,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 02:38:43,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 02:38:43,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 02:38:43,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 02:38:43,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 02:38:43,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 02:38:43,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 02:38:43,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 02:38:43,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 02:38:43,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 02:38:43,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 02:38:43,576 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 02:38:43,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-13 02:38:43,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 02:38:43,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 02:38:43,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 02:38:43,905 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-08-13 02:38:43,906 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-08-13 02:38:43,906 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 02:38:43,907 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/fork_multiple_parameter.bpl' [2021-08-13 02:38:44,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 02:38:44,069 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-08-13 02:38:44,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 02:38:44,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 02:38:44,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 02:38:44,078 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,084 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 02:38:44,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 02:38:44,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 02:38:44,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 02:38:44,097 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,097 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,097 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,098 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,099 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,100 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,100 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 02:38:44" (1/1) ... [2021-08-13 02:38:44,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 02:38:44,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 02:38:44,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 02:38:44,102 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 02:38:44,103 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 02:38:44" (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 02:38:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure add [2021-08-13 02:38:44,170 INFO L138 BoogieDeclarations]: Found implementation of procedure add [2021-08-13 02:38:44,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 02:38:44,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 02:38:44,171 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 02:38:44,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 02:38:44,276 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-08-13 02:38:44,278 INFO L202 PluginConnector]: Adding new model fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 02:38:44 BoogieIcfgContainer [2021-08-13 02:38:44,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 02:38:44,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 02:38:44,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 02:38:44,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 02:38:44,284 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 02:38:44" (1/2) ... [2021-08-13 02:38:44,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8ea58b and model type fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 02:38:44, skipping insertion in model container [2021-08-13 02:38:44,287 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 02:38:44" (2/2) ... [2021-08-13 02:38:44,289 INFO L111 eAbstractionObserver]: Analyzing ICFG fork_multiple_parameter.bpl [2021-08-13 02:38:44,297 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 02:38:44,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 02:38:44,298 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 02:38:44,325 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,325 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,326 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,327 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,329 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,329 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,330 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,331 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,331 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_num2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,331 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,335 WARN L313 ript$VariableManager]: TermVariabe addThread1of1ForFork0_sum not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 02:38:44,345 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-08-13 02:38:44,365 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-13 02:38:44,392 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 02:38:44,393 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 02:38:44,393 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 02:38:44,393 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 02:38:44,393 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 02:38:44,393 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 02:38:44,393 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 02:38:44,394 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 02:38:44,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 17 places, 13 transitions, 34 flow [2021-08-13 02:38:44,425 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-08-13 02:38:44,425 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-08-13 02:38:44,426 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 02:38:44,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 17 places, 13 transitions, 34 flow [2021-08-13 02:38:44,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 10 transitions, 26 flow [2021-08-13 02:38:44,435 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-08-13 02:38:44,435 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 02:38:44,435 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 02:38:44,436 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2021-08-13 02:38:44,436 INFO L430 AbstractCegarLoop]: === Iteration 1 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 02:38:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 02:38:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1444345, now seen corresponding path program 1 times [2021-08-13 02:38:44,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 02:38:44,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521844944] [2021-08-13 02:38:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 02:38:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 02:38:44,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,615 INFO L142 QuantifierPusher]: treesize reduction 9, result has 43.8 percent of original size [2021-08-13 02:38:44,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,643 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 02:38:44,643 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 02:38:44,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521844944] [2021-08-13 02:38:44,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521844944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 02:38:44,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 02:38:44,644 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 02:38:44,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495326253] [2021-08-13 02:38:44,651 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-08-13 02:38:44,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 02:38:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-13 02:38:44,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-13 02:38:44,684 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 13 [2021-08-13 02:38:44,686 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 02:38:44,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 02:38:44,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 13 [2021-08-13 02:38:44,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 02:38:44,760 INFO L129 PetriNetUnfolder]: 2/13 cut-off events. [2021-08-13 02:38:44,773 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-08-13 02:38:44,774 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 02:38:44,775 INFO L132 encePairwiseOnDemand]: 9/13 looper letters, 5 selfloop transitions, 3 changer transitions 0/11 dead transitions. [2021-08-13 02:38:44,776 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 44 flow [2021-08-13 02:38:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-13 02:38:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-08-13 02:38:44,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-08-13 02:38:44,789 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2021-08-13 02:38:44,790 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 35 transitions. [2021-08-13 02:38:44,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 35 transitions. [2021-08-13 02:38:44,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 02:38:44,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 35 transitions. [2021-08-13 02:38:44,794 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 02:38:44,797 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 02:38:44,797 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 02:38:44,798 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 3 predicate places. [2021-08-13 02:38:44,798 INFO L482 AbstractCegarLoop]: Abstraction has has 17 places, 11 transitions, 44 flow [2021-08-13 02:38:44,798 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 02:38:44,798 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 02:38:44,798 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 02:38:44,799 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 02:38:44,799 INFO L430 AbstractCegarLoop]: === Iteration 2 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 02:38:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 02:38:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1520910336, now seen corresponding path program 1 times [2021-08-13 02:38:44,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 02:38:44,800 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327778101] [2021-08-13 02:38:44,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 02:38:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 02:38:44,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 02:38:44,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 02:38:44,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:44,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:44,908 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 02:38:44,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 02:38:44,924 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 02:38:44,924 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 02:38:44,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327778101] [2021-08-13 02:38:44,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327778101] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 02:38:44,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 02:38:44,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 02:38:44,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019629830] [2021-08-13 02:38:44,926 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 02:38:44,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 02:38:44,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 02:38:44,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 02:38:44,928 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 02:38:44,928 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 02:38:44,928 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 02:38:44,928 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 02:38:44,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 02:38:45,121 INFO L129 PetriNetUnfolder]: 1/15 cut-off events. [2021-08-13 02:38:45,121 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-08-13 02:38:45,121 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 02:38:45,121 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 4 selfloop transitions, 6 changer transitions 3/14 dead transitions. [2021-08-13 02:38:45,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 14 transitions, 83 flow [2021-08-13 02:38:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 02:38:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 02:38:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2021-08-13 02:38:45,124 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2021-08-13 02:38:45,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 39 transitions. [2021-08-13 02:38:45,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 39 transitions. [2021-08-13 02:38:45,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 02:38:45,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 39 transitions. [2021-08-13 02:38:45,125 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 02:38:45,126 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 02:38:45,126 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 02:38:45,126 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 11 predicate places. [2021-08-13 02:38:45,126 INFO L482 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 83 flow [2021-08-13 02:38:45,126 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 02:38:45,127 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 02:38:45,127 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 02:38:45,127 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 02:38:45,127 INFO L430 AbstractCegarLoop]: === Iteration 3 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 02:38:45,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 02:38:45,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1807797666, now seen corresponding path program 2 times [2021-08-13 02:38:45,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 02:38:45,128 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645995914] [2021-08-13 02:38:45,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 02:38:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 02:38:45,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 02:38:45,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 02:38:45,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 02:38:45,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,201 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 02:38:45,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 02:38:45,221 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 02:38:45,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 02:38:45,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645995914] [2021-08-13 02:38:45,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645995914] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 02:38:45,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 02:38:45,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 02:38:45,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252603419] [2021-08-13 02:38:45,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 02:38:45,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 02:38:45,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 02:38:45,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 02:38:45,225 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 02:38:45,225 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 02:38:45,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 02:38:45,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 02:38:45,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 02:38:45,395 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-08-13 02:38:45,395 INFO L130 PetriNetUnfolder]: For 20/23 co-relation queries the response was YES. [2021-08-13 02:38:45,396 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 02:38:45,396 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 4 selfloop transitions, 4 changer transitions 7/16 dead transitions. [2021-08-13 02:38:45,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 126 flow [2021-08-13 02:38:45,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 02:38:45,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 02:38:45,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 40 transitions. [2021-08-13 02:38:45,399 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3418803418803419 [2021-08-13 02:38:45,399 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 40 transitions. [2021-08-13 02:38:45,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 40 transitions. [2021-08-13 02:38:45,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 02:38:45,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 40 transitions. [2021-08-13 02:38:45,401 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 02:38:45,404 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 02:38:45,404 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 02:38:45,404 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 19 predicate places. [2021-08-13 02:38:45,404 INFO L482 AbstractCegarLoop]: Abstraction has has 33 places, 16 transitions, 126 flow [2021-08-13 02:38:45,404 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 02:38:45,405 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 02:38:45,405 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 02:38:45,405 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 02:38:45,405 INFO L430 AbstractCegarLoop]: === Iteration 4 === [addErr0ASSERT_VIOLATIONASSERT, addErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-08-13 02:38:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 02:38:45,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1530741366, now seen corresponding path program 3 times [2021-08-13 02:38:45,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 02:38:45,407 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434793522] [2021-08-13 02:38:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 02:38:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 02:38:45,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 02:38:45,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 02:38:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 02:38:45,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 02:38:45,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 02:38:45,508 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 02:38:45,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 02:38:45,525 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 02:38:45,525 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 02:38:45,525 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434793522] [2021-08-13 02:38:45,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434793522] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 02:38:45,526 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 02:38:45,526 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 02:38:45,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522741542] [2021-08-13 02:38:45,526 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 02:38:45,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 02:38:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 02:38:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-13 02:38:45,528 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 13 [2021-08-13 02:38:45,528 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 02:38:45,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 02:38:45,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 13 [2021-08-13 02:38:45,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 02:38:45,667 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-08-13 02:38:45,667 INFO L130 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2021-08-13 02:38:45,667 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 02:38:45,668 INFO L132 encePairwiseOnDemand]: 6/13 looper letters, 0 selfloop transitions, 0 changer transitions 15/15 dead transitions. [2021-08-13 02:38:45,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 15 transitions, 146 flow [2021-08-13 02:38:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 02:38:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 02:38:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2021-08-13 02:38:45,669 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.3230769230769231 [2021-08-13 02:38:45,669 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 42 transitions. [2021-08-13 02:38:45,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 42 transitions. [2021-08-13 02:38:45,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 02:38:45,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 42 transitions. [2021-08-13 02:38:45,670 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 02:38:45,671 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 02:38:45,671 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 02:38:45,671 INFO L348 CegarLoopForPetriNet]: 14 programPoint places, 27 predicate places. [2021-08-13 02:38:45,671 INFO L482 AbstractCegarLoop]: Abstraction has has 41 places, 15 transitions, 146 flow [2021-08-13 02:38:45,671 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 02:38:45,671 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 02:38:45,739 INFO L742 CegarLoopForPetriNet]: Computed Owicki-Gries annotation of size 1991 in 65261028ns [2021-08-13 02:38:45,740 INFO L113 kiGriesValidityCheck]: 9#(or (and (<= addThread1of1ForFork0_num1 1) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np0_1) v_np8_1 (<= 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) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np0_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np12_1) (not v_np4_1) (not v_np10_1))) [2021-08-13 02:38:45,747 INFO L113 kiGriesValidityCheck]: 7#(or (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 02:38:45,751 INFO L113 kiGriesValidityCheck]: 12#(or (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) (not v_np0_1) (<= ULTIMATE.start_x 1) v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1)) (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_np0_1) v_np10_1 v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1))) [2021-08-13 02:38:45,754 INFO L113 kiGriesValidityCheck]: 8#(and (not v_np2_1) (not v_np5_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) v_np7_1 (not v_np0_1) (not v_np11_1) (not v_np1_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) [2021-08-13 02:38:45,755 INFO L113 kiGriesValidityCheck]: 10#(and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) v_np9_1 (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np12_1 (< 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) (not v_np13_1) (not v_np4_1) (not v_np10_1) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (<= ULTIMATE.start_x ULTIMATE.start_y) (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) [2021-08-13 02:38:45,757 INFO L113 kiGriesValidityCheck]: 14#(or (and (<= addThread1of1ForFork0_num1 1) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np0_1) v_np8_1 (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 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) (not v_np0_1) (<= ULTIMATE.start_x 1) v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 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) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np0_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np12_1) (not v_np4_1) (not v_np10_1)) (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_np0_1) v_np10_1 v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 02:38:45,757 INFO L113 kiGriesValidityCheck]: 6#(or (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 02:38:45,758 INFO L113 kiGriesValidityCheck]: 11#(or (and (<= addThread1of1ForFork0_num1 1) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np0_1) v_np8_1 (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (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_np0_1) v_np10_1 v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1))) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) v_np10_1 (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= addThread1of1ForFork0_sum ULTIMATE.start_x) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1) (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 02:38:45,769 INFO L113 kiGriesValidityCheck]: 2#(and (not v_np2_1) (<= 1 ULTIMATE.start_x) (not v_np5_1) (not v_np7_1) v_np1_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np0_1) (<= ULTIMATE.start_x 1) (not v_np11_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) [2021-08-13 02:38:45,772 INFO L113 kiGriesValidityCheck]: 3#(or (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np5_1) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np6_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 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) (not v_np0_1) (<= ULTIMATE.start_x 1) v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) (<= 1 ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1) (<= 2 ULTIMATE.start_y) (<= ULTIMATE.start_y 2) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) v_np2_1 v_np5_1 (not v_np0_1) (<= ULTIMATE.start_x 1) (<= 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) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (not v_np7_1) v_np2_1 (not v_np3_1) (not v_np9_1) (not v_np0_1) v_np8_1 (<= ULTIMATE.start_x 1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (not v_np12_1) (not v_np4_1) (not v_np10_1))) [2021-08-13 02:38:45,775 INFO L113 kiGriesValidityCheck]: 13#(or (and (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np3_1 (not v_np9_1) (not v_np8_1) (not v_np0_1) (<= ULTIMATE.start_x 1) (not v_np11_1) (not v_np1_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) (and (not v_np2_1) (not v_np5_1) (not v_np3_1) (not v_np9_1) (not v_np8_1) v_np7_1 (not v_np0_1) (not v_np11_1) (not v_np1_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) (and (not v_np2_1) (<= 1 ULTIMATE.start_x) (not v_np5_1) (not v_np7_1) v_np1_1 (not v_np3_1) (not v_np9_1) (not v_np8_1) (not v_np0_1) (<= ULTIMATE.start_x 1) (not v_np11_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) (and (<= addThread1of1ForFork0_num1 1) (<= addThread1of1ForFork0_sum 3) (<= 3 addThread1of1ForFork0_sum) v_np9_1 (not v_np5_1) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) ULTIMATE.start_x) (not v_np7_1) (not v_np3_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 1)) (not v_np8_1) (not v_np11_1) (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np12_1 (< 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) (not v_np13_1) (not v_np4_1) (not v_np10_1) (not v_np2_1) (<= ULTIMATE.start_x (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)) (<= (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1) 3) (<= ULTIMATE.start_x ULTIMATE.start_y) (not v_np0_1) (<= ULTIMATE.start_x addThread1of1ForFork0_sum) (<= 3 (+ addThread1of1ForFork0_num2 addThread1of1ForFork0_num1)))) [2021-08-13 02:38:45,776 INFO L113 kiGriesValidityCheck]: 4#(and (<= 2 ULTIMATE.start_y) (not v_np2_1) (<= 1 ULTIMATE.start_x) (not v_np5_1) (<= ULTIMATE.start_y 2) (not v_np7_1) v_np3_1 (not v_np9_1) (not v_np8_1) (not v_np0_1) (<= ULTIMATE.start_x 1) (not v_np11_1) (not v_np1_1) v_np12_1 (not v_np6_1) (not v_np13_1) (not v_np4_1) (not v_np10_1)) [2021-08-13 02:38:45,779 INFO L113 kiGriesValidityCheck]: 12#(or (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) (not v_np0_1) (<= ULTIMATE.start_x 1) v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (not v_np12_1) (not v_np4_1) (not v_np10_1)) (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_np0_1) v_np10_1 v_np11_1 (not v_np1_1) (< 0 addThread1of1ForFork0_num1) v_np13_1 (not v_np6_1) (<= 2 addThread1of1ForFork0_num2) (<= addThread1of1ForFork0_num2 2) (<= (+ addThread1of1ForFork0_num2 1) ULTIMATE.start_x) (not v_np12_1) (not v_np4_1))) [2021-08-13 02:38:45,841 INFO L748 CegarLoopForPetriNet]: Checked inductivity and non-interference of Owicki-Gries annotation in 103669272ns [2021-08-13 02:38:45,844 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 02:38:45,847 INFO L202 PluginConnector]: Adding new model fork_multiple_parameter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 02:38:45 BasicIcfg [2021-08-13 02:38:45,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 02:38:45,848 INFO L168 Benchmark]: Toolchain (without parser) took 1779.01 ms. Allocated memory is still 190.8 MB. Free memory was 171.9 MB in the beginning and 136.0 MB in the end (delta: 36.0 MB). Peak memory consumption was 36.4 MB. Max. memory is 8.0 GB. [2021-08-13 02:38:45,849 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 190.8 MB. Free memory is still 172.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 02:38:45,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.90 ms. Allocated memory is still 190.8 MB. Free memory was 171.9 MB in the beginning and 170.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 02:38:45,853 INFO L168 Benchmark]: Boogie Preprocessor took 11.03 ms. Allocated memory is still 190.8 MB. Free memory was 170.5 MB in the beginning and 169.5 MB in the end (delta: 931.0 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 02:38:45,854 INFO L168 Benchmark]: RCFGBuilder took 176.86 ms. Allocated memory is still 190.8 MB. Free memory was 169.5 MB in the beginning and 161.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2021-08-13 02:38:45,854 INFO L168 Benchmark]: TraceAbstraction took 1566.17 ms. Allocated memory is still 190.8 MB. Free memory was 160.4 MB in the beginning and 136.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.9 MB. Max. memory is 8.0 GB. [2021-08-13 02:38:45,860 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.16 ms. Allocated memory is still 190.8 MB. Free memory is still 172.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 19.90 ms. Allocated memory is still 190.8 MB. Free memory was 171.9 MB in the beginning and 170.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 11.03 ms. Allocated memory is still 190.8 MB. Free memory was 170.5 MB in the beginning and 169.5 MB in the end (delta: 931.0 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 176.86 ms. Allocated memory is still 190.8 MB. Free memory was 169.5 MB in the beginning and 161.0 MB in the end (delta: 8.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 1566.17 ms. Allocated memory is still 190.8 MB. Free memory was 160.4 MB in the beginning and 136.0 MB in the end (delta: 24.4 MB). Peak memory consumption was 24.9 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: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 1283.0ms, OverallIterations: 4, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 641.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 36.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22 SDtfs, 52 SDslu, 38 SDs, 0 SdLazy, 89 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 96.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 612.0ms 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: 7.9ms SsaConstructionTime, 35.8ms SatisfiabilityAnalysisTime, 420.3ms 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...