/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:01:52,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:01:52,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:01:53,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:01:53,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:01:53,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:01:53,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:01:53,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:01:53,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:01:53,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:01:53,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:01:53,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:01:53,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:01:53,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:01:53,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:01:53,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:01:53,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:01:53,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:01:53,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:01:53,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:01:53,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:01:53,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:01:53,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:01:53,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:01:53,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:01:53,052 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:01:53,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:01:53,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:01:53,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:01:53,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:01:53,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:01:53,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:01:53,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:01:53,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:01:53,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:01:53,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:01:53,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:01:53,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:01:53,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:01:53,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:01:53,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:01:53,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 17:01:53,106 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:01:53,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:01:53,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:01:53,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:01:53,109 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:01:53,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:01:53,109 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:01:53,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:01:53,110 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:01:53,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:01:53,111 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:01:53,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:01:53,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:01:53,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:01:53,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:01:53,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:01:53,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:01:53,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:01:53,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:01:53,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:01:53,113 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:01:53,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:01:53,113 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:01:53,113 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:01:53,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:01:53,114 INFO L138 SettingsManager]: * Interpolant automaton=MCR 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 [2020-11-09 17:01:53,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:01:53,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:01:53,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:01:53,555 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:01:53,556 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:01:53,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2020-11-09 17:01:53,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef2d0b42/be919effaa214cc78b1812108b8b4d41/FLAG10e7ebf17 [2020-11-09 17:01:54,471 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:01:54,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2020-11-09 17:01:54,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef2d0b42/be919effaa214cc78b1812108b8b4d41/FLAG10e7ebf17 [2020-11-09 17:01:54,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aef2d0b42/be919effaa214cc78b1812108b8b4d41 [2020-11-09 17:01:54,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:01:54,717 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:01:54,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:01:54,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:01:54,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:01:54,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:01:54" (1/1) ... [2020-11-09 17:01:54,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ac99af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:54, skipping insertion in model container [2020-11-09 17:01:54,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:01:54" (1/1) ... [2020-11-09 17:01:54,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:01:54,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:01:55,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:01:55,254 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:01:55,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:01:55,503 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:01:55,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55 WrapperNode [2020-11-09 17:01:55,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:01:55,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:01:55,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:01:55,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:01:55,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:01:55,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:01:55,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:01:55,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:01:55,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (1/1) ... [2020-11-09 17:01:55,672 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:01:55,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:01:55,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:01:55,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:01:55,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (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 [2020-11-09 17:01:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:01:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:01:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:01:55,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:01:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:01:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:01:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:01:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:01:55,764 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 17:01:55,764 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 17:01:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:01:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:01:55,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:01:55,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:01:55,767 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 17:01:58,072 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:01:58,072 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:01:58,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:01:58 BoogieIcfgContainer [2020-11-09 17:01:58,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:01:58,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:01:58,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:01:58,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:01:58,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:01:54" (1/3) ... [2020-11-09 17:01:58,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a43faec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:01:58, skipping insertion in model container [2020-11-09 17:01:58,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:01:55" (2/3) ... [2020-11-09 17:01:58,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a43faec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:01:58, skipping insertion in model container [2020-11-09 17:01:58,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:01:58" (3/3) ... [2020-11-09 17:01:58,085 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2020-11-09 17:01:58,103 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:01:58,103 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:01:58,107 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:01:58,108 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:01:58,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,158 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,158 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,159 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,159 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,160 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,161 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,177 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,178 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,178 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,179 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,182 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,186 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,187 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,194 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,203 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:01:58,213 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:01:58,226 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 17:01:58,249 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:01:58,250 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:01:58,250 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:01:58,250 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:01:58,250 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:01:58,250 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:01:58,250 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:01:58,250 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:01:58,263 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:01:58,264 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 17:01:58,267 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 17:01:58,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-09 17:01:58,320 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-09 17:01:58,321 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:01:58,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 17:01:58,329 INFO L116 LiptonReduction]: Number of co-enabled transitions 1754 [2020-11-09 17:01:58,801 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2020-11-09 17:01:59,626 WARN L194 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 17:01:59,748 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-09 17:02:00,271 WARN L194 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-11-09 17:02:00,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:02:00,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:02:00,708 WARN L194 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2020-11-09 17:02:01,013 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-09 17:02:01,132 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2020-11-09 17:02:01,252 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-09 17:02:02,270 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:02:02,391 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:02:02,614 WARN L194 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 17:02:02,861 WARN L194 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 17:02:04,663 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:02:04,931 WARN L194 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:02:05,298 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 17:02:05,487 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 17:02:05,678 WARN L194 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 17:02:05,871 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-11-09 17:02:06,445 WARN L194 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-09 17:02:06,710 WARN L194 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 17:02:07,230 WARN L194 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-11-09 17:02:07,484 WARN L194 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-11-09 17:02:07,496 INFO L131 LiptonReduction]: Checked pairs total: 4885 [2020-11-09 17:02:07,497 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-11-09 17:02:07,504 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-11-09 17:02:07,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-11-09 17:02:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-11-09 17:02:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 17:02:07,570 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:07,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 17:02:07,571 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash 961058307, now seen corresponding path program 1 times [2020-11-09 17:02:07,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:07,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74979904] [2020-11-09 17:02:07,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:07,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74979904] [2020-11-09 17:02:07,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:07,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:02:07,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340879992] [2020-11-09 17:02:07,913 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:07,918 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:07,932 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 17:02:07,932 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:07,937 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:07,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:02:07,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:02:07,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:02:07,959 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-11-09 17:02:08,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:08,089 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-11-09 17:02:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:02:08,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 17:02:08,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:08,136 INFO L225 Difference]: With dead ends: 650 [2020-11-09 17:02:08,136 INFO L226 Difference]: Without dead ends: 550 [2020-11-09 17:02:08,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:02:08,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-11-09 17:02:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-11-09 17:02:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-11-09 17:02:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-11-09 17:02:08,264 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 5 [2020-11-09 17:02:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:08,265 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-11-09 17:02:08,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:02:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-11-09 17:02:08,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:02:08,267 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:08,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:08,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:02:08,267 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:08,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1422403455, now seen corresponding path program 1 times [2020-11-09 17:02:08,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:08,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351243835] [2020-11-09 17:02:08,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:08,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351243835] [2020-11-09 17:02:08,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:08,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:02:08,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [26323839] [2020-11-09 17:02:08,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:08,416 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:08,419 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-11-09 17:02:08,419 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:08,419 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:08,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:02:08,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:02:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:02:08,422 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-11-09 17:02:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:08,465 INFO L93 Difference]: Finished difference Result 610 states and 1806 transitions. [2020-11-09 17:02:08,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:02:08,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 17:02:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:08,470 INFO L225 Difference]: With dead ends: 610 [2020-11-09 17:02:08,470 INFO L226 Difference]: Without dead ends: 510 [2020-11-09 17:02:08,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-11-09 17:02:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2020-11-09 17:02:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2020-11-09 17:02:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1551 transitions. [2020-11-09 17:02:08,490 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1551 transitions. Word has length 10 [2020-11-09 17:02:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:08,491 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 1551 transitions. [2020-11-09 17:02:08,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:02:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1551 transitions. [2020-11-09 17:02:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:02:08,500 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:08,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:08,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:02:08,501 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:08,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:08,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1176246537, now seen corresponding path program 1 times [2020-11-09 17:02:08,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:08,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625322664] [2020-11-09 17:02:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:08,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625322664] [2020-11-09 17:02:08,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:08,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:02:08,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1138571152] [2020-11-09 17:02:08,623 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:08,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:08,627 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 15 transitions. [2020-11-09 17:02:08,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:08,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:08,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:02:08,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:08,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:02:08,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:02:08,693 INFO L87 Difference]: Start difference. First operand 510 states and 1551 transitions. Second operand 4 states. [2020-11-09 17:02:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:08,730 INFO L93 Difference]: Finished difference Result 550 states and 1613 transitions. [2020-11-09 17:02:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:02:08,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:02:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:08,736 INFO L225 Difference]: With dead ends: 550 [2020-11-09 17:02:08,736 INFO L226 Difference]: Without dead ends: 470 [2020-11-09 17:02:08,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-11-09 17:02:08,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-11-09 17:02:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-11-09 17:02:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1409 transitions. [2020-11-09 17:02:08,754 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1409 transitions. Word has length 11 [2020-11-09 17:02:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:08,754 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1409 transitions. [2020-11-09 17:02:08,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:02:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1409 transitions. [2020-11-09 17:02:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:02:08,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:08,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:08,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:02:08,756 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2133792037, now seen corresponding path program 1 times [2020-11-09 17:02:08,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:08,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657904858] [2020-11-09 17:02:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:08,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657904858] [2020-11-09 17:02:08,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:08,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:02:08,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986789270] [2020-11-09 17:02:08,860 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:08,862 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:08,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-11-09 17:02:08,865 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:08,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:08,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:02:08,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:02:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:08,953 INFO L87 Difference]: Start difference. First operand 470 states and 1409 transitions. Second operand 5 states. [2020-11-09 17:02:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:09,083 INFO L93 Difference]: Finished difference Result 680 states and 2017 transitions. [2020-11-09 17:02:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:02:09,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:02:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:09,089 INFO L225 Difference]: With dead ends: 680 [2020-11-09 17:02:09,090 INFO L226 Difference]: Without dead ends: 440 [2020-11-09 17:02:09,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:02:09,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-09 17:02:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-09 17:02:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-09 17:02:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1299 transitions. [2020-11-09 17:02:09,112 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1299 transitions. Word has length 12 [2020-11-09 17:02:09,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:09,112 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1299 transitions. [2020-11-09 17:02:09,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:02:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1299 transitions. [2020-11-09 17:02:09,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:02:09,114 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:09,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:09,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:02:09,114 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:09,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash -612272243, now seen corresponding path program 1 times [2020-11-09 17:02:09,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:09,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507954828] [2020-11-09 17:02:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:09,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:09,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507954828] [2020-11-09 17:02:09,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:09,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:02:09,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094918490] [2020-11-09 17:02:09,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:09,236 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:09,239 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2020-11-09 17:02:09,240 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:09,387 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:09,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:02:09,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:02:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:09,389 INFO L87 Difference]: Start difference. First operand 440 states and 1299 transitions. Second operand 5 states. [2020-11-09 17:02:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:09,490 INFO L93 Difference]: Finished difference Result 845 states and 2415 transitions. [2020-11-09 17:02:09,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:02:09,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 17:02:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:09,495 INFO L225 Difference]: With dead ends: 845 [2020-11-09 17:02:09,495 INFO L226 Difference]: Without dead ends: 485 [2020-11-09 17:02:09,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:02:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-11-09 17:02:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 350. [2020-11-09 17:02:09,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-11-09 17:02:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 975 transitions. [2020-11-09 17:02:09,508 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 975 transitions. Word has length 13 [2020-11-09 17:02:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:09,508 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 975 transitions. [2020-11-09 17:02:09,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:02:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 975 transitions. [2020-11-09 17:02:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:02:09,510 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:09,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:09,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:02:09,510 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:09,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1124631929, now seen corresponding path program 1 times [2020-11-09 17:02:09,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:09,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16298303] [2020-11-09 17:02:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:09,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16298303] [2020-11-09 17:02:09,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:09,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:02:09,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [953496896] [2020-11-09 17:02:09,597 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:09,599 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:09,604 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-11-09 17:02:09,604 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:09,741 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:09,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:02:09,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:02:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:09,742 INFO L87 Difference]: Start difference. First operand 350 states and 975 transitions. Second operand 5 states. [2020-11-09 17:02:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:09,805 INFO L93 Difference]: Finished difference Result 548 states and 1527 transitions. [2020-11-09 17:02:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:02:09,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 17:02:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:09,809 INFO L225 Difference]: With dead ends: 548 [2020-11-09 17:02:09,809 INFO L226 Difference]: Without dead ends: 344 [2020-11-09 17:02:09,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:02:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-11-09 17:02:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-11-09 17:02:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-11-09 17:02:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 953 transitions. [2020-11-09 17:02:09,822 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 953 transitions. Word has length 14 [2020-11-09 17:02:09,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:09,823 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 953 transitions. [2020-11-09 17:02:09,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:02:09,823 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 953 transitions. [2020-11-09 17:02:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:02:09,824 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:09,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:09,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:02:09,825 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:09,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1510861615, now seen corresponding path program 2 times [2020-11-09 17:02:09,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:09,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881622552] [2020-11-09 17:02:09,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:09,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881622552] [2020-11-09 17:02:09,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:09,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:02:09,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [330422886] [2020-11-09 17:02:09,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:09,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:09,964 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-11-09 17:02:09,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:10,067 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:10,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:02:10,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:10,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:02:10,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:02:10,070 INFO L87 Difference]: Start difference. First operand 344 states and 953 transitions. Second operand 4 states. [2020-11-09 17:02:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:10,109 INFO L93 Difference]: Finished difference Result 470 states and 1274 transitions. [2020-11-09 17:02:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:02:10,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-09 17:02:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:10,111 INFO L225 Difference]: With dead ends: 470 [2020-11-09 17:02:10,111 INFO L226 Difference]: Without dead ends: 200 [2020-11-09 17:02:10,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-09 17:02:10,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-11-09 17:02:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-09 17:02:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 533 transitions. [2020-11-09 17:02:10,120 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 533 transitions. Word has length 14 [2020-11-09 17:02:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:10,120 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 533 transitions. [2020-11-09 17:02:10,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:02:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 533 transitions. [2020-11-09 17:02:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 17:02:10,121 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:10,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:10,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:02:10,121 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:10,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 382058925, now seen corresponding path program 1 times [2020-11-09 17:02:10,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:10,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481869457] [2020-11-09 17:02:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:10,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481869457] [2020-11-09 17:02:10,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:10,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:02:10,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1902901725] [2020-11-09 17:02:10,231 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:10,234 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:10,242 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 65 transitions. [2020-11-09 17:02:10,242 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:10,426 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:02:10,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:02:10,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:10,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:02:10,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:02:10,427 INFO L87 Difference]: Start difference. First operand 200 states and 533 transitions. Second operand 4 states. [2020-11-09 17:02:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:10,464 INFO L93 Difference]: Finished difference Result 192 states and 446 transitions. [2020-11-09 17:02:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:02:10,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 17:02:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:10,466 INFO L225 Difference]: With dead ends: 192 [2020-11-09 17:02:10,466 INFO L226 Difference]: Without dead ends: 148 [2020-11-09 17:02:10,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:02:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-11-09 17:02:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-11-09 17:02:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-11-09 17:02:10,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 341 transitions. [2020-11-09 17:02:10,472 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 341 transitions. Word has length 15 [2020-11-09 17:02:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:10,472 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 341 transitions. [2020-11-09 17:02:10,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:02:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 341 transitions. [2020-11-09 17:02:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 17:02:10,473 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:10,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:10,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:02:10,473 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1134931214, now seen corresponding path program 1 times [2020-11-09 17:02:10,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:10,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120128059] [2020-11-09 17:02:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:10,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120128059] [2020-11-09 17:02:10,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:10,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:02:10,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2049796695] [2020-11-09 17:02:10,564 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:10,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:10,577 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 74 transitions. [2020-11-09 17:02:10,577 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:10,608 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,612 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,616 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:10,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:10,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:10,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,791 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:10,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,792 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,793 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:10,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:10,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:10,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,868 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:10,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,871 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:10,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:10,898 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12300#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 17:02:10,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:02:10,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:10,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:02:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:02:10,899 INFO L87 Difference]: Start difference. First operand 148 states and 341 transitions. Second operand 6 states. [2020-11-09 17:02:10,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:10,958 INFO L93 Difference]: Finished difference Result 114 states and 224 transitions. [2020-11-09 17:02:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:02:10,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-11-09 17:02:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:10,959 INFO L225 Difference]: With dead ends: 114 [2020-11-09 17:02:10,960 INFO L226 Difference]: Without dead ends: 88 [2020-11-09 17:02:10,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:02:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-09 17:02:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-11-09 17:02:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-11-09 17:02:10,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 165 transitions. [2020-11-09 17:02:10,963 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 165 transitions. Word has length 17 [2020-11-09 17:02:10,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:10,964 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 165 transitions. [2020-11-09 17:02:10,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:02:10,964 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2020-11-09 17:02:10,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 17:02:10,964 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:10,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:10,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:02:10,965 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:10,965 INFO L82 PathProgramCache]: Analyzing trace with hash -280439418, now seen corresponding path program 1 times [2020-11-09 17:02:10,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:10,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896879520] [2020-11-09 17:02:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:11,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896879520] [2020-11-09 17:02:11,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:11,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:02:11,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1971462585] [2020-11-09 17:02:11,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:11,053 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:11,064 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2020-11-09 17:02:11,065 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:11,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,117 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,118 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,145 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,173 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,175 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,177 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:02:11,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:11,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,409 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:11,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,411 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,412 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:11,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,470 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,498 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12599#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 17:02:11,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:02:11,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:02:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:02:11,500 INFO L87 Difference]: Start difference. First operand 88 states and 165 transitions. Second operand 7 states. [2020-11-09 17:02:11,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:11,583 INFO L93 Difference]: Finished difference Result 70 states and 127 transitions. [2020-11-09 17:02:11,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:02:11,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-11-09 17:02:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:11,584 INFO L225 Difference]: With dead ends: 70 [2020-11-09 17:02:11,585 INFO L226 Difference]: Without dead ends: 62 [2020-11-09 17:02:11,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:02:11,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-09 17:02:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-11-09 17:02:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-09 17:02:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2020-11-09 17:02:11,588 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 19 [2020-11-09 17:02:11,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:11,588 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2020-11-09 17:02:11,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:02:11,589 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2020-11-09 17:02:11,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 17:02:11,589 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:11,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:11,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:02:11,590 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:11,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:11,590 INFO L82 PathProgramCache]: Analyzing trace with hash 971885777, now seen corresponding path program 1 times [2020-11-09 17:02:11,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:11,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373662053] [2020-11-09 17:02:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:02:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:02:11,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373662053] [2020-11-09 17:02:11,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:02:11,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 17:02:11,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171345765] [2020-11-09 17:02:11,803 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:02:11,808 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:02:11,822 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 75 transitions. [2020-11-09 17:02:11,823 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:02:11,827 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:11,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:11,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:11,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 17:02:11,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:11,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:11,832 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,080 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 28 [2020-11-09 17:02:12,114 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 17:02:12,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,116 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,117 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,118 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,119 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,120 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 17:02:12,120 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,121 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,122 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 17:02:12,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 17:02:12,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,129 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 17:02:12,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,172 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,173 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:12,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,233 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,237 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,238 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:12,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:12,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:02:12,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,404 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,405 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:12,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,408 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:02:12,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-11-09 17:02:12,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-11-09 17:02:12,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:12,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 17:02:12,852 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 27 [2020-11-09 17:02:12,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,867 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:12,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,868 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:12,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 17:02:12,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:12,870 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:02:12,871 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,083 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 22 [2020-11-09 17:02:13,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:02:13,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:02:13,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:02:13,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 17:02:13,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 17:02:13,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:02:13,218 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [12804#(and (or (= (mod ~x$r_buff1_thd3~0 256) 0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$r_buff0_thd3~0 256) 0)) (or (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (= (mod ~x$r_buff1_thd3~0 256) 0)) (or (= ~x~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= ~x~0 1) (not (= (mod ~x$r_buff0_thd3~0 256) 0)))), 12805#(and (= ~x$w_buff0~0 1) (or (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$r_buff0_thd3~0 256) 0))) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (= (mod ~x$r_buff1_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))), 12806#(and (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-11-09 17:02:13,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 17:02:13,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:02:13,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 17:02:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-09 17:02:13,220 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 11 states. [2020-11-09 17:02:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:02:13,433 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2020-11-09 17:02:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 17:02:13,435 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-11-09 17:02:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:02:13,435 INFO L225 Difference]: With dead ends: 77 [2020-11-09 17:02:13,435 INFO L226 Difference]: Without dead ends: 42 [2020-11-09 17:02:13,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-09 17:02:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-09 17:02:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-11-09 17:02:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-11-09 17:02:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2020-11-09 17:02:13,439 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2020-11-09 17:02:13,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:02:13,440 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2020-11-09 17:02:13,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 17:02:13,440 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2020-11-09 17:02:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 17:02:13,440 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:02:13,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:02:13,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:02:13,441 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:02:13,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:02:13,442 INFO L82 PathProgramCache]: Analyzing trace with hash -784334831, now seen corresponding path program 2 times [2020-11-09 17:02:13,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:02:13,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623155619] [2020-11-09 17:02:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:02:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:02:13,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:02:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:02:13,601 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:02:13,669 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:02:13,669 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:02:13,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 17:02:13,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:02:13 BasicIcfg [2020-11-09 17:02:13,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:02:13,821 INFO L168 Benchmark]: Toolchain (without parser) took 19108.22 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 125.4 MB in the beginning and 209.3 MB in the end (delta: -83.8 MB). Peak memory consumption was 80.8 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,822 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 125.8 MB. Free memory was 100.9 MB in the beginning and 100.9 MB in the end (delta: 66.8 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:02:13,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.33 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 121.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.26 ms. Allocated memory is still 151.0 MB. Free memory was 121.5 MB in the beginning and 119.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,825 INFO L168 Benchmark]: Boogie Preprocessor took 60.73 ms. Allocated memory is still 151.0 MB. Free memory was 119.0 MB in the beginning and 116.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,826 INFO L168 Benchmark]: RCFGBuilder took 2401.88 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.9 MB in the beginning and 100.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 55.6 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,830 INFO L168 Benchmark]: TraceAbstraction took 15741.99 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 99.5 MB in the beginning and 209.3 MB in the end (delta: -109.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 8.0 GB. [2020-11-09 17:02:13,837 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78 ms. Allocated memory is still 125.8 MB. Free memory was 100.9 MB in the beginning and 100.9 MB in the end (delta: 66.8 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 785.33 ms. Allocated memory is still 151.0 MB. Free memory was 124.9 MB in the beginning and 121.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.26 ms. Allocated memory is still 151.0 MB. Free memory was 121.5 MB in the beginning and 119.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 60.73 ms. Allocated memory is still 151.0 MB. Free memory was 119.0 MB in the beginning and 116.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2401.88 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 116.9 MB in the beginning and 100.1 MB in the end (delta: 16.8 MB). Peak memory consumption was 55.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15741.99 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 99.5 MB in the beginning and 209.3 MB in the end (delta: -109.7 MB). Peak memory consumption was 22.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 933 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 77 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1754 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 4885 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1906; [L832] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1907; [L834] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1908; [L836] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe005_pso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 310 SDtfs, 310 SDslu, 586 SDs, 0 SdLazy, 231 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 91 SyntacticMatches, 19 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 135 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 8786 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...