/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-820ea7a [2022-02-19 03:27:17,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-19 03:27:17,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-19 03:27:17,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-19 03:27:17,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-19 03:27:17,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-19 03:27:17,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-19 03:27:17,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-19 03:27:17,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-19 03:27:17,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-19 03:27:17,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-19 03:27:17,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-19 03:27:17,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-19 03:27:17,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-19 03:27:17,147 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-19 03:27:17,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-19 03:27:17,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-19 03:27:17,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-19 03:27:17,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-19 03:27:17,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-19 03:27:17,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-19 03:27:17,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-19 03:27:17,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-19 03:27:17,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-19 03:27:17,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-19 03:27:17,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-19 03:27:17,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-19 03:27:17,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-19 03:27:17,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-19 03:27:17,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-19 03:27:17,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-19 03:27:17,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-19 03:27:17,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-19 03:27:17,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-19 03:27:17,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-19 03:27:17,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-19 03:27:17,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-19 03:27:17,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-19 03:27:17,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-19 03:27:17,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-19 03:27:17,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-19 03:27:17,170 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-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2022-02-19 03:27:17,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-19 03:27:17,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-19 03:27:17,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-19 03:27:17,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-19 03:27:17,193 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-19 03:27:17,193 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-19 03:27:17,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-19 03:27:17,194 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-19 03:27:17,194 INFO L138 SettingsManager]: * Use SBE=true [2022-02-19 03:27:17,194 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-19 03:27:17,194 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-19 03:27:17,195 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-19 03:27:17,195 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-19 03:27:17,195 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-19 03:27:17,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-19 03:27:17,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-19 03:27:17,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-19 03:27:17,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-19 03:27:17,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-19 03:27:17,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 03:27:17,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-19 03:27:17,203 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-19 03:27:17,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-19 03:27:17,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-19 03:27:17,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-19 03:27:17,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-19 03:27:17,204 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-19 03:27:17,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-19 03:27:17,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-19 03:27:17,204 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-19 03:27:17,205 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-19 03:27:17,205 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 [2022-02-19 03:27:17,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-19 03:27:17,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-19 03:27:17,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-19 03:27:17,417 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-19 03:27:17,419 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-19 03:27:17,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl [2022-02-19 03:27:17,421 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2022-02-19 03:27:17,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-19 03:27:17,440 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-19 03:27:17,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-19 03:27:17,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-19 03:27:17,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-19 03:27:17,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,467 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-19 03:27:17,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-19 03:27:17,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-19 03:27:17,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-19 03:27:17,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-19 03:27:17,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-19 03:27:17,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-19 03:27:17,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-19 03:27:17,486 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-19 03:27:17,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/1) ... [2022-02-19 03:27:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-19 03:27:17,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:27:17,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-19 03:27:17,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-19 03:27:17,559 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2022-02-19 03:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2022-02-19 03:27:17,560 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2022-02-19 03:27:17,560 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2022-02-19 03:27:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2022-02-19 03:27:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2022-02-19 03:27:17,561 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-19 03:27:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-19 03:27:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-19 03:27:17,562 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2022-02-19 03:27:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2022-02-19 03:27:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2022-02-19 03:27:17,564 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-19 03:27:17,605 INFO L234 CfgBuilder]: Building ICFG [2022-02-19 03:27:17,606 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-19 03:27:17,688 INFO L275 CfgBuilder]: Performing block encoding [2022-02-19 03:27:17,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-19 03:27:17,695 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-19 03:27:17,697 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:27:17 BoogieIcfgContainer [2022-02-19 03:27:17,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-19 03:27:17,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-19 03:27:17,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-19 03:27:17,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-19 03:27:17,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.02 03:27:17" (1/2) ... [2022-02-19 03:27:17,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ea6979 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 03:27:17, skipping insertion in model container [2022-02-19 03:27:17,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 03:27:17" (2/2) ... [2022-02-19 03:27:17,723 INFO L111 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2022-02-19 03:27:17,728 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-19 03:27:17,728 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-19 03:27:17,728 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-19 03:27:17,728 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-19 03:27:17,771 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,772 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,773 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,773 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,773 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,774 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,774 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,774 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,775 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,776 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,777 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,777 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,777 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,778 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,778 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,778 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,788 WARN L322 ript$VariableManager]: TermVariabe Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,795 WARN L322 ript$VariableManager]: TermVariabe Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-19 03:27:17,796 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-19 03:27:17,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-19 03:27:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:27:17,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-19 03:27:17,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-19 03:27:17,951 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == Process2Thread1of1ForFork2 ======== [2022-02-19 03:27:17,958 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=true, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-02-19 03:27:17,958 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-19 03:27:18,118 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:18,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:18,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1011251863, now seen corresponding path program 1 times [2022-02-19 03:27:18,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:18,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779396366] [2022-02-19 03:27:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:27:18,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:18,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779396366] [2022-02-19 03:27:18,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779396366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:18,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:18,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 03:27:18,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155609943] [2022-02-19 03:27:18,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:18,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-19 03:27:18,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-19 03:27:18,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-19 03:27:18,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,271 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:18,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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) [2022-02-19 03:27:18,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-19 03:27:18,423 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 998796616, now seen corresponding path program 1 times [2022-02-19 03:27:18,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:18,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918033605] [2022-02-19 03:27:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-19 03:27:18,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:18,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918033605] [2022-02-19 03:27:18,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918033605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:18,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:18,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-19 03:27:18,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715059445] [2022-02-19 03:27:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:18,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:18,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,464 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:18,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 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) [2022-02-19 03:27:18,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:18,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-19 03:27:18,731 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:18,734 INFO L85 PathProgramCache]: Analyzing trace with hash 418388995, now seen corresponding path program 1 times [2022-02-19 03:27:18,734 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:18,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546002411] [2022-02-19 03:27:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-02-19 03:27:18,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:18,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546002411] [2022-02-19 03:27:18,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546002411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:18,950 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:18,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:27:18,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140083839] [2022-02-19 03:27:18,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:18,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:18,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:18,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:18,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,953 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:18,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2022-02-19 03:27:18,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:18,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:18,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-19 03:27:19,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2014427279, now seen corresponding path program 1 times [2022-02-19 03:27:19,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622115735] [2022-02-19 03:27:19,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-02-19 03:27:19,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622115735] [2022-02-19 03:27:19,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622115735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:27:19,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106645681] [2022-02-19 03:27:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:19,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:19,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,207 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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) [2022-02-19 03:27:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,207 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-19 03:27:19,304 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 856654322, now seen corresponding path program 2 times [2022-02-19 03:27:19,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272134164] [2022-02-19 03:27:19,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-02-19 03:27:19,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272134164] [2022-02-19 03:27:19,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272134164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:27:19,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354989513] [2022-02-19 03:27:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:19,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,423 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-02-19 03:27:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,423 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-19 03:27:19,503 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1020867905, now seen corresponding path program 2 times [2022-02-19 03:27:19,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138806597] [2022-02-19 03:27:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-02-19 03:27:19,569 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138806597] [2022-02-19 03:27:19,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138806597] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:27:19,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758099172] [2022-02-19 03:27:19,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:19,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,572 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2022-02-19 03:27:19,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,572 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-19 03:27:19,621 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1576418719, now seen corresponding path program 3 times [2022-02-19 03:27:19,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70570622] [2022-02-19 03:27:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-19 03:27:19,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70570622] [2022-02-19 03:27:19,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70570622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-19 03:27:19,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940229016] [2022-02-19 03:27:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-19 03:27:19,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-19 03:27:19,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-19 03:27:19,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,679 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,680 INFO L471 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) [2022-02-19 03:27:19,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,680 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-19 03:27:19,758 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1611589343, now seen corresponding path program 4 times [2022-02-19 03:27:19,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15933989] [2022-02-19 03:27:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-02-19 03:27:19,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15933989] [2022-02-19 03:27:19,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15933989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,818 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,818 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-19 03:27:19,818 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601617510] [2022-02-19 03:27:19,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-19 03:27:19,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-19 03:27:19,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-19 03:27:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,821 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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) [2022-02-19 03:27:19,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-19 03:27:19,913 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1126305558, now seen corresponding path program 5 times [2022-02-19 03:27:19,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:19,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107887271] [2022-02-19 03:27:19,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:19,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-19 03:27:19,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:19,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107887271] [2022-02-19 03:27:19,937 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107887271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-19 03:27:19,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-19 03:27:19,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-19 03:27:19,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215889380] [2022-02-19 03:27:19,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-19 03:27:19,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-19 03:27:19,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:19,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-19 03:27:19,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-19 03:27:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,939 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:19,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2022-02-19 03:27:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:19,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:19,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-19 03:27:20,009 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:20,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1721986514, now seen corresponding path program 6 times [2022-02-19 03:27:20,009 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:20,009 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599772061] [2022-02-19 03:27:20,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 101 proven. 26 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-19 03:27:20,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:20,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599772061] [2022-02-19 03:27:20,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599772061] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 03:27:20,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106439361] [2022-02-19 03:27:20,103 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-19 03:27:20,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 03:27:20,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:27:20,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 03:27:20,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-19 03:27:20,166 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-02-19 03:27:20,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-19 03:27:20,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-19 03:27:20,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 03:27:20,532 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-19 03:27:20,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 03:27:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 22 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-02-19 03:27:20,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106439361] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 03:27:20,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 03:27:20,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-02-19 03:27:20,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604263672] [2022-02-19 03:27:20,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 03:27:20,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-19 03:27:20,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:20,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-19 03:27:20,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-02-19 03:27:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:20,807 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:20,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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) [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:20,808 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:21,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-19 03:27:21,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-19 03:27:21,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-19 03:27:21,583 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -409759383, now seen corresponding path program 7 times [2022-02-19 03:27:21,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:21,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635024816] [2022-02-19 03:27:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-02-19 03:27:21,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-19 03:27:21,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635024816] [2022-02-19 03:27:21,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635024816] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-19 03:27:21,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68243371] [2022-02-19 03:27:21,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-19 03:27:21,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 03:27:21,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-19 03:27:21,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-19 03:27:21,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-19 03:27:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-19 03:27:21,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-19 03:27:21,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-19 03:27:22,000 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 100 proven. 107 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-02-19 03:27:22,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-19 03:27:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 121 proven. 86 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-02-19 03:27:22,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68243371] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-19 03:27:22,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-19 03:27:22,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2022-02-19 03:27:22,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122410776] [2022-02-19 03:27:22,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-19 03:27:22,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-19 03:27:22,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-19 03:27:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-19 03:27:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-02-19 03:27:22,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:22,360 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-19 03:27:22,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.133333333333333) internal successors, (137), 15 states have internal predecessors, (137), 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) [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-02-19 03:27:22,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-19 03:27:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-19 03:27:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-19 03:27:22,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-19 03:27:22,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-19 03:27:22,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-19 03:27:22,905 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-19 03:27:22,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-19 03:27:22,905 INFO L85 PathProgramCache]: Analyzing trace with hash 615950837, now seen corresponding path program 8 times [2022-02-19 03:27:22,905 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-19 03:27:22,905 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378341674] [2022-02-19 03:27:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-19 03:27:22,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-19 03:27:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-19 03:27:22,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-19 03:27:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-19 03:27:22,968 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-19 03:27:22,968 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-19 03:27:22,969 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location Process2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-02-19 03:27:22,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-19 03:27:22,982 INFO L732 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2022-02-19 03:27:22,983 INFO L309 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/3) [2022-02-19 03:27:22,988 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-19 03:27:22,988 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-19 03:27:23,040 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.02 03:27:23 BasicIcfg [2022-02-19 03:27:23,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-19 03:27:23,041 INFO L158 Benchmark]: Toolchain (without parser) took 5600.57ms. Allocated memory was 195.0MB in the beginning and 307.2MB in the end (delta: 112.2MB). Free memory was 153.8MB in the beginning and 239.2MB in the end (delta: -85.4MB). Peak memory consumption was 28.4MB. Max. memory is 8.0GB. [2022-02-19 03:27:23,041 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 195.0MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-19 03:27:23,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.05ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 152.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-19 03:27:23,041 INFO L158 Benchmark]: Boogie Preprocessor took 15.35ms. Allocated memory is still 195.0MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-19 03:27:23,042 INFO L158 Benchmark]: RCFGBuilder took 211.95ms. Allocated memory is still 195.0MB. Free memory was 151.2MB in the beginning and 142.0MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-02-19 03:27:23,042 INFO L158 Benchmark]: TraceAbstraction took 5341.47ms. Allocated memory was 195.0MB in the beginning and 307.2MB in the end (delta: 112.2MB). Free memory was 141.5MB in the beginning and 239.2MB in the end (delta: -97.7MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2022-02-19 03:27:23,043 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.16ms. Allocated memory is still 195.0MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.05ms. Allocated memory is still 195.0MB. Free memory was 153.7MB in the beginning and 152.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.35ms. Allocated memory is still 195.0MB. Free memory was 152.2MB in the beginning and 151.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.95ms. Allocated memory is still 195.0MB. Free memory was 151.2MB in the beginning and 142.0MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5341.47ms. Allocated memory was 195.0MB in the beginning and 307.2MB in the end (delta: 112.2MB). Free memory was 141.5MB in the beginning and 239.2MB in the end (delta: -97.7MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23746, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 5815, negative conditional: 5765, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19713, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19713, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 16526, positive unconditional: 1405, negative: 8637, negative conditional: 6855, negative unconditional: 1782, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 5733, positive unconditional: 12198, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 5733, positive unconditional: 12198, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, positive: 951, positive conditional: 17, positive unconditional: 934, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, positive: 903, positive conditional: 0, positive unconditional: 903, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 211, positive: 48, positive conditional: 17, positive unconditional: 31, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 509, positive: 79, positive conditional: 21, positive unconditional: 58, negative: 430, negative conditional: 228, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26568, positive: 16980, positive conditional: 5716, positive unconditional: 11264, negative: 8474, negative conditional: 1460, negative unconditional: 7014, unknown: 1114, unknown conditional: 130, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 951, Positive conditional cache size: 17, Positive unconditional cache size: 934, Negative cache size: 163, Negative conditional cache size: 113, Negative unconditional cache size: 50, Eliminated conditions: 16075, Maximal queried relation: 7, Independence queries for same thread: 4033 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 232, Number of trivial persistent sets: 102, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1165, positive: 1115, positive conditional: 0, positive unconditional: 1115, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 23746, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 5815, negative conditional: 5765, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19713, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19713, positive: 17931, positive conditional: 16816, positive unconditional: 1115, negative: 1782, negative conditional: 1732, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 16526, positive unconditional: 1405, negative: 8637, negative conditional: 6855, negative unconditional: 1782, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 5733, positive unconditional: 12198, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26568, positive: 17931, positive conditional: 5733, positive unconditional: 12198, negative: 8637, negative conditional: 1573, negative unconditional: 7064, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1114, positive: 951, positive conditional: 17, positive unconditional: 934, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1114, positive: 903, positive conditional: 0, positive unconditional: 903, negative: 211, negative conditional: 0, negative unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 211, positive: 48, positive conditional: 17, positive unconditional: 31, negative: 163, negative conditional: 113, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 509, positive: 79, positive conditional: 21, positive unconditional: 58, negative: 430, negative conditional: 228, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26568, positive: 16980, positive conditional: 5716, positive unconditional: 11264, negative: 8474, negative conditional: 1460, negative unconditional: 7014, unknown: 1114, unknown conditional: 130, unknown unconditional: 984] , Statistics on independence cache: Total cache size (in pairs): 1114, Positive cache size: 951, Positive conditional cache size: 17, Positive unconditional cache size: 934, Negative cache size: 163, Negative conditional cache size: 113, Negative unconditional cache size: 50, Eliminated conditions: 16075, Maximal queried relation: 7, Independence queries for same thread: 4033 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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] [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] [L59] 2 assume lock == 0; VAL [clk=1, critical=0, deadline=2, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=1, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=2, critical=0, deadline=2, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L66] 2 assert critical == 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L67] 2 critical := 1; VAL [clk=3, critical=1, deadline=2, delay=1, lock=1, wait=1] [L68] 2 critical := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=1, wait=1] [L69] 2 lock := 0; VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=3, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L36] FORK 0 fork 2 Process2(); VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=2, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; 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] [L89] 3 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=7, critical=0, deadline=8, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=7, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=8, deadline=8, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=8, critical=1, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=8, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=9, critical=0, deadline=9, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=10, critical=2, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=10, critical=0, deadline=11, deadline=8, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=10, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=11, critical=2, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=11, critical=0, deadline=11, deadline=11, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=11, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=12, critical=0, deadline=11, deadline=12, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=12, critical=0, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=12, critical=1, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=13, critical=1, deadline=13, deadline=12, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=13, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=14, critical=1, deadline=14, deadline=12, delay=1, lock=2, 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. OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 2.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1662 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1753 ConstructedInterpolants, 0 QuantifiedInterpolants, 3410 SizeOfPredicates, 11 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 3595/3965 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! [2022-02-19 03:27:23,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-19 03:27:23,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...