/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-MCRwithDepranks-BasicCegarLoop.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/NonAtomicIncrement_2Threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-10 02:45:54,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-10 02:45:54,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-10 02:45:54,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-10 02:45:54,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-10 02:45:54,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-10 02:45:54,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-10 02:45:54,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-10 02:45:54,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-10 02:45:54,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-10 02:45:54,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-10 02:45:54,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-10 02:45:54,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-10 02:45:54,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-10 02:45:54,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-10 02:45:54,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-10 02:45:54,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-10 02:45:54,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-10 02:45:54,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-10 02:45:54,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-10 02:45:54,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-10 02:45:54,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-10 02:45:54,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-10 02:45:54,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-10 02:45:54,765 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-10 02:45:54,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-10 02:45:54,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-10 02:45:54,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-10 02:45:54,767 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-10 02:45:54,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-10 02:45:54,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-10 02:45:54,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-10 02:45:54,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-10 02:45:54,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-10 02:45:54,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-10 02:45:54,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-10 02:45:54,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-10 02:45:54,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-10 02:45:54,771 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-10 02:45:54,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-10 02:45:54,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-10 02:45:54,773 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-MCRwithDepranks-BasicCegarLoop.epf [2022-02-10 02:45:54,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-10 02:45:54,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-10 02:45:54,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-10 02:45:54,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-10 02:45:54,797 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-10 02:45:54,797 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-10 02:45:54,798 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-10 02:45:54,798 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-10 02:45:54,798 INFO L138 SettingsManager]: * Use SBE=true [2022-02-10 02:45:54,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-10 02:45:54,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-10 02:45:54,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 02:45:54,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-10 02:45:54,800 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-10 02:45:54,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-10 02:45:54,801 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-10 02:45:54,801 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-10 02:45:54,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-10 02:45:54,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-10 02:45:54,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-10 02:45:54,961 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-02-10 02:45:54,962 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-02-10 02:45:54,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/NonAtomicIncrement_2Threads.bpl [2022-02-10 02:45:54,963 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/NonAtomicIncrement_2Threads.bpl' [2022-02-10 02:45:54,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-10 02:45:54,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-10 02:45:54,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-10 02:45:54,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-10 02:45:54,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-10 02:45:54,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,011 INFO L137 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-02-10 02:45:55,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-10 02:45:55,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-10 02:45:55,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-10 02:45:55,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-10 02:45:55,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-10 02:45:55,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-10 02:45:55,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-10 02:45:55,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-10 02:45:55,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/1) ... [2022-02-10 02:45:55,035 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-10 02:45:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-10 02:45:55,069 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-10 02:45:55,076 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-10 02:45:55,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2022-02-10 02:45:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-10 02:45:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-10 02:45:55,113 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess1 given in one single declaration [2022-02-10 02:45:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess1 [2022-02-10 02:45:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess1 [2022-02-10 02:45:55,113 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess2 given in one single declaration [2022-02-10 02:45:55,113 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess2 [2022-02-10 02:45:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess2 [2022-02-10 02:45:55,113 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-10 02:45:55,147 INFO L234 CfgBuilder]: Building ICFG [2022-02-10 02:45:55,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-10 02:45:55,237 INFO L275 CfgBuilder]: Performing block encoding [2022-02-10 02:45:55,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-10 02:45:55,246 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-10 02:45:55,247 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 02:45:55 BoogieIcfgContainer [2022-02-10 02:45:55,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-10 02:45:55,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-10 02:45:55,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-10 02:45:55,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-10 02:45:55,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 02:45:54" (1/2) ... [2022-02-10 02:45:55,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e328ad1 and model type NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 02:45:55, skipping insertion in model container [2022-02-10 02:45:55,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 02:45:55" (2/2) ... [2022-02-10 02:45:55,255 INFO L111 eAbstractionObserver]: Analyzing ICFG NonAtomicIncrement_2Threads.bpl [2022-02-10 02:45:55,258 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-10 02:45:55,258 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-10 02:45:55,258 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-10 02:45:55,258 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-10 02:45:55,297 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,297 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,297 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,298 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,298 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,298 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,298 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,299 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,299 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,299 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,299 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,299 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,300 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,300 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,300 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,300 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,301 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,301 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,301 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,301 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,301 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,302 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,302 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,302 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,305 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,306 WARN L322 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-10 02:45:55,310 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-10 02:45:55,360 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-10 02:45:55,367 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=FINITE_AUTOMATA, mLazyFiniteAutomaton=false, 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-10 02:45:55,368 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-10 02:45:55,378 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 26 transitions, 74 flow [2022-02-10 02:45:55,405 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 92 states, 91 states have (on average 1.7802197802197801) internal successors, (162), 91 states have internal predecessors, (162), 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-10 02:45:55,545 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 682 transitions and produced 413 states. [2022-02-10 02:45:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 413 states, 318 states have (on average 1.6383647798742138) internal successors, (521), 412 states have internal predecessors, (521), 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-10 02:45:55,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:55,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:55,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:55,578 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:55,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1247005680, now seen corresponding path program 1 times [2022-02-10 02:45:55,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:55,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272173324] [2022-02-10 02:45:55,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:55,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:55,762 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-10 02:45:55,763 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:55,763 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272173324] [2022-02-10 02:45:55,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272173324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:55,763 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:55,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-10 02:45:55,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044616365] [2022-02-10 02:45:55,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:55,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-10 02:45:55,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:55,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-10 02:45:55,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 02:45:55,800 INFO L87 Difference]: Start difference. First operand has 413 states, 318 states have (on average 1.6383647798742138) internal successors, (521), 412 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-10 02:45:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:55,847 INFO L93 Difference]: Finished difference Result 342 states and 449 transitions. [2022-02-10 02:45:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-10 02:45:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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) Word has length 20 [2022-02-10 02:45:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:55,876 INFO L225 Difference]: With dead ends: 342 [2022-02-10 02:45:55,876 INFO L226 Difference]: Without dead ends: 219 [2022-02-10 02:45:55,877 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-10 02:45:55,879 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:55,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-10 02:45:55,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-10 02:45:55,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 75. [2022-02-10 02:45:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 74 states have internal predecessors, (116), 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-10 02:45:55,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2022-02-10 02:45:55,951 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 20 [2022-02-10 02:45:55,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:55,951 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2022-02-10 02:45:55,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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-10 02:45:55,952 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2022-02-10 02:45:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:55,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:55,952 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:55,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-10 02:45:55,953 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1247004750, now seen corresponding path program 1 times [2022-02-10 02:45:55,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:55,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396869746] [2022-02-10 02:45:55,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:55,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:56,241 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-10 02:45:56,241 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:56,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396869746] [2022-02-10 02:45:56,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396869746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:56,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:56,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-10 02:45:56,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870766076] [2022-02-10 02:45:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:56,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-10 02:45:56,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:56,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-10 02:45:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-02-10 02:45:56,244 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-10 02:45:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:56,508 INFO L93 Difference]: Finished difference Result 167 states and 241 transitions. [2022-02-10 02:45:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-10 02:45:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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) Word has length 20 [2022-02-10 02:45:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:56,511 INFO L225 Difference]: With dead ends: 167 [2022-02-10 02:45:56,511 INFO L226 Difference]: Without dead ends: 126 [2022-02-10 02:45:56,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=468, Unknown=0, NotChecked=0, Total=702 [2022-02-10 02:45:56,513 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:56,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-10 02:45:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-10 02:45:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 95. [2022-02-10 02:45:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 94 states have internal predecessors, (151), 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-10 02:45:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 151 transitions. [2022-02-10 02:45:56,520 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 151 transitions. Word has length 20 [2022-02-10 02:45:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:56,521 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 151 transitions. [2022-02-10 02:45:56,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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-10 02:45:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 151 transitions. [2022-02-10 02:45:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:56,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:56,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:56,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-10 02:45:56,522 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:56,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2049044218, now seen corresponding path program 2 times [2022-02-10 02:45:56,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:56,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131675535] [2022-02-10 02:45:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:56,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:56,600 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-10 02:45:56,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:56,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131675535] [2022-02-10 02:45:56,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131675535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:56,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:56,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-10 02:45:56,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066342470] [2022-02-10 02:45:56,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:56,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-10 02:45:56,601 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:56,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-10 02:45:56,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-02-10 02:45:56,602 INFO L87 Difference]: Start difference. First operand 95 states and 151 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-10 02:45:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:56,831 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2022-02-10 02:45:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-10 02:45:56,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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) Word has length 20 [2022-02-10 02:45:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:56,832 INFO L225 Difference]: With dead ends: 194 [2022-02-10 02:45:56,832 INFO L226 Difference]: Without dead ends: 158 [2022-02-10 02:45:56,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2022-02-10 02:45:56,834 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 162 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:56,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 77 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-10 02:45:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-02-10 02:45:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.5490196078431373) internal successors, (158), 102 states have internal predecessors, (158), 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-10 02:45:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2022-02-10 02:45:56,841 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 20 [2022-02-10 02:45:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:56,841 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2022-02-10 02:45:56,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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-10 02:45:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2022-02-10 02:45:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:56,842 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:56,842 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:56,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-10 02:45:56,842 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1365561022, now seen corresponding path program 3 times [2022-02-10 02:45:56,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:56,843 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357372359] [2022-02-10 02:45:56,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:56,843 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:56,906 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-10 02:45:56,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:56,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357372359] [2022-02-10 02:45:56,907 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357372359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:56,907 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:56,907 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 02:45:56,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186194591] [2022-02-10 02:45:56,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:56,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:45:56,908 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:56,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:45:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:45:56,909 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:57,076 INFO L93 Difference]: Finished difference Result 136 states and 198 transitions. [2022-02-10 02:45:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 02:45:57,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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) Word has length 20 [2022-02-10 02:45:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:57,077 INFO L225 Difference]: With dead ends: 136 [2022-02-10 02:45:57,077 INFO L226 Difference]: Without dead ends: 114 [2022-02-10 02:45:57,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-02-10 02:45:57,078 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:57,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 81 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-10 02:45:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 89. [2022-02-10 02:45:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:45:57,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2022-02-10 02:45:57,083 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 20 [2022-02-10 02:45:57,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:57,084 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2022-02-10 02:45:57,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2022-02-10 02:45:57,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:57,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:57,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:57,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-10 02:45:57,085 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:57,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 424887652, now seen corresponding path program 4 times [2022-02-10 02:45:57,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:57,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840002941] [2022-02-10 02:45:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:57,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:57,146 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-10 02:45:57,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:57,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840002941] [2022-02-10 02:45:57,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840002941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:57,146 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:57,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 02:45:57,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058318219] [2022-02-10 02:45:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:57,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:45:57,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:45:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:45:57,148 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:57,346 INFO L93 Difference]: Finished difference Result 249 states and 339 transitions. [2022-02-10 02:45:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-10 02:45:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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) Word has length 20 [2022-02-10 02:45:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:57,348 INFO L225 Difference]: With dead ends: 249 [2022-02-10 02:45:57,348 INFO L226 Difference]: Without dead ends: 222 [2022-02-10 02:45:57,348 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2022-02-10 02:45:57,349 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 101 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:57,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 50 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-10 02:45:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 118. [2022-02-10 02:45:57,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 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-10 02:45:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2022-02-10 02:45:57,355 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 20 [2022-02-10 02:45:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:57,355 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2022-02-10 02:45:57,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2022-02-10 02:45:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:57,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:57,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:57,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-10 02:45:57,356 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 755995158, now seen corresponding path program 5 times [2022-02-10 02:45:57,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:57,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041168633] [2022-02-10 02:45:57,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:57,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:57,398 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-10 02:45:57,399 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:57,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041168633] [2022-02-10 02:45:57,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041168633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:57,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:57,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 02:45:57,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228830052] [2022-02-10 02:45:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:57,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 02:45:57,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:57,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 02:45:57,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-10 02:45:57,400 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10 02:45:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:57,535 INFO L93 Difference]: Finished difference Result 185 states and 259 transitions. [2022-02-10 02:45:57,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-10 02:45:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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) Word has length 20 [2022-02-10 02:45:57,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:57,536 INFO L225 Difference]: With dead ends: 185 [2022-02-10 02:45:57,536 INFO L226 Difference]: Without dead ends: 158 [2022-02-10 02:45:57,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-02-10 02:45:57,537 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:57,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:57,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-10 02:45:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2022-02-10 02:45:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.5221238938053097) internal successors, (172), 113 states have internal predecessors, (172), 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-10 02:45:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2022-02-10 02:45:57,542 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 20 [2022-02-10 02:45:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:57,542 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2022-02-10 02:45:57,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10 02:45:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2022-02-10 02:45:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:57,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:57,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:57,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-10 02:45:57,543 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:57,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 891901992, now seen corresponding path program 6 times [2022-02-10 02:45:57,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:57,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871208865] [2022-02-10 02:45:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:57,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:57,612 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-10 02:45:57,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:57,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871208865] [2022-02-10 02:45:57,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871208865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:57,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:57,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 02:45:57,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128976517] [2022-02-10 02:45:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:57,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:45:57,614 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:45:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:45:57,614 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:57,776 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2022-02-10 02:45:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 02:45:57,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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) Word has length 20 [2022-02-10 02:45:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:57,777 INFO L225 Difference]: With dead ends: 160 [2022-02-10 02:45:57,777 INFO L226 Difference]: Without dead ends: 115 [2022-02-10 02:45:57,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2022-02-10 02:45:57,778 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:57,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 59 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:57,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-10 02:45:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2022-02-10 02:45:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 87 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-10 02:45:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2022-02-10 02:45:57,782 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 20 [2022-02-10 02:45:57,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:57,782 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2022-02-10 02:45:57,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2022-02-10 02:45:57,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:57,783 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:57,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:57,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-10 02:45:57,783 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:57,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1548418366, now seen corresponding path program 7 times [2022-02-10 02:45:57,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:57,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103643167] [2022-02-10 02:45:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:57,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:57,864 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-10 02:45:57,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:57,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103643167] [2022-02-10 02:45:57,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103643167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:57,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:57,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-10 02:45:57,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093190157] [2022-02-10 02:45:57,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:57,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-10 02:45:57,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-10 02:45:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-10 02:45:57,866 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10 02:45:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:57,959 INFO L93 Difference]: Finished difference Result 138 states and 197 transitions. [2022-02-10 02:45:57,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-10 02:45:57,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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) Word has length 20 [2022-02-10 02:45:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:57,960 INFO L225 Difference]: With dead ends: 138 [2022-02-10 02:45:57,960 INFO L226 Difference]: Without dead ends: 125 [2022-02-10 02:45:57,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2022-02-10 02:45:57,961 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 66 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:57,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 56 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-10 02:45:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 97. [2022-02-10 02:45:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 96 states have internal predecessors, (146), 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-10 02:45:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2022-02-10 02:45:57,965 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 20 [2022-02-10 02:45:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:57,965 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2022-02-10 02:45:57,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-10 02:45:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2022-02-10 02:45:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:57,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:57,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:57,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-10 02:45:57,966 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 255491556, now seen corresponding path program 8 times [2022-02-10 02:45:57,966 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:57,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925089692] [2022-02-10 02:45:57,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:57,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-10 02:45:58,035 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-10 02:45:58,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-10 02:45:58,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925089692] [2022-02-10 02:45:58,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925089692] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-10 02:45:58,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-10 02:45:58,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-10 02:45:58,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647877871] [2022-02-10 02:45:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-10 02:45:58,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-10 02:45:58,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-10 02:45:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-10 02:45:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-10 02:45:58,037 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-10 02:45:58,190 INFO L93 Difference]: Finished difference Result 177 states and 238 transitions. [2022-02-10 02:45:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-10 02:45:58,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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) Word has length 20 [2022-02-10 02:45:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-10 02:45:58,191 INFO L225 Difference]: With dead ends: 177 [2022-02-10 02:45:58,191 INFO L226 Difference]: Without dead ends: 159 [2022-02-10 02:45:58,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2022-02-10 02:45:58,192 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-10 02:45:58,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 42 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-10 02:45:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-10 02:45:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 81. [2022-02-10 02:45:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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-10 02:45:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2022-02-10 02:45:58,195 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 20 [2022-02-10 02:45:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-10 02:45:58,195 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2022-02-10 02:45:58,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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-10 02:45:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2022-02-10 02:45:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-10 02:45:58,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-10 02:45:58,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-10 02:45:58,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-10 02:45:58,196 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-10 02:45:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-10 02:45:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1217310860, now seen corresponding path program 9 times [2022-02-10 02:45:58,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-10 02:45:58,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243789925] [2022-02-10 02:45:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-10 02:45:58,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-10 02:45:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 02:45:58,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-10 02:45:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-10 02:45:58,213 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-10 02:45:58,213 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-10 02:45:58,214 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2022-02-10 02:45:58,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-10 02:45:58,215 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-10 02:45:58,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-10 02:45:58,217 INFO L732 BasicCegarLoop]: Path program histogram: [9, 1] [2022-02-10 02:45:58,219 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-10 02:45:58,219 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-10 02:45:58,226 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 02:45:58 BasicIcfg [2022-02-10 02:45:58,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-10 02:45:58,227 INFO L158 Benchmark]: Toolchain (without parser) took 3239.47ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 175.4MB in the beginning and 178.4MB in the end (delta: -3.0MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. [2022-02-10 02:45:58,227 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 210.8MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-10 02:45:58,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.74ms. Allocated memory is still 210.8MB. Free memory was 175.3MB in the beginning and 173.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 02:45:58,227 INFO L158 Benchmark]: Boogie Preprocessor took 12.66ms. Allocated memory is still 210.8MB. Free memory was 173.7MB in the beginning and 172.9MB in the end (delta: 853.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-10 02:45:58,227 INFO L158 Benchmark]: RCFGBuilder took 221.40ms. Allocated memory is still 210.8MB. Free memory was 172.9MB in the beginning and 164.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-02-10 02:45:58,228 INFO L158 Benchmark]: TraceAbstraction took 2976.17ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 164.0MB in the beginning and 178.4MB in the end (delta: -14.4MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. [2022-02-10 02:45:58,228 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.18ms. Allocated memory is still 210.8MB. Free memory is still 176.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.74ms. Allocated memory is still 210.8MB. Free memory was 175.3MB in the beginning and 173.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.66ms. Allocated memory is still 210.8MB. Free memory was 173.7MB in the beginning and 172.9MB in the end (delta: 853.5kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 221.40ms. Allocated memory is still 210.8MB. Free memory was 172.9MB in the beginning and 164.4MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2976.17ms. Allocated memory was 210.8MB in the beginning and 253.8MB in the end (delta: 43.0MB). Free memory was 164.0MB in the beginning and 178.4MB in the end (delta: -14.4MB). Peak memory consumption was 28.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0 - 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: 28]: assertion can be violated assertion can be violated We found a FailurePath: [L22] 0 x := 0; VAL [x=0] [L24] FORK 0 fork 1 IncrementProcess1(); VAL [x=0] [L25] FORK 0 fork 2 IncrementProcess2(); VAL [x=0] [L54] 2 localx := x; VAL [localx=0, x=0] [L38] 1 localx := x; VAL [localx=0, localx=0, x=0] [L55] 2 x := localx + 1; VAL [localx=0, localx=0, x=1] [L57] 2 localx := x; VAL [localx=1, localx=0, x=1] [L58] 2 x := localx + 1; VAL [localx=1, localx=0, x=2] [L39] 1 x := localx + 1; VAL [localx=1, localx=0, x=1] [L60] 2 localx := x; VAL [localx=1, localx=0, x=1] [L41] 1 localx := x; VAL [localx=1, localx=1, x=1] [L42] 1 x := localx + 1; VAL [localx=1, localx=1, x=2] [L44] 1 localx := x; VAL [localx=1, localx=2, x=2] [L45] 1 x := localx + 1; VAL [localx=1, localx=2, x=3] [L61] 2 x := localx + 1; VAL [localx=1, localx=2, x=2] [L26] JOIN 1 join 1; VAL [localx=1, localx=2, x=2] [L27] JOIN 2 join 2; VAL [localx=1, localx=2, x=2] [L28] 0 assert x >= 3; VAL [localx=1, localx=2, x=2] - UnprovableResult [Line: 24]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 43 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 688 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 688 mSDsluCounter, 558 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 558 mSDsCounter, 467 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1795 IncrementalHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 467 mSolverCounterUnsat, 186 mSDtfsCounter, 1795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=0, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 536 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-10 02:45:58,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...