/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-varabs.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.abstract-por-f0ea240 [2022-02-11 11:30:27,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-11 11:30:27,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-11 11:30:27,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-11 11:30:27,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-11 11:30:27,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-11 11:30:27,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-11 11:30:27,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-11 11:30:27,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-11 11:30:27,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-11 11:30:27,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-11 11:30:27,364 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-11 11:30:27,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-11 11:30:27,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-11 11:30:27,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-11 11:30:27,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-11 11:30:27,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-11 11:30:27,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-11 11:30:27,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-11 11:30:27,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-11 11:30:27,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-11 11:30:27,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-11 11:30:27,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-11 11:30:27,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-11 11:30:27,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-11 11:30:27,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-11 11:30:27,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-11 11:30:27,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-11 11:30:27,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-11 11:30:27,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-11 11:30:27,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-11 11:30:27,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-11 11:30:27,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-11 11:30:27,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-11 11:30:27,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-11 11:30:27,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-11 11:30:27,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-11 11:30:27,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-11 11:30:27,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-11 11:30:27,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-11 11:30:27,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-11 11:30:27,411 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-varabs.epf [2022-02-11 11:30:27,449 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-11 11:30:27,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-11 11:30:27,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-11 11:30:27,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-11 11:30:27,451 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-11 11:30:27,451 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-11 11:30:27,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-11 11:30:27,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-11 11:30:27,452 INFO L138 SettingsManager]: * Use SBE=true [2022-02-11 11:30:27,452 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-11 11:30:27,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-11 11:30:27,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-11 11:30:27,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-11 11:30:27,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-11 11:30:27,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-11 11:30:27,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-11 11:30:27,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-11 11:30:27,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 11:30:27,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-11 11:30:27,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-11 11:30:27,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-11 11:30:27,461 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-02-11 11:30:27,461 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-02-11 11:30:27,461 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-11 11:30:27,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-11 11:30:27,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-11 11:30:27,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-11 11:30:27,696 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-11 11:30:27,696 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-11 11:30:27,697 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-11 11:30:27,697 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/FischerWithBug.bpl' [2022-02-11 11:30:27,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-11 11:30:27,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-11 11:30:27,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-11 11:30:27,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-11 11:30:27,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-11 11:30:27,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,740 INFO L137 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-11 11:30:27,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-11 11:30:27,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-11 11:30:27,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-11 11:30:27,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-11 11:30:27,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-11 11:30:27,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-11 11:30:27,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-11 11:30:27,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-11 11:30:27,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/1) ... [2022-02-11 11:30:27,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-11 11:30:27,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 11:30:27,780 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-11 11:30:27,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process2 given in one single declaration [2022-02-11 11:30:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure Process2 [2022-02-11 11:30:27,808 INFO L138 BoogieDeclarations]: Found implementation of procedure Process2 [2022-02-11 11:30:27,808 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Process1 given in one single declaration [2022-02-11 11:30:27,808 INFO L130 BoogieDeclarations]: Found specification of procedure Process1 [2022-02-11 11:30:27,809 INFO L138 BoogieDeclarations]: Found implementation of procedure Process1 [2022-02-11 11:30:27,809 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-11 11:30:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-11 11:30:27,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-11 11:30:27,809 INFO L124 BoogieDeclarations]: Specification and implementation of procedure Clock given in one single declaration [2022-02-11 11:30:27,809 INFO L130 BoogieDeclarations]: Found specification of procedure Clock [2022-02-11 11:30:27,810 INFO L138 BoogieDeclarations]: Found implementation of procedure Clock [2022-02-11 11:30:27,810 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-11 11:30:27,843 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-11 11:30:27,846 INFO L234 CfgBuilder]: Building ICFG [2022-02-11 11:30:27,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-11 11:30:27,964 INFO L275 CfgBuilder]: Performing block encoding [2022-02-11 11:30:27,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-11 11:30:27,969 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-11 11:30:27,971 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 11:30:27 BoogieIcfgContainer [2022-02-11 11:30:27,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-11 11:30:27,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-11 11:30:27,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-11 11:30:27,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-11 11:30:27,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.02 11:30:27" (1/2) ... [2022-02-11 11:30:27,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7888b047 and model type FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.02 11:30:27, skipping insertion in model container [2022-02-11 11:30:27,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.02 11:30:27" (2/2) ... [2022-02-11 11:30:27,997 INFO L112 eAbstractionObserver]: Analyzing ICFG FischerWithBug.bpl [2022-02-11 11:30:28,000 WARN L154 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-11 11:30:28,000 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-11 11:30:28,001 INFO L168 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-11 11:30:28,001 INFO L538 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-11 11:30:28,061 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,062 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,062 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,063 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,063 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,063 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,063 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,064 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,064 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,065 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,065 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,066 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,066 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,066 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,066 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,067 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,071 WARN L322 ript$VariableManager]: TermVariable Process1Thread1of1ForFork1_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,092 WARN L322 ript$VariableManager]: TermVariable Process2Thread1of1ForFork2_deadline not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-11 11:30:28,093 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-11 11:30:28,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-11 11:30:28,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 11:30:28,185 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-11 11:30:28,186 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-11 11:30:28,227 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == Process2Thread1of1ForFork2 ======== [2022-02-11 11:30:28,281 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, 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 [2022-02-11 11:30:28,281 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-11 11:30:28,508 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:28,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:28,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1011251863, now seen corresponding path program 1 times [2022-02-11 11:30:28,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:28,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081204047] [2022-02-11 11:30:28,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:28,602 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-11 11:30:28,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:28,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081204047] [2022-02-11 11:30:28,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081204047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:28,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:28,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 11:30:28,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064630557] [2022-02-11 11:30:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:28,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-11 11:30:28,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:28,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-11 11:30:28,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-11 11:30:28,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:28,689 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:28,689 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-11 11:30:28,690 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:28,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable0 [2022-02-11 11:30:28,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:28,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1531194537, now seen corresponding path program 1 times [2022-02-11 11:30:28,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:28,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778837722] [2022-02-11 11:30:28,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:28,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:28,835 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-11 11:30:28,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:28,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778837722] [2022-02-11 11:30:28,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778837722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:28,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:28,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-11 11:30:28,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339656668] [2022-02-11 11:30:28,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:28,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:28,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:28,844 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:28,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 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-11 11:30:28,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:28,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,ResultService [2022-02-11 11:30:29,024 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1676378977, now seen corresponding path program 1 times [2022-02-11 11:30:29,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:29,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543118235] [2022-02-11 11:30:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:29,061 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-11 11:30:29,061 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:29,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543118235] [2022-02-11 11:30:29,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543118235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:29,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:29,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 11:30:29,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49509608] [2022-02-11 11:30:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:29,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:29,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:29,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:29,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:29,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,071 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:29,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-11 11:30:29,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,071 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,ResultService [2022-02-11 11:30:29,165 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:29,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:29,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1570018920, now seen corresponding path program 1 times [2022-02-11 11:30:29,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:29,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874860638] [2022-02-11 11:30:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:29,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:29,214 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-11 11:30:29,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:29,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874860638] [2022-02-11 11:30:29,215 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874860638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:29,216 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:29,216 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 11:30:29,218 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072347185] [2022-02-11 11:30:29,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:29,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:29,218 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:29,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:29,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,222 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:29,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-11 11:30:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,ResultService [2022-02-11 11:30:29,613 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:29,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:29,614 INFO L85 PathProgramCache]: Analyzing trace with hash -66675768, now seen corresponding path program 1 times [2022-02-11 11:30:29,614 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:29,614 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485607172] [2022-02-11 11:30:29,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:29,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-02-11 11:30:29,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:29,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485607172] [2022-02-11 11:30:29,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485607172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:29,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:29,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 11:30:29,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972894039] [2022-02-11 11:30:29,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:29,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:29,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,795 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:29,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 11:30:29,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,795 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,796 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:29,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:29,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,ResultService [2022-02-11 11:30:29,911 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash -772202734, now seen corresponding path program 2 times [2022-02-11 11:30:29,912 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:29,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320102755] [2022-02-11 11:30:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:29,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-02-11 11:30:30,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:30,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320102755] [2022-02-11 11:30:30,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320102755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:30,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:30,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 11:30:30,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764679182] [2022-02-11 11:30:30,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:30,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:30,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:30,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,030 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:30,031 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-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: ResultService,SelfDestructingSolverStorable5 [2022-02-11 11:30:30,128 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:30,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -150122581, now seen corresponding path program 1 times [2022-02-11 11:30:30,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:30,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497608552] [2022-02-11 11:30:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-11 11:30:30,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:30,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497608552] [2022-02-11 11:30:30,198 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497608552] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:30,198 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:30,198 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-11 11:30:30,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378346510] [2022-02-11 11:30:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:30,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-11 11:30:30,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:30,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-11 11:30:30,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-11 11:30:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,200 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:30,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 11:30:30,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,203 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,ResultService [2022-02-11 11:30:30,268 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:30,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1097713291, now seen corresponding path program 2 times [2022-02-11 11:30:30,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:30,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519338187] [2022-02-11 11:30:30,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-02-11 11:30:30,345 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:30,345 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519338187] [2022-02-11 11:30:30,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519338187] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:30,345 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:30,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-11 11:30:30,346 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748239722] [2022-02-11 11:30:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:30,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-11 11:30:30,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:30,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-11 11:30:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-11 11:30:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,369 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:30,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-11 11:30:30,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:30,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,ResultService [2022-02-11 11:30:30,545 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash 258645101, now seen corresponding path program 1 times [2022-02-11 11:30:30,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:30,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662286396] [2022-02-11 11:30:30,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:30,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:30,595 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-02-11 11:30:30,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:30,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662286396] [2022-02-11 11:30:30,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662286396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-11 11:30:30,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-11 11:30:30,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-11 11:30:30,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861380848] [2022-02-11 11:30:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-11 11:30:30,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-11 11:30:30,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:30,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-11 11:30:30,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-11 11:30:30,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,599 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:30,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:30,600 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,ResultService [2022-02-11 11:30:32,055 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:32,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1901602779, now seen corresponding path program 2 times [2022-02-11 11:30:32,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:32,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880699096] [2022-02-11 11:30:32,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:32,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-11 11:30:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-11 11:30:32,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-11 11:30:32,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880699096] [2022-02-11 11:30:32,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880699096] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-11 11:30:32,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224039345] [2022-02-11 11:30:32,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-11 11:30:32,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-11 11:30:32,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-11 11:30:32,137 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-11 11:30:32,139 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-11 11:30:32,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-11 11:30:32,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-11 11:30:32,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-11 11:30:32,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-11 11:30:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 62 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-11 11:30:32,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-11 11:30:32,573 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-11 11:30:32,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224039345] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-11 11:30:32,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-11 11:30:32,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-02-11 11:30:32,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704145903] [2022-02-11 11:30:32,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-11 11:30:32,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-11 11:30:32,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-11 11:30:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-11 11:30:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-02-11 11:30:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,577 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-11 11:30:32,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 12 states have internal predecessors, (80), 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-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,578 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-11 11:30:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-11 11:30:32,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-11 11:30:33,072 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,ResultService,SelfDestructingSolverStorable9 [2022-02-11 11:30:33,072 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting Process2Err0ASSERT_VIOLATIONASSERT === [Process2Err0ASSERT_VIOLATIONASSERT] === [2022-02-11 11:30:33,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-11 11:30:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash -701485807, now seen corresponding path program 3 times [2022-02-11 11:30:33,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-11 11:30:33,073 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138847871] [2022-02-11 11:30:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-11 11:30:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-11 11:30:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 11:30:33,086 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-11 11:30:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-11 11:30:33,119 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-11 11:30:33,119 INFO L629 BasicCegarLoop]: Counterexample is feasible [2022-02-11 11:30:33,119 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location Process2Err0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-02-11 11:30:33,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-11 11:30:33,123 INFO L733 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2022-02-11 11:30:33,124 INFO L313 ceAbstractionStarter]: Result for error location Process2Thread1of1ForFork2 was UNSAFE (1/3) [2022-02-11 11:30:33,126 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-11 11:30:33,126 INFO L184 ceAbstractionStarter]: Computing trace abstraction results [2022-02-11 11:30:33,162 INFO L202 PluginConnector]: Adding new model FischerWithBug.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.02 11:30:33 BasicIcfg [2022-02-11 11:30:33,163 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-11 11:30:33,163 INFO L158 Benchmark]: Toolchain (without parser) took 5442.15ms. Allocated memory was 198.2MB in the beginning and 316.7MB in the end (delta: 118.5MB). Free memory was 157.6MB in the beginning and 111.6MB in the end (delta: 46.0MB). Peak memory consumption was 164.9MB. Max. memory is 8.0GB. [2022-02-11 11:30:33,163 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 11:30:33,164 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.92ms. Allocated memory is still 198.2MB. Free memory was 157.5MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-11 11:30:33,164 INFO L158 Benchmark]: Boogie Preprocessor took 13.90ms. Allocated memory is still 198.2MB. Free memory was 155.9MB in the beginning and 155.0MB in the end (delta: 942.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-11 11:30:33,164 INFO L158 Benchmark]: RCFGBuilder took 213.91ms. Allocated memory is still 198.2MB. Free memory was 154.9MB in the beginning and 145.8MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-02-11 11:30:33,164 INFO L158 Benchmark]: TraceAbstraction took 5190.82ms. Allocated memory was 198.2MB in the beginning and 316.7MB in the end (delta: 118.5MB). Free memory was 145.3MB in the beginning and 111.6MB in the end (delta: 33.7MB). Peak memory consumption was 152.3MB. Max. memory is 8.0GB. [2022-02-11 11:30:33,165 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.11ms. Allocated memory is still 198.2MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 19.92ms. Allocated memory is still 198.2MB. Free memory was 157.5MB in the beginning and 155.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.90ms. Allocated memory is still 198.2MB. Free memory was 155.9MB in the beginning and 155.0MB in the end (delta: 942.1kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 213.91ms. Allocated memory is still 198.2MB. Free memory was 154.9MB in the beginning and 145.8MB in the end (delta: 9.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5190.82ms. Allocated memory was 198.2MB in the beginning and 316.7MB in the end (delta: 118.5MB). Free memory was 145.3MB in the beginning and 111.6MB in the end (delta: 33.7MB). Peak memory consumption was 152.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3263, positive: 2620, positive conditional: 1553, positive unconditional: 1067, negative: 643, negative conditional: 600, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16462, positive: 15690, positive conditional: 9268, positive unconditional: 6422, negative: 772, negative conditional: 608, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16462, positive: 15690, positive conditional: 9268, positive unconditional: 6422, negative: 772, negative conditional: 608, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 9056, positive unconditional: 6634, negative: 3817, negative conditional: 3045, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 2794, positive unconditional: 12896, negative: 3817, negative conditional: 697, negative unconditional: 3120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 2794, positive unconditional: 12896, negative: 3817, negative conditional: 697, negative unconditional: 3120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2488, positive: 2370, positive conditional: 49, positive unconditional: 2321, negative: 118, negative conditional: 65, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2488, positive: 2163, positive conditional: 0, positive unconditional: 2163, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 325, positive: 207, positive conditional: 20, positive unconditional: 187, negative: 115, negative conditional: 64, negative unconditional: 51, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1904, positive: 385, positive conditional: 38, positive unconditional: 347, negative: 211, negative conditional: 99, negative unconditional: 113, unknown: 1307, unknown conditional: 141, unknown unconditional: 1167] ], Cache Queries: [ total: 19507, positive: 13320, positive conditional: 2745, positive unconditional: 10575, negative: 3699, negative conditional: 632, negative unconditional: 3067, unknown: 2488, unknown conditional: 114, unknown unconditional: 2374] , Statistics on independence cache: Total cache size (in pairs): 2488, Positive cache size: 2370, Positive conditional cache size: 49, Positive unconditional cache size: 2321, Negative cache size: 118, Negative conditional cache size: 65, Negative unconditional cache size: 53, Eliminated conditions: 8610, Maximal queried relation: 6, Independence queries for same thread: 385 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 127, Number of trivial persistent sets: 67, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1110, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3263, positive: 2620, positive conditional: 1553, positive unconditional: 1067, negative: 643, negative conditional: 600, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16462, positive: 15690, positive conditional: 9268, positive unconditional: 6422, negative: 772, negative conditional: 608, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16462, positive: 15690, positive conditional: 9268, positive unconditional: 6422, negative: 772, negative conditional: 608, negative unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 9056, positive unconditional: 6634, negative: 3817, negative conditional: 3045, negative unconditional: 772, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 2794, positive unconditional: 12896, negative: 3817, negative conditional: 697, negative unconditional: 3120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19507, positive: 15690, positive conditional: 2794, positive unconditional: 12896, negative: 3817, negative conditional: 697, negative unconditional: 3120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2488, positive: 2370, positive conditional: 49, positive unconditional: 2321, negative: 118, negative conditional: 65, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2488, positive: 2163, positive conditional: 0, positive unconditional: 2163, negative: 325, negative conditional: 0, negative unconditional: 325, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 325, positive: 207, positive conditional: 20, positive unconditional: 187, negative: 115, negative conditional: 64, negative unconditional: 51, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1904, positive: 385, positive conditional: 38, positive unconditional: 347, negative: 211, negative conditional: 99, negative unconditional: 113, unknown: 1307, unknown conditional: 141, unknown unconditional: 1167] ], Cache Queries: [ total: 19507, positive: 13320, positive conditional: 2745, positive unconditional: 10575, negative: 3699, negative conditional: 632, negative unconditional: 3067, unknown: 2488, unknown conditional: 114, unknown unconditional: 2374] , Statistics on independence cache: Total cache size (in pairs): 2488, Positive cache size: 2370, Positive conditional cache size: 49, Positive unconditional cache size: 2321, Negative cache size: 118, Negative conditional cache size: 65, Negative unconditional cache size: 53, Eliminated conditions: 8610, Maximal queried relation: 6, Independence queries for same thread: 385 - 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] [L36] FORK 0 fork 2 Process2(); VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=4, critical=0, deadline=2, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=4, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=5, critical=2, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=5, critical=0, deadline=2, deadline=5, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=5, critical=0, deadline=2, deadline=6, delay=1, lock=2, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=5, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=6, critical=2, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=6, critical=0, deadline=6, deadline=6, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=0, wait=1] [L60] 2 lock := 1; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=6, critical=0, deadline=6, deadline=7, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=6, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=1, wait=1] [L81] 3 lock := 2; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=7, critical=0, deadline=7, deadline=7, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L66] 2 assert critical == 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L67] 2 critical := 1; VAL [clk=7, critical=1, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L68] 2 critical := 0; VAL [clk=7, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=8, critical=2, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=2, wait=1] [L90] 3 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=8, critical=0, deadline=7, deadline=8, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L69] 2 lock := 0; VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L57] COND TRUE 2 lock != 1 VAL [clk=8, critical=0, deadline=7, deadline=9, delay=1, lock=0, wait=1] [L58] 2 deadline := clk + delay; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L59] 2 assume lock == 0; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=8, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L88] 3 critical := 2; VAL [clk=9, critical=2, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L89] 3 critical := 0; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=2, wait=1] [L60] 2 lock := 1; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L61] 2 assume clk <= deadline; VAL [clk=9, critical=0, deadline=9, deadline=9, delay=1, lock=1, wait=1] [L62] 2 deadline := clk + wait; VAL [clk=9, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L44] 1 clk := clk + 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L63] 2 assume clk >= deadline; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L64] 2 assume lock == 1; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=1, wait=1] [L90] 3 lock := 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L78] COND TRUE 3 lock != 2 VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L66] 2 assert critical == 0; VAL [clk=10, critical=0, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L67] 2 critical := 1; VAL [clk=10, critical=1, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L44] 1 clk := clk + 1; VAL [clk=11, critical=1, deadline=10, deadline=9, delay=1, lock=0, wait=1] [L79] 3 deadline := clk + delay; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=0, wait=1] [L80] 3 assume lock == 0; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=0, wait=1] [L81] 3 lock := 2; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L82] 3 assume clk <= deadline; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L83] 3 deadline := clk + wait; VAL [clk=11, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L44] 1 clk := clk + 1; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L84] 3 assume clk >= deadline; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L85] 3 assume lock == 2; VAL [clk=12, critical=1, deadline=10, deadline=12, delay=1, lock=2, wait=1] [L87] 3 assert critical == 0; VAL [clk=12, critical=1, deadline=10, 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: 4.9s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 3.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 41, 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 888 NumberOfCodeBlocks, 888 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 1369 SizeOfPredicates, 5 NumberOfNonLiveVariables, 146 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 1036/1055 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-11 11:30:33,208 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-11 11:30:33,411 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...