/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/showcase/NonAtomicIncrement_2Threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 20:41:52,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 20:41:52,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 20:41:52,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 20:41:52,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 20:41:52,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 20:41:52,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 20:41:52,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 20:41:52,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 20:41:52,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 20:41:52,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 20:41:52,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 20:41:52,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 20:41:52,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 20:41:52,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 20:41:52,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 20:41:52,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 20:41:52,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 20:41:52,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 20:41:52,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 20:41:52,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 20:41:52,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 20:41:52,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 20:41:52,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 20:41:52,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 20:41:52,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 20:41:52,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 20:41:52,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 20:41:52,915 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 20:41:52,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 20:41:52,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 20:41:52,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 20:41:52,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 20:41:52,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 20:41:52,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 20:41:52,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 20:41:52,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 20:41:52,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 20:41:52,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 20:41:52,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 20:41:52,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 20:41:52,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-03-10 20:41:52,933 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 20:41:52,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 20:41:52,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 20:41:52,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 20:41:52,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 20:41:52,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 20:41:52,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 20:41:52,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 20:41:52,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 20:41:52,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 20:41:52,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-10 20:41:53,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 20:41:53,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 20:41:53,147 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 20:41:53,147 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-10 20:41:53,151 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-10 20:41:53,152 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 [2021-03-10 20:41:53,152 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/regression/showcase/NonAtomicIncrement_2Threads.bpl' [2021-03-10 20:41:53,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 20:41:53,197 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-10 20:41:53,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 20:41:53,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 20:41:53,198 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 20:41:53,206 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.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,210 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.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,217 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 20:41:53,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 20:41:53,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 20:41:53,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 20:41:53,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... [2021-03-10 20:41:53,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 20:41:53,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 20:41:53,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 20:41:53,227 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 20:41:53,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 20:41:53,283 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-10 20:41:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 20:41:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 20:41:53,284 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess1 given in one single declaration [2021-03-10 20:41:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess1 [2021-03-10 20:41:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess1 [2021-03-10 20:41:53,285 INFO L124 BoogieDeclarations]: Specification and implementation of procedure IncrementProcess2 given in one single declaration [2021-03-10 20:41:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure IncrementProcess2 [2021-03-10 20:41:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure IncrementProcess2 [2021-03-10 20:41:53,285 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 20:41:53,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 20:41:53,392 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-10 20:41:53,393 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 08:41:53 BoogieIcfgContainer [2021-03-10 20:41:53,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 20:41:53,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 20:41:53,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 20:41:53,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 20:41:53,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.03 08:41:53" (1/2) ... [2021-03-10 20:41:53,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a78144f and model type NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 08:41:53, skipping insertion in model container [2021-03-10 20:41:53,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 08:41:53" (2/2) ... [2021-03-10 20:41:53,397 INFO L111 eAbstractionObserver]: Analyzing ICFG NonAtomicIncrement_2Threads.bpl [2021-03-10 20:41:53,400 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 20:41:53,400 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 20:41:53,402 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-10 20:41:53,403 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 20:41:53,414 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,415 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,416 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,416 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,416 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,416 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,416 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,417 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,418 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,418 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,418 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,418 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,418 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,419 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess1Thread1of1ForFork0_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,422 WARN L313 ript$VariableManager]: TermVariabe IncrementProcess2Thread1of1ForFork1_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 20:41:53,426 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-03-10 20:41:53,442 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-03-10 20:41:53,455 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 20:41:53,455 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 20:41:53,455 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 20:41:53,455 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 20:41:53,455 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 20:41:53,455 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 20:41:53,455 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 20:41:53,456 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 20:41:53,466 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 31 places, 26 transitions, 74 flow [2021-03-10 20:41:53,482 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:53,489 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:53,489 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:53,490 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:53,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:53,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1053359336, now seen corresponding path program 1 times [2021-03-10 20:41:53,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:53,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085287258] [2021-03-10 20:41:53,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:53,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085287258] [2021-03-10 20:41:53,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:53,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-10 20:41:53,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405089740] [2021-03-10 20:41:53,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 20:41:53,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:53,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 20:41:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 20:41:53,628 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.7826086956521738) internal successors, (164), 93 states have internal predecessors, (164), 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) [2021-03-10 20:41:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:53,648 INFO L93 Difference]: Finished difference Result 86 states and 148 transitions. [2021-03-10 20:41:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 20:41:53,649 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 [2021-03-10 20:41:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:53,655 INFO L225 Difference]: With dead ends: 86 [2021-03-10 20:41:53,655 INFO L226 Difference]: Without dead ends: 84 [2021-03-10 20:41:53,656 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 20:41:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-03-10 20:41:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-03-10 20:41:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.7590361445783131) internal successors, (146), 83 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) [2021-03-10 20:41:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 146 transitions. [2021-03-10 20:41:53,689 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 146 transitions. Word has length 20 [2021-03-10 20:41:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:53,689 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 146 transitions. [2021-03-10 20:41:53,690 INFO L481 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) [2021-03-10 20:41:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 146 transitions. [2021-03-10 20:41:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:53,691 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:53,692 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:53,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 20:41:53,692 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2043544982, now seen corresponding path program 1 times [2021-03-10 20:41:53,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:53,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898030492] [2021-03-10 20:41:53,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:53,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898030492] [2021-03-10 20:41:53,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:53,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 20:41:53,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075638578] [2021-03-10 20:41:53,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-03-10 20:41:53,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:53,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-03-10 20:41:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-03-10 20:41:53,833 INFO L87 Difference]: Start difference. First operand 84 states and 146 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) [2021-03-10 20:41:54,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:54,150 INFO L93 Difference]: Finished difference Result 375 states and 608 transitions. [2021-03-10 20:41:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-10 20:41:54,150 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 [2021-03-10 20:41:54,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:54,153 INFO L225 Difference]: With dead ends: 375 [2021-03-10 20:41:54,153 INFO L226 Difference]: Without dead ends: 291 [2021-03-10 20:41:54,154 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 210.7ms TimeCoverageRelationStatistics Valid=270, Invalid=542, Unknown=0, NotChecked=0, Total=812 [2021-03-10 20:41:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-03-10 20:41:54,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 114. [2021-03-10 20:41:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.761061946902655) internal successors, (199), 113 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 199 transitions. [2021-03-10 20:41:54,163 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 199 transitions. Word has length 20 [2021-03-10 20:41:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:54,163 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 199 transitions. [2021-03-10 20:41:54,163 INFO L481 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) [2021-03-10 20:41:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 199 transitions. [2021-03-10 20:41:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:54,164 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:54,164 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:54,164 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 20:41:54,164 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash -782755596, now seen corresponding path program 2 times [2021-03-10 20:41:54,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:54,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71616069] [2021-03-10 20:41:54,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:54,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71616069] [2021-03-10 20:41:54,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:54,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 20:41:54,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107767178] [2021-03-10 20:41:54,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 20:41:54,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 20:41:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-10 20:41:54,303 INFO L87 Difference]: Start difference. First operand 114 states and 199 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) [2021-03-10 20:41:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:54,542 INFO L93 Difference]: Finished difference Result 336 states and 533 transitions. [2021-03-10 20:41:54,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 20:41:54,543 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 [2021-03-10 20:41:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:54,545 INFO L225 Difference]: With dead ends: 336 [2021-03-10 20:41:54,545 INFO L226 Difference]: Without dead ends: 266 [2021-03-10 20:41:54,545 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 171.1ms TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2021-03-10 20:41:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-03-10 20:41:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 108. [2021-03-10 20:41:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.7289719626168225) internal successors, (185), 107 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 185 transitions. [2021-03-10 20:41:54,563 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 185 transitions. Word has length 20 [2021-03-10 20:41:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:54,563 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 185 transitions. [2021-03-10 20:41:54,563 INFO L481 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) [2021-03-10 20:41:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 185 transitions. [2021-03-10 20:41:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:54,564 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:54,564 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:54,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 20:41:54,564 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:54,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:54,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1787087534, now seen corresponding path program 3 times [2021-03-10 20:41:54,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:54,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015706338] [2021-03-10 20:41:54,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:54,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015706338] [2021-03-10 20:41:54,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:54,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 20:41:54,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302214548] [2021-03-10 20:41:54,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 20:41:54,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 20:41:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-03-10 20:41:54,624 INFO L87 Difference]: Start difference. First operand 108 states and 185 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) [2021-03-10 20:41:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:54,829 INFO L93 Difference]: Finished difference Result 316 states and 497 transitions. [2021-03-10 20:41:54,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 20:41:54,829 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 [2021-03-10 20:41:54,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:54,830 INFO L225 Difference]: With dead ends: 316 [2021-03-10 20:41:54,830 INFO L226 Difference]: Without dead ends: 278 [2021-03-10 20:41:54,830 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 99.7ms TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2021-03-10 20:41:54,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-03-10 20:41:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 131. [2021-03-10 20:41:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7) internal successors, (221), 130 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 221 transitions. [2021-03-10 20:41:54,834 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 221 transitions. Word has length 20 [2021-03-10 20:41:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:54,834 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 221 transitions. [2021-03-10 20:41:54,834 INFO L481 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) [2021-03-10 20:41:54,834 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 221 transitions. [2021-03-10 20:41:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:54,835 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:54,835 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:54,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 20:41:54,835 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1123205482, now seen corresponding path program 4 times [2021-03-10 20:41:54,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:54,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042075706] [2021-03-10 20:41:54,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:54,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042075706] [2021-03-10 20:41:54,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:54,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 20:41:54,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58065730] [2021-03-10 20:41:54,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 20:41:54,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:54,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 20:41:54,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-10 20:41:54,900 INFO L87 Difference]: Start difference. First operand 131 states and 221 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) [2021-03-10 20:41:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:55,120 INFO L93 Difference]: Finished difference Result 288 states and 451 transitions. [2021-03-10 20:41:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 20:41:55,121 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 [2021-03-10 20:41:55,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:55,122 INFO L225 Difference]: With dead ends: 288 [2021-03-10 20:41:55,122 INFO L226 Difference]: Without dead ends: 271 [2021-03-10 20:41:55,122 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 124.9ms TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2021-03-10 20:41:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-03-10 20:41:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 131. [2021-03-10 20:41:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.6692307692307693) internal successors, (217), 130 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 217 transitions. [2021-03-10 20:41:55,125 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 217 transitions. Word has length 20 [2021-03-10 20:41:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:55,125 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 217 transitions. [2021-03-10 20:41:55,125 INFO L481 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) [2021-03-10 20:41:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 217 transitions. [2021-03-10 20:41:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:55,126 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:55,126 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:55,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 20:41:55,126 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash -286927500, now seen corresponding path program 5 times [2021-03-10 20:41:55,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:55,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427679204] [2021-03-10 20:41:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:55,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427679204] [2021-03-10 20:41:55,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:55,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 20:41:55,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034242062] [2021-03-10 20:41:55,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 20:41:55,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:55,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 20:41:55,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-03-10 20:41:55,178 INFO L87 Difference]: Start difference. First operand 131 states and 217 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) [2021-03-10 20:41:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:55,360 INFO L93 Difference]: Finished difference Result 263 states and 416 transitions. [2021-03-10 20:41:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 20:41:55,360 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 [2021-03-10 20:41:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:55,361 INFO L225 Difference]: With dead ends: 263 [2021-03-10 20:41:55,361 INFO L226 Difference]: Without dead ends: 227 [2021-03-10 20:41:55,361 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 92.6ms TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2021-03-10 20:41:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2021-03-10 20:41:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 110. [2021-03-10 20:41:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 109 states have (on average 1.7064220183486238) internal successors, (186), 109 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2021-03-10 20:41:55,364 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 20 [2021-03-10 20:41:55,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:55,364 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2021-03-10 20:41:55,364 INFO L481 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) [2021-03-10 20:41:55,365 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2021-03-10 20:41:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:55,365 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:55,365 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:55,365 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 20:41:55,365 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:55,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:55,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1851721040, now seen corresponding path program 6 times [2021-03-10 20:41:55,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:55,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969622909] [2021-03-10 20:41:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:55,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969622909] [2021-03-10 20:41:55,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:55,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 20:41:55,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862589787] [2021-03-10 20:41:55,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 20:41:55,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 20:41:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-10 20:41:55,405 INFO L87 Difference]: Start difference. First operand 110 states and 186 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) [2021-03-10 20:41:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:55,531 INFO L93 Difference]: Finished difference Result 190 states and 314 transitions. [2021-03-10 20:41:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 20:41:55,531 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 [2021-03-10 20:41:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:55,532 INFO L225 Difference]: With dead ends: 190 [2021-03-10 20:41:55,532 INFO L226 Difference]: Without dead ends: 165 [2021-03-10 20:41:55,532 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2021-03-10 20:41:55,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-03-10 20:41:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2021-03-10 20:41:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.6842105263157894) internal successors, (192), 114 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 192 transitions. [2021-03-10 20:41:55,534 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 192 transitions. Word has length 20 [2021-03-10 20:41:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:55,534 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 192 transitions. [2021-03-10 20:41:55,535 INFO L481 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) [2021-03-10 20:41:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 192 transitions. [2021-03-10 20:41:55,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:55,535 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:55,535 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:55,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 20:41:55,535 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:55,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1187838988, now seen corresponding path program 7 times [2021-03-10 20:41:55,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:55,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300109767] [2021-03-10 20:41:55,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:55,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300109767] [2021-03-10 20:41:55,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:55,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 20:41:55,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984782145] [2021-03-10 20:41:55,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-10 20:41:55,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:55,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-10 20:41:55,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-03-10 20:41:55,583 INFO L87 Difference]: Start difference. First operand 115 states and 192 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) [2021-03-10 20:41:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:55,723 INFO L93 Difference]: Finished difference Result 175 states and 285 transitions. [2021-03-10 20:41:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 20:41:55,724 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 [2021-03-10 20:41:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:55,724 INFO L225 Difference]: With dead ends: 175 [2021-03-10 20:41:55,725 INFO L226 Difference]: Without dead ends: 149 [2021-03-10 20:41:55,725 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 75.9ms TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2021-03-10 20:41:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-03-10 20:41:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 104. [2021-03-10 20:41:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.6601941747572815) internal successors, (171), 103 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:55,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 171 transitions. [2021-03-10 20:41:55,727 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 171 transitions. Word has length 20 [2021-03-10 20:41:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:55,727 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 171 transitions. [2021-03-10 20:41:55,727 INFO L481 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) [2021-03-10 20:41:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 171 transitions. [2021-03-10 20:41:55,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:55,728 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:55,728 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:55,728 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 20:41:55,728 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:55,728 INFO L82 PathProgramCache]: Analyzing trace with hash -351561006, now seen corresponding path program 8 times [2021-03-10 20:41:55,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:55,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403835827] [2021-03-10 20:41:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:55,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403835827] [2021-03-10 20:41:55,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:55,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 20:41:55,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619763417] [2021-03-10 20:41:55,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 20:41:55,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:55,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 20:41:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-10 20:41:55,766 INFO L87 Difference]: Start difference. First operand 104 states and 171 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) [2021-03-10 20:41:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:55,891 INFO L93 Difference]: Finished difference Result 161 states and 256 transitions. [2021-03-10 20:41:55,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 20:41:55,891 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 [2021-03-10 20:41:55,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:55,892 INFO L225 Difference]: With dead ends: 161 [2021-03-10 20:41:55,892 INFO L226 Difference]: Without dead ends: 134 [2021-03-10 20:41:55,892 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 59.9ms TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2021-03-10 20:41:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-03-10 20:41:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2021-03-10 20:41:55,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 91 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 150 transitions. [2021-03-10 20:41:55,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 150 transitions. Word has length 20 [2021-03-10 20:41:55,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:55,894 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 150 transitions. [2021-03-10 20:41:55,895 INFO L481 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) [2021-03-10 20:41:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 150 transitions. [2021-03-10 20:41:55,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:55,895 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:55,895 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:55,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 20:41:55,895 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:55,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:55,895 INFO L82 PathProgramCache]: Analyzing trace with hash 364388134, now seen corresponding path program 9 times [2021-03-10 20:41:55,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:55,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498737533] [2021-03-10 20:41:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 20:41:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-10 20:41:55,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498737533] [2021-03-10 20:41:55,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 20:41:55,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-10 20:41:55,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273707618] [2021-03-10 20:41:55,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 20:41:55,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 20:41:55,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 20:41:55,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-10 20:41:55,972 INFO L87 Difference]: Start difference. First operand 92 states and 150 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) [2021-03-10 20:41:56,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 20:41:56,170 INFO L93 Difference]: Finished difference Result 209 states and 332 transitions. [2021-03-10 20:41:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-10 20:41:56,171 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 [2021-03-10 20:41:56,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 20:41:56,171 INFO L225 Difference]: With dead ends: 209 [2021-03-10 20:41:56,171 INFO L226 Difference]: Without dead ends: 130 [2021-03-10 20:41:56,171 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 112.3ms TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2021-03-10 20:41:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-03-10 20:41:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2021-03-10 20:41:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.6344086021505377) internal successors, (152), 93 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-10 20:41:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 152 transitions. [2021-03-10 20:41:56,176 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 152 transitions. Word has length 20 [2021-03-10 20:41:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 20:41:56,176 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 152 transitions. [2021-03-10 20:41:56,176 INFO L481 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) [2021-03-10 20:41:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 152 transitions. [2021-03-10 20:41:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-10 20:41:56,177 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 20:41:56,177 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 20:41:56,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 20:41:56,177 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-10 20:41:56,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 20:41:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2121648040, now seen corresponding path program 10 times [2021-03-10 20:41:56,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 20:41:56,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158566274] [2021-03-10 20:41:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 20:41:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 20:41:56,191 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 20:41:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 20:41:56,197 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 20:41:56,210 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 20:41:56,211 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 20:41:56,211 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 20:41:56,219 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 08:41:56 BasicIcfg [2021-03-10 20:41:56,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 20:41:56,220 INFO L168 Benchmark]: Toolchain (without parser) took 3026.00 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 237.3 MB in the beginning and 271.6 MB in the end (delta: -34.3 MB). Peak memory consumption was 62.9 MB. Max. memory is 16.0 GB. [2021-03-10 20:41:56,220 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 20:41:56,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.42 ms. Allocated memory is still 255.9 MB. Free memory was 236.8 MB in the beginning and 235.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-10 20:41:56,220 INFO L168 Benchmark]: Boogie Preprocessor took 8.94 ms. Allocated memory is still 255.9 MB. Free memory was 235.3 MB in the beginning and 234.4 MB in the end (delta: 939.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 20:41:56,220 INFO L168 Benchmark]: RCFGBuilder took 166.22 ms. Allocated memory is still 255.9 MB. Free memory was 234.4 MB in the beginning and 240.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.0 GB. [2021-03-10 20:41:56,221 INFO L168 Benchmark]: TraceAbstraction took 2825.24 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 240.2 MB in the beginning and 271.6 MB in the end (delta: -31.4 MB). Peak memory consumption was 63.5 MB. Max. memory is 16.0 GB. [2021-03-10 20:41:56,221 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 238.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 19.42 ms. Allocated memory is still 255.9 MB. Free memory was 236.8 MB in the beginning and 235.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 8.94 ms. Allocated memory is still 255.9 MB. Free memory was 235.3 MB in the beginning and 234.4 MB in the end (delta: 939.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 166.22 ms. Allocated memory is still 255.9 MB. Free memory was 234.4 MB in the beginning and 240.9 MB in the end (delta: -6.5 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2825.24 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 240.2 MB in the beginning and 271.6 MB in the end (delta: -31.4 MB). Peak memory consumption was 63.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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] [L38] 1 localx := x; VAL [localx=0, x=0] [L25] FORK 0 fork 2 IncrementProcess2(); VAL [localx=0, x=0] [L54] 2 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2759.2ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 14.1ms, AutomataDifference: 1814.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 371 SDtfs, 873 SDslu, 837 SDs, 0 SdLazy, 1739 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 834.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1009.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=4, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 72.2ms AutomataMinimizationTime, 10 MinimizatonAttempts, 912 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 15.1ms SsaConstructionTime, 60.2ms SatisfiabilityAnalysisTime, 619.6ms InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 548 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! Received shutdown request...