/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-DelaySleepPersistent-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788 [2021-06-02 07:06:17,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-02 07:06:17,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-02 07:06:17,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-02 07:06:17,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-02 07:06:17,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-02 07:06:17,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-02 07:06:17,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-02 07:06:17,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-02 07:06:17,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-02 07:06:17,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-02 07:06:17,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-02 07:06:17,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-02 07:06:17,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-02 07:06:17,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-02 07:06:17,190 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-02 07:06:17,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-02 07:06:17,192 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-02 07:06:17,194 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-02 07:06:17,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-02 07:06:17,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-02 07:06:17,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-02 07:06:17,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-02 07:06:17,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-02 07:06:17,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-02 07:06:17,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-02 07:06:17,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-02 07:06:17,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-02 07:06:17,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-02 07:06:17,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-02 07:06:17,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-02 07:06:17,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-02 07:06:17,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-02 07:06:17,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-02 07:06:17,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-02 07:06:17,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-02 07:06:17,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-02 07:06:17,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-02 07:06:17,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-02 07:06:17,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-02 07:06:17,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-02 07:06:17,215 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-POR-DelaySleepPersistent-NoLbe.epf [2021-06-02 07:06:17,242 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-02 07:06:17,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-02 07:06:17,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-02 07:06:17,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-02 07:06:17,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-02 07:06:17,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-02 07:06:17,244 INFO L138 SettingsManager]: * Use SBE=true [2021-06-02 07:06:17,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-02 07:06:17,245 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-02 07:06:17,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-02 07:06:17,245 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-02 07:06:17,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-02 07:06:17,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-02 07:06:17,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-02 07:06:17,247 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-02 07:06:17,248 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-06-02 07:06:17,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-02 07:06:17,248 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_DELAY_SET [2021-06-02 07:06:17,248 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-06-02 07:06:17,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-02 07:06:17,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-02 07:06:17,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-02 07:06:17,536 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-06-02 07:06:17,536 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-06-02 07:06:17,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2021-06-02 07:06:17,537 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2021-06-02 07:06:17,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-02 07:06:17,569 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-06-02 07:06:17,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-02 07:06:17,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-02 07:06:17,572 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-02 07:06:17,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-02 07:06:17,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-02 07:06:17,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-02 07:06:17,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-02 07:06:17,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/1) ... [2021-06-02 07:06:17,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-02 07:06:17,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-02 07:06:17,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-02 07:06:17,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-02 07:06:17,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (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-06-02 07:06:17,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2021-06-02 07:06:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2021-06-02 07:06:17,673 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2021-06-02 07:06:17,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2021-06-02 07:06:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2021-06-02 07:06:17,673 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2021-06-02 07:06:17,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-06-02 07:06:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-02 07:06:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-02 07:06:17,675 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2021-06-02 07:06:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2021-06-02 07:06:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2021-06-02 07:06:17,675 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-02 07:06:17,807 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-02 07:06:17,807 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-06-02 07:06:17,808 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.06 07:06:17 BoogieIcfgContainer [2021-06-02 07:06:17,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-02 07:06:17,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-02 07:06:17,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-02 07:06:17,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-02 07:06:17,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 02.06 07:06:17" (1/2) ... [2021-06-02 07:06:17,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a6c812 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.06 07:06:17, skipping insertion in model container [2021-06-02 07:06:17,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.06 07:06:17" (2/2) ... [2021-06-02 07:06:17,812 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2021-06-02 07:06:17,816 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-02 07:06:17,816 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-02 07:06:17,816 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-02 07:06:17,817 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-02 07:06:17,848 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,848 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,849 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,849 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,850 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,850 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,850 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,850 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,851 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,851 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,852 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,856 WARN L313 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,857 WARN L313 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-02 07:06:17,858 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-02 07:06:17,871 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-02 07:06:17,963 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-02 07:06:17,963 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-02 07:06:17,963 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-02 07:06:17,963 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-02 07:06:17,963 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-02 07:06:17,963 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-02 07:06:17,963 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-02 07:06:17,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2Thread1of1ForFork2======== [2021-06-02 07:06:18,352 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash 329046714, now seen corresponding path program 1 times [2021-06-02 07:06:18,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,363 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984469442] [2021-06-02 07:06:18,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:18,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984469442] [2021-06-02 07:06:18,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984469442] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-02 07:06:18,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027069418] [2021-06-02 07:06:18,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-02 07:06:18,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-02 07:06:18,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-02 07:06:18,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,443 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,444 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-06-02 07:06:18,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,461 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-02 07:06:18,461 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 547017971, now seen corresponding path program 1 times [2021-06-02 07:06:18,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,462 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499186067] [2021-06-02 07:06:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:18,487 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,487 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499186067] [2021-06-02 07:06:18,487 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499186067] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,488 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,488 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:18,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469357678] [2021-06-02 07:06:18,489 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:18,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,489 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-06-02 07:06:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,506 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-02 07:06:18,506 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1611615266, now seen corresponding path program 1 times [2021-06-02 07:06:18,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,507 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707591772] [2021-06-02 07:06:18,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:18,523 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,523 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707591772] [2021-06-02 07:06:18,523 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707591772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-02 07:06:18,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899062751] [2021-06-02 07:06:18,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:18,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:18,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:18,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,525 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,525 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-06-02 07:06:18,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,525 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-02 07:06:18,763 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,764 INFO L82 PathProgramCache]: Analyzing trace with hash 967829351, now seen corresponding path program 1 times [2021-06-02 07:06:18,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,765 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046919395] [2021-06-02 07:06:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-06-02 07:06:18,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,796 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046919395] [2021-06-02 07:06:18,796 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046919395] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,796 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:18,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900036198] [2021-06-02 07:06:18,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:18,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,798 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-06-02 07:06:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,844 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-02 07:06:18,844 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,844 INFO L82 PathProgramCache]: Analyzing trace with hash 280005199, now seen corresponding path program 2 times [2021-06-02 07:06:18,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,845 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89286587] [2021-06-02 07:06:18,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,878 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-06-02 07:06:18,878 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,878 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89286587] [2021-06-02 07:06:18,879 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89286587] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,879 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,879 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:18,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779451656] [2021-06-02 07:06:18,879 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:18,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:18,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,880 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,880 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 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-06-02 07:06:18,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,880 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,950 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-02 07:06:18,950 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:18,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1329867627, now seen corresponding path program 1 times [2021-06-02 07:06:18,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:18,950 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138620800] [2021-06-02 07:06:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:18,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-06-02 07:06:18,977 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:18,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138620800] [2021-06-02 07:06:18,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138620800] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:18,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:18,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-02 07:06:18,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682274414] [2021-06-02 07:06:18,979 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-02 07:06:18,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:18,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-02 07:06:18,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-02 07:06:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,982 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:18,982 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:18,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:19,049 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-02 07:06:19,049 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:19,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1927539052, now seen corresponding path program 1 times [2021-06-02 07:06:19,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:19,050 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511538618] [2021-06-02 07:06:19,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:19,118 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-02 07:06:19,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:19,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511538618] [2021-06-02 07:06:19,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511538618] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:19,118 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:19,118 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:19,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282054094] [2021-06-02 07:06:19,119 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:19,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,119 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:19,119 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:19,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:19,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,170 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-02 07:06:19,170 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1732251584, now seen corresponding path program 1 times [2021-06-02 07:06:19,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:19,171 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27392054] [2021-06-02 07:06:19,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:19,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:19,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27392054] [2021-06-02 07:06:19,238 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27392054] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-02 07:06:19,238 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613698997] [2021-06-02 07:06:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-02 07:06:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:19,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-02 07:06:19,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-02 07:06:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:19,469 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613698997] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-02 07:06:19,469 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-02 07:06:19,469 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2021-06-02 07:06:19,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146811200] [2021-06-02 07:06:19,469 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-02 07:06:19,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-02 07:06:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-06-02 07:06:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,470 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:19,470 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:19,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:19,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:20,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-02 07:06:20,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-02 07:06:20,293 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -551730321, now seen corresponding path program 2 times [2021-06-02 07:06:20,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:20,294 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603014615] [2021-06-02 07:06:20,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-06-02 07:06:20,349 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:20,349 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603014615] [2021-06-02 07:06:20,349 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603014615] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:20,349 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:20,349 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-02 07:06:20,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852814236] [2021-06-02 07:06:20,349 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-02 07:06:20,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-02 07:06:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-02 07:06:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,350 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:20,350 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:20,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2021-06-02 07:06:20,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-02 07:06:20,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:20,437 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-02 07:06:20,437 INFO L430 AbstractCegarLoop]: === Iteration 10 === [Process2Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:20,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1089928070, now seen corresponding path program 3 times [2021-06-02 07:06:20,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:20,437 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286874682] [2021-06-02 07:06:20,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-02 07:06:20,448 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-02 07:06:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-02 07:06:20,459 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-02 07:06:20,495 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-02 07:06:20,496 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-02 07:06:20,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-02 07:06:20,500 INFO L301 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/5) [2021-06-02 07:06:20,501 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-02 07:06:20,507 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-02 07:06:20,507 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-02 07:06:20,507 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-02 07:06:20,507 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-02 07:06:20,507 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-02 07:06:20,507 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-02 07:06:20,507 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-02 07:06:20,507 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process2======== [2021-06-02 07:06:20,902 INFO L301 ceAbstractionStarter]: Result for error location Process2 was SAFE (2/5) [2021-06-02 07:06:20,902 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-02 07:06:20,912 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-02 07:06:20,912 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-02 07:06:20,912 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-02 07:06:20,912 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-02 07:06:20,912 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-02 07:06:20,912 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-02 07:06:20,912 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-02 07:06:20,912 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1======== [2021-06-02 07:06:21,231 INFO L301 ceAbstractionStarter]: Result for error location Process1 was SAFE (3/5) [2021-06-02 07:06:21,232 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-02 07:06:21,249 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-02 07:06:21,249 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-02 07:06:21,249 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-02 07:06:21,249 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-02 07:06:21,249 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-02 07:06:21,249 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-02 07:06:21,249 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-02 07:06:21,249 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-02 07:06:21,566 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (4/5) [2021-06-02 07:06:21,566 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-06-02 07:06:21,576 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-02 07:06:21,576 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-02 07:06:21,576 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-02 07:06:21,576 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-02 07:06:21,576 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-02 07:06:21,576 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-02 07:06:21,576 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-02 07:06:21,576 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == Process1Thread1of1ForFork1======== [2021-06-02 07:06:21,671 INFO L430 AbstractCegarLoop]: === Iteration 1 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1101738843, now seen corresponding path program 1 times [2021-06-02 07:06:21,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:21,671 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938415437] [2021-06-02 07:06:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:21,679 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:21,679 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938415437] [2021-06-02 07:06:21,680 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938415437] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:21,680 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:21,680 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:21,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543186594] [2021-06-02 07:06:21,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:21,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:21,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,680 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:21,680 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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-06-02 07:06:21,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,691 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-02 07:06:21,691 INFO L430 AbstractCegarLoop]: === Iteration 2 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:21,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2105906016, now seen corresponding path program 1 times [2021-06-02 07:06:21,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:21,691 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905262574] [2021-06-02 07:06:21,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:21,706 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:21,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905262574] [2021-06-02 07:06:21,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905262574] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:21,706 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:21,706 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-02 07:06:21,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194199403] [2021-06-02 07:06:21,707 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:21,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:21,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:21,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,707 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:21,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-06-02 07:06:21,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-02 07:06:21,853 INFO L430 AbstractCegarLoop]: === Iteration 3 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:21,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:21,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1788359478, now seen corresponding path program 1 times [2021-06-02 07:06:21,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:21,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425814755] [2021-06-02 07:06:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-02 07:06:21,867 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:21,867 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425814755] [2021-06-02 07:06:21,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425814755] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:21,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:21,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:21,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345191501] [2021-06-02 07:06:21,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:21,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:21,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:21,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,868 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:21,868 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-06-02 07:06:21,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,904 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-02 07:06:21,904 INFO L430 AbstractCegarLoop]: === Iteration 4 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1849738471, now seen corresponding path program 1 times [2021-06-02 07:06:21,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:21,905 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331838787] [2021-06-02 07:06:21,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:21,928 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-06-02 07:06:21,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:21,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331838787] [2021-06-02 07:06:21,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331838787] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:21,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:21,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:21,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339621511] [2021-06-02 07:06:21,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:21,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:21,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,929 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:21,929 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-06-02 07:06:21,929 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,930 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-02 07:06:21,955 INFO L430 AbstractCegarLoop]: === Iteration 5 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 466373927, now seen corresponding path program 1 times [2021-06-02 07:06:21,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:21,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953727812] [2021-06-02 07:06:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-06-02 07:06:21,978 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:21,978 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953727812] [2021-06-02 07:06:21,978 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953727812] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:21,978 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:21,978 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-02 07:06:21,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422157618] [2021-06-02 07:06:21,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-02 07:06:21,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:21,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-02 07:06:21,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-02 07:06:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:21,981 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:21,981 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-06-02 07:06:21,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:21,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,026 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-02 07:06:22,027 INFO L430 AbstractCegarLoop]: === Iteration 6 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:22,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:22,027 INFO L82 PathProgramCache]: Analyzing trace with hash -491596441, now seen corresponding path program 1 times [2021-06-02 07:06:22,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:22,027 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318263741] [2021-06-02 07:06:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-06-02 07:06:22,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:22,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318263741] [2021-06-02 07:06:22,040 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318263741] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:22,040 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:22,040 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-02 07:06:22,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756435899] [2021-06-02 07:06:22,041 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-02 07:06:22,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-02 07:06:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-02 07:06:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,041 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:22,041 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-06-02 07:06:22,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,042 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,100 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-02 07:06:22,100 INFO L430 AbstractCegarLoop]: === Iteration 7 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:22,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:22,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1378033544, now seen corresponding path program 2 times [2021-06-02 07:06:22,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:22,100 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412458906] [2021-06-02 07:06:22,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-06-02 07:06:22,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:22,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412458906] [2021-06-02 07:06:22,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412458906] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-02 07:06:22,110 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-02 07:06:22,110 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-02 07:06:22,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585103975] [2021-06-02 07:06:22,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-02 07:06:22,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:22,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-02 07:06:22,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-02 07:06:22,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,111 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:22,111 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-06-02 07:06:22,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,111 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,154 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-02 07:06:22,154 INFO L430 AbstractCegarLoop]: === Iteration 8 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:22,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1162447746, now seen corresponding path program 3 times [2021-06-02 07:06:22,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:22,154 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474499860] [2021-06-02 07:06:22,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-02 07:06:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-02 07:06:22,199 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-02 07:06:22,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474499860] [2021-06-02 07:06:22,199 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474499860] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-02 07:06:22,199 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78240622] [2021-06-02 07:06:22,199 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-02 07:06:22,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-02 07:06:22,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-02 07:06:22,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-02 07:06:22,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-02 07:06:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 31 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-06-02 07:06:22,350 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78240622] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-02 07:06:22,350 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-02 07:06:22,350 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2021-06-02 07:06:22,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440070703] [2021-06-02 07:06:22,351 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-02 07:06:22,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-02 07:06:22,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-02 07:06:22,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-06-02 07:06:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,351 INFO L482 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-06-02 07:06:22,351 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-06-02 07:06:22,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-06-02 07:06:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-02 07:06:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-02 07:06:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-02 07:06:23,052 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-06-02 07:06:23,053 INFO L430 AbstractCegarLoop]: === Iteration 9 === [Process1Err0ASSERT_VIOLATIONASSERT]=== [2021-06-02 07:06:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-02 07:06:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1324005419, now seen corresponding path program 4 times [2021-06-02 07:06:23,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-02 07:06:23,053 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527079892] [2021-06-02 07:06:23,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-02 07:06:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-02 07:06:23,060 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-02 07:06:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-02 07:06:23,067 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-02 07:06:23,071 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-02 07:06:23,071 INFO L655 BasicCegarLoop]: Counterexample might be feasible [2021-06-02 07:06:23,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-02 07:06:23,073 INFO L301 ceAbstractionStarter]: Result for error location Process1Thread1of1ForFork1 was UNSAFE (5/5) [2021-06-02 07:06:23,073 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-02 07:06:23,113 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.06 07:06:23 BasicIcfg [2021-06-02 07:06:23,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-02 07:06:23,113 INFO L168 Benchmark]: Toolchain (without parser) took 5543.82 ms. Allocated memory was 375.4 MB in the beginning and 723.5 MB in the end (delta: 348.1 MB). Free memory was 354.8 MB in the beginning and 555.4 MB in the end (delta: -200.6 MB). Peak memory consumption was 150.6 MB. Max. memory is 16.0 GB. [2021-06-02 07:06:23,113 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 375.4 MB. Free memory was 355.9 MB in the beginning and 355.8 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-02 07:06:23,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 375.4 MB. Free memory was 354.7 MB in the beginning and 353.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-02 07:06:23,113 INFO L168 Benchmark]: Boogie Preprocessor took 13.84 ms. Allocated memory is still 375.4 MB. Free memory was 353.2 MB in the beginning and 352.3 MB in the end (delta: 969.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-02 07:06:23,114 INFO L168 Benchmark]: RCFGBuilder took 197.69 ms. Allocated memory is still 375.4 MB. Free memory was 352.2 MB in the beginning and 339.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. [2021-06-02 07:06:23,114 INFO L168 Benchmark]: TraceAbstraction took 5303.84 ms. Allocated memory was 375.4 MB in the beginning and 723.5 MB in the end (delta: 348.1 MB). Free memory was 339.4 MB in the beginning and 555.4 MB in the end (delta: -216.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 16.0 GB. [2021-06-02 07:06:23,114 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.12 ms. Allocated memory is still 375.4 MB. Free memory was 355.9 MB in the beginning and 355.8 MB in the end (delta: 65.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 23.65 ms. Allocated memory is still 375.4 MB. Free memory was 354.7 MB in the beginning and 353.2 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.84 ms. Allocated memory is still 375.4 MB. Free memory was 353.2 MB in the beginning and 352.3 MB in the end (delta: 969.3 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 197.69 ms. Allocated memory is still 375.4 MB. Free memory was 352.2 MB in the beginning and 339.8 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 5303.84 ms. Allocated memory was 375.4 MB in the beginning and 723.5 MB in the end (delta: 348.1 MB). Free memory was 339.4 MB in the beginning and 555.4 MB in the end (delta: -216.1 MB). Peak memory consumption was 133.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 25378, positive: 20801, positive conditional: 20801, positive unconditional: 0, negative: 4577, negative conditional: 4577, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 22274, positive: 20801, positive conditional: 20801, positive unconditional: 0, negative: 1473, negative conditional: 1473, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 29115, positive: 27275, positive conditional: 0, positive unconditional: 27275, negative: 1840, negative conditional: 0, negative unconditional: 1840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2445, positive: 2339, positive conditional: 0, positive unconditional: 2339, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2445, positive: 2282, positive conditional: 0, positive unconditional: 2282, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29115, positive: 24936, positive conditional: 0, positive unconditional: 24936, negative: 1734, negative conditional: 0, negative unconditional: 1734, unknown: 2445, unknown conditional: 0, unknown unconditional: 2445] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082, SemanticConditionEliminator.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10811, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 10758, negative conditional: 1676, negative unconditional: 9082, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10811, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 10683, negative conditional: 1601, negative unconditional: 9082, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106, Eliminated conditions: 9082 ], Maximal queried relation: 9, Independence queries for same thread: 3104 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 575, Number of persistent set computation: 533, Number of trivial persistent sets: 148, Underlying independence relation: CachedIndependenceRelation.Independence Queries: [ total: 29115, positive: 27275, positive conditional: 0, positive unconditional: 27275, negative: 1840, negative conditional: 0, negative unconditional: 1840, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2445, positive: 2339, positive conditional: 0, positive unconditional: 2339, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2445, positive: 2282, positive conditional: 0, positive unconditional: 2282, negative: 163, negative conditional: 0, negative unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 250, positive: 69, positive conditional: 12, positive unconditional: 57, negative: 181, negative conditional: 75, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, positive: 83, positive conditional: 9, positive unconditional: 74, negative: 300, negative conditional: 81, negative unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29115, positive: 24936, positive conditional: 0, positive unconditional: 24936, negative: 1734, negative conditional: 0, negative unconditional: 1734, unknown: 2445, unknown conditional: 0, unknown unconditional: 2445] , Statistics on independence cache: Total cache size (in pairs): 2532, Positive cache size: 2351, Positive conditional cache size: 12, Positive unconditional cache size: 2339, Negative cache size: 181, Negative conditional cache size: 75, Negative unconditional cache size: 106 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1702, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 447, negative conditional: 447, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1363, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 ], Maximal queried relation: 0, Independence queries for same thread: 339 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 371, Number of persistent set computation: 883, Number of trivial persistent sets: 609, Underlying independence relation: CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 113, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1702, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 447, negative conditional: 447, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1363, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 ], Maximal queried relation: 0, Independence queries for same thread: 339 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 299, Number of persistent set computation: 883, Number of trivial persistent sets: 609, Underlying independence relation: CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 86, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1702, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 447, negative conditional: 447, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 1363, positive: 1255, positive conditional: 1255, positive unconditional: 0, negative: 108, negative conditional: 108, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 ], Maximal queried relation: 0, Independence queries for same thread: 339 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 293, Number of persistent set computation: 883, Number of trivial persistent sets: 609, Underlying independence relation: CachedIndependenceRelation.Independence Queries: [ total: 7815, positive: 7393, positive conditional: 0, positive unconditional: 7393, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2419, positive: 2313, positive conditional: 0, positive unconditional: 2313, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2419, positive: 2257, positive conditional: 0, positive unconditional: 2257, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 162, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7815, positive: 5080, positive conditional: 0, positive unconditional: 5080, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 2419, unknown conditional: 0, unknown unconditional: 2419] , Statistics on independence cache: Total cache size (in pairs): 2419, Positive cache size: 2313, Positive conditional cache size: 0, Positive unconditional cache size: 2313, Negative cache size: 106, Negative conditional cache size: 0, Negative unconditional cache size: 106 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18781, positive: 15368, positive conditional: 15368, positive unconditional: 0, negative: 3413, negative conditional: 3413, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: DistributingIndependenceRelation.Independence Queries: [ total: 16481, positive: 15368, positive conditional: 15368, positive unconditional: 0, negative: 1113, negative conditional: 1113, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DistributingIndependenceRelation.Statistics on underlying relations: [ CachedIndependenceRelation.Independence Queries: [ total: 23928, positive: 22440, positive conditional: 0, positive unconditional: 22440, negative: 1488, negative conditional: 0, negative unconditional: 1488, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2491, positive: 2385, positive conditional: 0, positive unconditional: 2385, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2491, positive: 2326, positive conditional: 0, positive unconditional: 2326, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23928, positive: 20055, positive conditional: 0, positive unconditional: 20055, negative: 1382, negative conditional: 0, negative unconditional: 1382, unknown: 2491, unknown conditional: 0, unknown unconditional: 2491] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594, SemanticConditionEliminator.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6784, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 6723, negative conditional: 1129, negative unconditional: 5594, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6784, positive: 44, positive conditional: 44, positive unconditional: 0, negative: 6636, negative conditional: 1042, negative unconditional: 5594, unknown: 104, unknown conditional: 104, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106, Eliminated conditions: 5594 ], Maximal queried relation: 8, Independence queries for same thread: 2300 - StatisticsResult: Persistent set benchmarks Persistent set computation time[ms]: 229, Number of persistent set computation: 628, Number of trivial persistent sets: 298, Underlying independence relation: CachedIndependenceRelation.Independence Queries: [ total: 23928, positive: 22440, positive conditional: 0, positive unconditional: 22440, negative: 1488, negative conditional: 0, negative unconditional: 1488, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2491, positive: 2385, positive conditional: 0, positive unconditional: 2385, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2491, positive: 2326, positive conditional: 0, positive unconditional: 2326, negative: 165, negative conditional: 0, negative unconditional: 165, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 269, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 193, negative conditional: 87, negative unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 192, positive: 34, positive conditional: 9, positive unconditional: 25, negative: 158, negative conditional: 96, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23928, positive: 20055, positive conditional: 0, positive unconditional: 20055, negative: 1382, negative conditional: 0, negative unconditional: 1382, unknown: 2491, unknown conditional: 0, unknown unconditional: 2491] , Statistics on independence cache: Total cache size (in pairs): 2595, Positive cache size: 2402, Positive conditional cache size: 17, Positive unconditional cache size: 2385, Negative cache size: 193, Negative conditional cache size: 87, Negative unconditional cache size: 106 - CounterExampleResult [Line: 87]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=0, critical=0, delay=1, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=0, critical=0, deadline=1, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, deadline=1, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=1, critical=2, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=1, critical=0, deadline=1, deadline=1, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=2, critical=1, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=3, critical=2, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=3, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=4, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=2, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=5, critical=1, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=5, critical=0, deadline=5, deadline=5, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=5, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=5, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=5, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=5, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L87] 3 assert critical == 0; VAL [clk=7, critical=1, deadline=6, deadline=7, delay=1, lock=1, wait=1] - CounterExampleResult [Line: 66]: assertion can be violated assertion can be violated We found a FailurePath: [L28] 0 critical := 0; VAL [critical=0] [L29] 0 clk := 0; VAL [clk=0, critical=0] [L30] 0 assume wait >= 1; VAL [clk=0, critical=0, wait=1] [L33] 0 assume wait >= delay; VAL [clk=0, critical=0, delay=1, wait=1] [L34] FORK 0 fork 0 Clock(); VAL [clk=0, critical=0, delay=1, wait=1] [L35] FORK 0 fork 1 Process1(); VAL [clk=0, critical=0, delay=1, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=0, critical=0, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=0, critical=0, deadline=1, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=0, critical=0, deadline=1, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=1, critical=1, deadline=1, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=1, critical=0, deadline=1, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=2, critical=2, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=2, critical=0, deadline=2, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=2, critical=0, deadline=3, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=2, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=3, critical=0, deadline=3, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=4, critical=2, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=4, deadline=3, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=4, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=5, deadline=3, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=3, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=6, critical=1, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=7, critical=2, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=7, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=1, wait=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2608.1ms, OverallIterations: 10, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.3ms, PartialOrderReductionTime: 1568.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 42, 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: 36.0ms SsaConstructionTime, 86.7ms SatisfiabilityAnalysisTime, 433.9ms InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 4 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 335/355 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: Process2 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 399.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 393.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred 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: Process1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 328.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 318.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred 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 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 333.6ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.6ms, PartialOrderReductionTime: 315.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred 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: Process1Thread1of1ForFork1 with 1 thread instances CFG has 7 procedures, 78 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1506.4ms, OverallIterations: 9, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 0.5ms, PartialOrderReductionTime: 953.3ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.9ms SsaConstructionTime, 34.1ms SatisfiabilityAnalysisTime, 225.8ms InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1054 SizeOfPredicates, 4 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 261/297 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...