/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-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 19:46:34,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 19:46:34,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 19:46:35,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 19:46:35,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 19:46:35,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 19:46:35,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 19:46:35,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 19:46:35,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 19:46:35,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 19:46:35,027 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 19:46:35,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 19:46:35,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 19:46:35,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 19:46:35,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 19:46:35,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 19:46:35,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 19:46:35,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 19:46:35,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 19:46:35,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 19:46:35,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 19:46:35,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 19:46:35,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 19:46:35,057 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 19:46:35,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 19:46:35,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 19:46:35,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 19:46:35,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 19:46:35,060 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 19:46:35,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 19:46:35,062 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 19:46:35,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 19:46:35,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 19:46:35,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 19:46:35,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 19:46:35,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 19:46:35,065 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 19:46:35,065 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 19:46:35,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 19:46:35,066 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 19:46:35,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 19:46:35,067 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-FA-NoLbe.epf [2021-07-13 19:46:35,081 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 19:46:35,081 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 19:46:35,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 19:46:35,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 19:46:35,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 19:46:35,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 19:46:35,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 19:46:35,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 19:46:35,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 19:46:35,084 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 19:46:35,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 19:46:35,085 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 19:46:35,086 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-07-13 19:46:35,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 19:46:35,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 19:46:35,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 19:46:35,294 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-07-13 19:46:35,295 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-07-13 19:46:35,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl [2021-07-13 19:46:35,296 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/barrier-loop.wvr.bpl' [2021-07-13 19:46:35,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 19:46:35,343 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-07-13 19:46:35,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 19:46:35,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 19:46:35,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 19:46:35,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 19:46:35,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 19:46:35,367 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 19:46:35,367 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 19:46:35,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/1) ... [2021-07-13 19:46:35,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 19:46:35,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 19:46:35,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 19:46:35,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 19:46:35,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (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-07-13 19:46:35,459 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-07-13 19:46:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-07-13 19:46:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-07-13 19:46:35,460 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-07-13 19:46:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-07-13 19:46:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-07-13 19:46:35,460 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-07-13 19:46:35,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 19:46:35,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 19:46:35,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-07-13 19:46:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-07-13 19:46:35,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-07-13 19:46:35,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2021-07-13 19:46:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-07-13 19:46:35,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-07-13 19:46:35,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2021-07-13 19:46:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2021-07-13 19:46:35,461 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2021-07-13 19:46:35,461 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2021-07-13 19:46:35,461 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2021-07-13 19:46:35,462 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2021-07-13 19:46:35,462 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 19:46:35,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 19:46:35,657 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-07-13 19:46:35,658 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:46:35 BoogieIcfgContainer [2021-07-13 19:46:35,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 19:46:35,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 19:46:35,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 19:46:35,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 19:46:35,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 13.07 07:46:35" (1/2) ... [2021-07-13 19:46:35,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f52d02d and model type barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 07:46:35, skipping insertion in model container [2021-07-13 19:46:35,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 07:46:35" (2/2) ... [2021-07-13 19:46:35,663 INFO L111 eAbstractionObserver]: Analyzing ICFG barrier-loop.wvr.bpl [2021-07-13 19:46:35,666 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 19:46:35,666 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 19:46:35,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-13 19:46:35,667 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 19:46:35,777 INFO L149 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2021-07-13 19:46:35,799 INFO L255 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-07-13 19:46:35,810 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:46:35,810 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:46:35,810 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:46:35,811 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:46:35,811 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:46:35,811 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:46:35,811 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:46:35,811 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == thread4Thread1of1ForFork3======== [2021-07-13 19:46:35,818 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-07-13 19:46:35,884 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1249 states, 1248 states have (on average 3.048076923076923) internal successors, (3804), 1248 states have internal predecessors, (3804), 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-07-13 19:46:35,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 1249 states, 1248 states have (on average 3.048076923076923) internal successors, (3804), 1248 states have internal predecessors, (3804), 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-07-13 19:46:35,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 19:46:35,906 INFO L301 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork3 was SAFE (1/3) [2021-07-13 19:46:35,908 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-13 19:46:35,916 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 19:46:35,917 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 19:46:35,917 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 19:46:35,917 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 19:46:35,917 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 19:46:35,917 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 19:46:35,917 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 19:46:35,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 19:46:35,921 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 73 transitions, 218 flow [2021-07-13 19:46:36,258 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 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-07-13 19:46:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 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-07-13 19:46:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-07-13 19:46:36,373 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:36,374 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:36,374 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1662194858, now seen corresponding path program 1 times [2021-07-13 19:46:36,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:36,383 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892893122] [2021-07-13 19:46:36,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:36,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:36,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892893122] [2021-07-13 19:46:36,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892893122] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:36,506 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:36,506 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-13 19:46:36,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401978506] [2021-07-13 19:46:36,509 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:36,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:36,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:36,542 INFO L87 Difference]: Start difference. First operand has 10820 states, 10819 states have (on average 4.095295313799797) internal successors, (44307), 10819 states have internal predecessors, (44307), 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) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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-07-13 19:46:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:36,739 INFO L93 Difference]: Finished difference Result 11214 states and 45854 transitions. [2021-07-13 19:46:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:36,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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) Word has length 23 [2021-07-13 19:46:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:36,845 INFO L225 Difference]: With dead ends: 11214 [2021-07-13 19:46:36,845 INFO L226 Difference]: Without dead ends: 11193 [2021-07-13 19:46:36,846 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:37,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2021-07-13 19:46:37,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 10962. [2021-07-13 19:46:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10962 states, 10961 states have (on average 4.090958854119149) internal successors, (44841), 10961 states have internal predecessors, (44841), 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-07-13 19:46:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 44841 transitions. [2021-07-13 19:46:37,550 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 44841 transitions. Word has length 23 [2021-07-13 19:46:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:37,550 INFO L482 AbstractCegarLoop]: Abstraction has 10962 states and 44841 transitions. [2021-07-13 19:46:37,551 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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-07-13 19:46:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 44841 transitions. [2021-07-13 19:46:37,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-07-13 19:46:37,583 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:37,584 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:37,584 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 19:46:37,584 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:37,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash -271254563, now seen corresponding path program 1 times [2021-07-13 19:46:37,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:37,591 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893965760] [2021-07-13 19:46:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:37,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:37,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893965760] [2021-07-13 19:46:37,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893965760] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:37,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:37,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:46:37,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192911600] [2021-07-13 19:46:37,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:37,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:37,630 INFO L87 Difference]: Start difference. First operand 10962 states and 44841 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:37,900 INFO L93 Difference]: Finished difference Result 13038 states and 52625 transitions. [2021-07-13 19:46:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2021-07-13 19:46:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:37,975 INFO L225 Difference]: With dead ends: 13038 [2021-07-13 19:46:37,975 INFO L226 Difference]: Without dead ends: 12721 [2021-07-13 19:46:37,976 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12721 states. [2021-07-13 19:46:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12721 to 11889. [2021-07-13 19:46:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11889 states, 11888 states have (on average 4.034909152086137) internal successors, (47967), 11888 states have internal predecessors, (47967), 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-07-13 19:46:38,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11889 states to 11889 states and 47967 transitions. [2021-07-13 19:46:38,571 INFO L78 Accepts]: Start accepts. Automaton has 11889 states and 47967 transitions. Word has length 31 [2021-07-13 19:46:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:38,571 INFO L482 AbstractCegarLoop]: Abstraction has 11889 states and 47967 transitions. [2021-07-13 19:46:38,571 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:38,571 INFO L276 IsEmpty]: Start isEmpty. Operand 11889 states and 47967 transitions. [2021-07-13 19:46:38,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-07-13 19:46:38,607 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:38,607 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:38,608 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 19:46:38,609 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:38,610 INFO L82 PathProgramCache]: Analyzing trace with hash -532176069, now seen corresponding path program 1 times [2021-07-13 19:46:38,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:38,610 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956059779] [2021-07-13 19:46:38,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:38,626 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:38,626 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956059779] [2021-07-13 19:46:38,626 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956059779] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:38,626 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:38,626 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:46:38,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864803717] [2021-07-13 19:46:38,627 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:38,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:38,627 INFO L87 Difference]: Start difference. First operand 11889 states and 47967 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:38,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:38,700 INFO L93 Difference]: Finished difference Result 11681 states and 45149 transitions. [2021-07-13 19:46:38,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:38,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2021-07-13 19:46:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:38,734 INFO L225 Difference]: With dead ends: 11681 [2021-07-13 19:46:38,734 INFO L226 Difference]: Without dead ends: 9378 [2021-07-13 19:46:38,735 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:39,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2021-07-13 19:46:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9378. [2021-07-13 19:46:39,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9378 states, 9377 states have (on average 3.84099392129679) internal successors, (36017), 9377 states have internal predecessors, (36017), 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-07-13 19:46:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9378 states to 9378 states and 36017 transitions. [2021-07-13 19:46:39,378 INFO L78 Accepts]: Start accepts. Automaton has 9378 states and 36017 transitions. Word has length 31 [2021-07-13 19:46:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:39,379 INFO L482 AbstractCegarLoop]: Abstraction has 9378 states and 36017 transitions. [2021-07-13 19:46:39,379 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 9378 states and 36017 transitions. [2021-07-13 19:46:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-07-13 19:46:39,400 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:39,400 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:39,400 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 19:46:39,400 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1106136239, now seen corresponding path program 1 times [2021-07-13 19:46:39,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:39,402 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520613095] [2021-07-13 19:46:39,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:39,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:39,441 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:39,441 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520613095] [2021-07-13 19:46:39,441 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520613095] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:39,441 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:39,442 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:46:39,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838314149] [2021-07-13 19:46:39,442 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:39,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:39,443 INFO L87 Difference]: Start difference. First operand 9378 states and 36017 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:39,575 INFO L93 Difference]: Finished difference Result 11158 states and 41887 transitions. [2021-07-13 19:46:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2021-07-13 19:46:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:39,606 INFO L225 Difference]: With dead ends: 11158 [2021-07-13 19:46:39,606 INFO L226 Difference]: Without dead ends: 10600 [2021-07-13 19:46:39,606 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10600 states. [2021-07-13 19:46:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10600 to 10244. [2021-07-13 19:46:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10244 states, 10243 states have (on average 3.7574929219955093) internal successors, (38488), 10243 states have internal predecessors, (38488), 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-07-13 19:46:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 38488 transitions. [2021-07-13 19:46:40,045 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 38488 transitions. Word has length 31 [2021-07-13 19:46:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:40,046 INFO L482 AbstractCegarLoop]: Abstraction has 10244 states and 38488 transitions. [2021-07-13 19:46:40,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 38488 transitions. [2021-07-13 19:46:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-07-13 19:46:40,063 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:40,063 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:40,063 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 19:46:40,063 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:40,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:40,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1819688453, now seen corresponding path program 1 times [2021-07-13 19:46:40,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:40,064 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350351796] [2021-07-13 19:46:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:40,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:40,093 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:40,093 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350351796] [2021-07-13 19:46:40,094 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350351796] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:40,094 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:40,094 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:46:40,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926778587] [2021-07-13 19:46:40,094 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:40,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:40,095 INFO L87 Difference]: Start difference. First operand 10244 states and 38488 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:40,139 INFO L93 Difference]: Finished difference Result 9700 states and 34735 transitions. [2021-07-13 19:46:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:40,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) Word has length 31 [2021-07-13 19:46:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:40,160 INFO L225 Difference]: With dead ends: 9700 [2021-07-13 19:46:40,160 INFO L226 Difference]: Without dead ends: 8001 [2021-07-13 19:46:40,161 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8001 states. [2021-07-13 19:46:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8001 to 8001. [2021-07-13 19:46:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8001 states, 8000 states have (on average 3.590375) internal successors, (28723), 8000 states have internal predecessors, (28723), 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-07-13 19:46:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8001 states to 8001 states and 28723 transitions. [2021-07-13 19:46:40,533 INFO L78 Accepts]: Start accepts. Automaton has 8001 states and 28723 transitions. Word has length 31 [2021-07-13 19:46:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:40,533 INFO L482 AbstractCegarLoop]: Abstraction has 8001 states and 28723 transitions. [2021-07-13 19:46:40,533 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-07-13 19:46:40,533 INFO L276 IsEmpty]: Start isEmpty. Operand 8001 states and 28723 transitions. [2021-07-13 19:46:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-13 19:46:40,549 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:40,549 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:40,549 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 19:46:40,549 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash 185522314, now seen corresponding path program 1 times [2021-07-13 19:46:40,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:40,550 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231099001] [2021-07-13 19:46:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 19:46:40,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 19:46:40,576 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 19:46:40,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231099001] [2021-07-13 19:46:40,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231099001] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 19:46:40,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 19:46:40,577 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 19:46:40,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462073563] [2021-07-13 19:46:40,577 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 19:46:40,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 19:46:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 19:46:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:40,577 INFO L87 Difference]: Start difference. First operand 8001 states and 28723 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-07-13 19:46:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 19:46:40,676 INFO L93 Difference]: Finished difference Result 6666 states and 23386 transitions. [2021-07-13 19:46:40,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 19:46:40,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) Word has length 39 [2021-07-13 19:46:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 19:46:40,693 INFO L225 Difference]: With dead ends: 6666 [2021-07-13 19:46:40,693 INFO L226 Difference]: Without dead ends: 6666 [2021-07-13 19:46:40,694 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 19:46:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2021-07-13 19:46:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6666. [2021-07-13 19:46:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6666 states, 6665 states have (on average 3.508777194298575) internal successors, (23386), 6665 states have internal predecessors, (23386), 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-07-13 19:46:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 23386 transitions. [2021-07-13 19:46:40,952 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 23386 transitions. Word has length 39 [2021-07-13 19:46:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 19:46:40,952 INFO L482 AbstractCegarLoop]: Abstraction has 6666 states and 23386 transitions. [2021-07-13 19:46:40,953 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-07-13 19:46:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 23386 transitions. [2021-07-13 19:46:40,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-13 19:46:40,967 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 19:46:40,967 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-13 19:46:40,967 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 19:46:40,968 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-07-13 19:46:40,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 19:46:40,968 INFO L82 PathProgramCache]: Analyzing trace with hash 257566338, now seen corresponding path program 2 times [2021-07-13 19:46:40,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 19:46:40,968 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642129701] [2021-07-13 19:46:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 19:46:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 19:46:40,990 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 19:46:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-13 19:46:40,996 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-13 19:46:41,088 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-13 19:46:41,103 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-13 19:46:41,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 19:46:41,103 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-07-13 19:46:41,104 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 19:46:41,140 INFO L202 PluginConnector]: Adding new model barrier-loop.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 07:46:41 BasicIcfg [2021-07-13 19:46:41,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 19:46:41,141 INFO L168 Benchmark]: Toolchain (without parser) took 5797.83 ms. Allocated memory was 211.8 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 191.9 MB in the beginning and 4.5 GB in the end (delta: -4.3 GB). Peak memory consumption was 570.8 MB. Max. memory is 8.0 GB. [2021-07-13 19:46:41,142 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 211.8 MB. Free memory is still 193.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 19:46:41,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.19 ms. Allocated memory is still 211.8 MB. Free memory was 191.8 MB in the beginning and 190.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 19:46:41,147 INFO L168 Benchmark]: Boogie Preprocessor took 15.86 ms. Allocated memory is still 211.8 MB. Free memory was 190.4 MB in the beginning and 189.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-07-13 19:46:41,147 INFO L168 Benchmark]: RCFGBuilder took 275.64 ms. Allocated memory is still 211.8 MB. Free memory was 189.2 MB in the beginning and 173.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-07-13 19:46:41,147 INFO L168 Benchmark]: TraceAbstraction took 5481.34 ms. Allocated memory was 211.8 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 173.4 MB in the beginning and 4.5 GB in the end (delta: -4.3 GB). Peak memory consumption was 551.9 MB. Max. memory is 8.0 GB. [2021-07-13 19:46:41,149 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 211.8 MB. Free memory is still 193.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 21.19 ms. Allocated memory is still 211.8 MB. Free memory was 191.8 MB in the beginning and 190.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 15.86 ms. Allocated memory is still 211.8 MB. Free memory was 190.4 MB in the beginning and 189.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 275.64 ms. Allocated memory is still 211.8 MB. Free memory was 189.2 MB in the beginning and 173.9 MB in the end (delta: 15.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5481.34 ms. Allocated memory was 211.8 MB in the beginning and 4.9 GB in the end (delta: 4.7 GB). Free memory was 173.4 MB in the beginning and 4.5 GB in the end (delta: -4.3 GB). Peak memory consumption was 551.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 121]: assertion can be violated assertion can be violated We found a FailurePath: [L115] 0 assume x_0 == x_8 && y_1 == y_9; VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L116] FORK 0 fork 1 thread1(); VAL [x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L60] 1 f1_2 := false; [L61] 1 f2_3 := false; VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L117] FORK 0 fork 4, 4, 4, 4 thread4(); VAL [f1_2=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L103] 2 f1_10 := false; [L104] 2 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L106] FORK 2 fork 5, 5, 5, 5, 5 thread5(); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L73] 3 temp_12 := x_8; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=-1, y_1=-1, y_9=-1] [L74] 3 x_8 := temp_12 + 1; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L75] 3 f1_10 := true; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L107] FORK 2 fork 6, 6, 6, 6, 6, 6 thread6(); VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L88] 4 temp_14 := y_9; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=-1] [L89] 4 y_9 := temp_14 + 1; VAL [f1_10=true, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L90] 4 f2_11 := true; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L76] 3 assume f2_11; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L77] 3 temp_13 := y_9; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=0] [L78] 3 y_9 := temp_13 + 1; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L91] 4 assume f1_10; VAL [f1_10=true, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L79] 3 f1_10 := false; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, x_0=-1, x_8=0, y_1=-1, y_9=1] [L92] 4 temp_15 := x_8; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L63] FORK 1 fork 2, 2 thread2(); VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L64] FORK 1 fork 3, 3, 3 thread3(); VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L65] JOIN 5 join 2, 2; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L66] JOIN 6 join 3, 3, 3; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L118] JOIN 1 join 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=0, y_1=-1, y_9=1] [L93] 4 x_8 := temp_15 + 1; VAL [f1_10=false, f1_2=false, f2_11=true, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L94] 4 f2_11 := false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L95] 4 assume !f1_10; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L80] 3 assume !f2_11; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L108] JOIN 3 join 5, 5, 5, 5, 5; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L109] JOIN 4 join 6, 6, 6, 6, 6, 6; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L119] JOIN 2 join 4, 4, 4, 4; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L120] 0 assume !(x_0 == x_8 && y_1 == y_9); VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] [L121] 0 assert false; VAL [f1_10=false, f1_2=false, f2_11=false, f2_3=false, temp_12=-1, temp_13=0, temp_14=-1, temp_15=0, x_0=-1, x_8=1, y_1=-1, y_9=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork3 with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 97.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 21.4ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 73.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1249occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 120 locations, 11 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5186.8ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 249.8ms, AutomataDifference: 1138.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 341.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 515 SDtfs, 206 SDslu, 251 SDs, 0 SdLazy, 37 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11889occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3000.8ms AutomataMinimizationTime, 6 MinimizatonAttempts, 1419 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 19.4ms SsaConstructionTime, 86.8ms SatisfiabilityAnalysisTime, 133.6ms InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...