/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:11:49,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:11:49,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:11:49,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:11:49,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:11:49,644 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:11:49,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:11:49,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:11:49,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:11:49,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:11:49,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:11:49,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:11:49,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:11:49,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:11:49,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:11:49,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:11:49,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:11:49,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:11:49,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:11:49,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:11:49,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:11:49,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:11:49,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:11:49,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:11:49,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:11:49,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:11:49,672 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:11:49,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:11:49,673 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:11:49,674 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:11:49,674 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:11:49,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:11:49,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:11:49,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:11:49,678 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:11:49,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:11:49,679 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:11:49,679 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:11:49,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:11:49,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:11:49,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:11:49,682 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-WP.epf [2020-10-06 01:11:49,705 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:11:49,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:11:49,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:11:49,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:11:49,707 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:11:49,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:11:49,707 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:11:49,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:11:49,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:11:49,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:11:49,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:11:49,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:11:49,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:11:49,709 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:11:49,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:11:49,709 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:11:49,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:11:49,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:11:49,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:11:49,710 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:11:49,710 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:11:49,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:11:49,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:11:49,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:11:49,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:11:49,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:11:49,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:11:49,712 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:11:49,712 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:11:49,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:11:49,712 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:11:50,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:11:50,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:11:50,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:11:50,070 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:11:50,072 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:11:50,074 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-06 01:11:50,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2958c7/d92c61d940644faeb7550dc936b2d3a4/FLAGcafe85e4b [2020-10-06 01:11:50,717 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:11:50,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-06 01:11:50,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2958c7/d92c61d940644faeb7550dc936b2d3a4/FLAGcafe85e4b [2020-10-06 01:11:51,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca2958c7/d92c61d940644faeb7550dc936b2d3a4 [2020-10-06 01:11:51,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:11:51,028 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:11:51,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:51,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:11:51,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:11:51,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae5a2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51, skipping insertion in model container [2020-10-06 01:11:51,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:11:51,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:11:51,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:51,745 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:11:51,805 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:11:51,898 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:11:51,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51 WrapperNode [2020-10-06 01:11:51,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:11:51,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:51,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:11:51,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:11:51,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:11:51,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:11:51,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:11:51,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:11:51,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:51,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:52,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:52,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (1/1) ... [2020-10-06 01:11:52,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:11:52,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:11:52,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:11:52,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:11:52,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (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-10-06 01:11:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:11:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 01:11:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 01:11:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:11:52,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:11:52,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:11:52,092 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:11:54,151 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:11:54,151 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:11:54,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:54 BoogieIcfgContainer [2020-10-06 01:11:54,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:11:54,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:11:54,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:11:54,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:11:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:11:51" (1/3) ... [2020-10-06 01:11:54,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b974d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:54, skipping insertion in model container [2020-10-06 01:11:54,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:11:51" (2/3) ... [2020-10-06 01:11:54,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b974d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:11:54, skipping insertion in model container [2020-10-06 01:11:54,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:11:54" (3/3) ... [2020-10-06 01:11:54,164 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-10-06 01:11:54,176 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:11:54,176 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:11:54,185 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:11:54,186 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:11:54,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,219 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,219 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,222 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,224 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,225 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,225 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:11:54,268 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 01:11:54,294 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:11:54,294 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:11:54,295 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:11:54,295 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:11:54,295 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:11:54,295 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:11:54,295 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:11:54,295 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:11:54,315 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:54,317 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:54,367 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 01:11:54,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:54,372 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 01:11:54,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-06 01:11:54,398 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-06 01:11:54,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:11:54,399 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-06 01:11:54,401 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1536 [2020-10-06 01:11:54,402 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:11:54,806 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 01:11:56,355 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-06 01:11:56,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 01:11:56,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:11:56,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-06 01:11:56,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:11:57,250 WARN L193 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-06 01:11:57,494 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-06 01:11:57,817 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 01:11:57,921 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 01:11:59,296 WARN L193 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-06 01:11:59,723 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-06 01:12:00,155 WARN L193 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-06 01:12:00,540 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-06 01:12:01,282 WARN L193 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-06 01:12:01,624 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:12:02,644 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2020-10-06 01:12:02,966 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-06 01:12:03,213 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-06 01:12:03,330 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-06 01:12:03,339 INFO L206 etLargeBlockEncoding]: Checked pairs total: 3990 [2020-10-06 01:12:03,339 INFO L214 etLargeBlockEncoding]: Total number of compositions: 77 [2020-10-06 01:12:03,343 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-06 01:12:03,387 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-06 01:12:03,390 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-06 01:12:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:12:03,398 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:03,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:03,399 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1019465781, now seen corresponding path program 1 times [2020-10-06 01:12:03,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:03,437 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996944885] [2020-10-06 01:12:03,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:03,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:03,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996944885] [2020-10-06 01:12:03,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:03,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:12:03,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1591318552] [2020-10-06 01:12:03,720 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:03,724 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:03,741 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:12:03,741 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:03,746 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:03,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:12:03,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:12:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:12:03,760 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-06 01:12:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:03,851 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-06 01:12:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:12:03,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:12:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:03,875 INFO L225 Difference]: With dead ends: 550 [2020-10-06 01:12:03,876 INFO L226 Difference]: Without dead ends: 450 [2020-10-06 01:12:03,877 INFO L675 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-10-06 01:12:03,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-06 01:12:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-06 01:12:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-06 01:12:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-06 01:12:03,999 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-06 01:12:04,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:04,001 INFO L479 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-06 01:12:04,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:12:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-06 01:12:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:12:04,008 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:04,008 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:04,008 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:12:04,009 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash 454120523, now seen corresponding path program 1 times [2020-10-06 01:12:04,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:04,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586377066] [2020-10-06 01:12:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:04,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586377066] [2020-10-06 01:12:04,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:04,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:12:04,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344545860] [2020-10-06 01:12:04,224 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:04,226 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:04,228 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 01:12:04,228 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:04,228 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:04,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:12:04,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:12:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:12:04,231 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-06 01:12:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:04,267 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-06 01:12:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:12:04,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 01:12:04,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:04,274 INFO L225 Difference]: With dead ends: 445 [2020-10-06 01:12:04,274 INFO L226 Difference]: Without dead ends: 445 [2020-10-06 01:12:04,275 INFO L675 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-10-06 01:12:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-06 01:12:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-06 01:12:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-06 01:12:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-06 01:12:04,306 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-06 01:12:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:04,307 INFO L479 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-06 01:12:04,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:12:04,307 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-06 01:12:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:12:04,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:04,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:04,309 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:12:04,309 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:04,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:04,310 INFO L82 PathProgramCache]: Analyzing trace with hash 660752975, now seen corresponding path program 1 times [2020-10-06 01:12:04,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:04,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486417786] [2020-10-06 01:12:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:04,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486417786] [2020-10-06 01:12:04,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:04,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:12:04,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1540575089] [2020-10-06 01:12:04,448 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:04,449 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:04,452 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-06 01:12:04,452 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:04,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:12:04,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:04,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,481 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:04,504 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:04,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:04,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:04,530 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:04,550 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:12:04,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:04,583 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:12:04,633 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:04,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:12:04,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:04,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:12:04,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:12:04,635 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 3 states. [2020-10-06 01:12:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:04,665 INFO L93 Difference]: Finished difference Result 439 states and 1317 transitions. [2020-10-06 01:12:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:12:04,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 01:12:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:04,670 INFO L225 Difference]: With dead ends: 439 [2020-10-06 01:12:04,670 INFO L226 Difference]: Without dead ends: 439 [2020-10-06 01:12:04,671 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-10-06 01:12:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-06 01:12:04,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-06 01:12:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-06 01:12:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1317 transitions. [2020-10-06 01:12:04,691 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1317 transitions. Word has length 10 [2020-10-06 01:12:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:04,692 INFO L479 AbstractCegarLoop]: Abstraction has 439 states and 1317 transitions. [2020-10-06 01:12:04,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:12:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1317 transitions. [2020-10-06 01:12:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:12:04,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:04,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:04,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:12:04,694 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1192834032, now seen corresponding path program 1 times [2020-10-06 01:12:04,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:04,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695610392] [2020-10-06 01:12:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:04,748 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695610392] [2020-10-06 01:12:04,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:04,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:12:04,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1413437800] [2020-10-06 01:12:04,749 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:04,751 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:04,753 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-06 01:12:04,753 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:04,754 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:04,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:12:04,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:04,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:12:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:12:04,755 INFO L87 Difference]: Start difference. First operand 439 states and 1317 transitions. Second operand 3 states. [2020-10-06 01:12:04,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:04,771 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-06 01:12:04,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:12:04,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-06 01:12:04,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:04,776 INFO L225 Difference]: With dead ends: 434 [2020-10-06 01:12:04,776 INFO L226 Difference]: Without dead ends: 434 [2020-10-06 01:12:04,777 INFO L675 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-10-06 01:12:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-06 01:12:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-06 01:12:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-06 01:12:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-06 01:12:04,794 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-06 01:12:04,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:04,795 INFO L479 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-06 01:12:04,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:12:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-06 01:12:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:12:04,797 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:04,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:04,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:12:04,797 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:04,798 INFO L82 PathProgramCache]: Analyzing trace with hash -991494548, now seen corresponding path program 1 times [2020-10-06 01:12:04,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:04,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909216027] [2020-10-06 01:12:04,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:04,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:04,886 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909216027] [2020-10-06 01:12:04,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:04,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:12:04,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344454916] [2020-10-06 01:12:04,887 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:04,889 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:04,892 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-10-06 01:12:04,892 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:04,927 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:12:04,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:04,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,934 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:04,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:04,950 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:04,954 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:04,956 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:04,991 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:04,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:12:04,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:04,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:12:04,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:12:04,992 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-10-06 01:12:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:05,094 INFO L93 Difference]: Finished difference Result 420 states and 1246 transitions. [2020-10-06 01:12:05,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:12:05,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 01:12:05,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:05,099 INFO L225 Difference]: With dead ends: 420 [2020-10-06 01:12:05,099 INFO L226 Difference]: Without dead ends: 420 [2020-10-06 01:12:05,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:12:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-06 01:12:05,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-06 01:12:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-06 01:12:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1246 transitions. [2020-10-06 01:12:05,115 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1246 transitions. Word has length 11 [2020-10-06 01:12:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:05,116 INFO L479 AbstractCegarLoop]: Abstraction has 420 states and 1246 transitions. [2020-10-06 01:12:05,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:12:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1246 transitions. [2020-10-06 01:12:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 01:12:05,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:05,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:05,118 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:12:05,118 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:05,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash 350943551, now seen corresponding path program 1 times [2020-10-06 01:12:05,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:05,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171153929] [2020-10-06 01:12:05,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:05,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:05,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171153929] [2020-10-06 01:12:05,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:05,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:12:05,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [526139476] [2020-10-06 01:12:05,191 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:05,192 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:05,197 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-06 01:12:05,198 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:05,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:12:05,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:05,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,235 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 01:12:05,303 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:05,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:12:05,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:12:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:12:05,304 INFO L87 Difference]: Start difference. First operand 420 states and 1246 transitions. Second operand 5 states. [2020-10-06 01:12:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:05,354 INFO L93 Difference]: Finished difference Result 415 states and 1227 transitions. [2020-10-06 01:12:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:12:05,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-06 01:12:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:05,358 INFO L225 Difference]: With dead ends: 415 [2020-10-06 01:12:05,358 INFO L226 Difference]: Without dead ends: 415 [2020-10-06 01:12:05,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:12:05,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-06 01:12:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2020-10-06 01:12:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-10-06 01:12:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1216 transitions. [2020-10-06 01:12:05,372 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1216 transitions. Word has length 12 [2020-10-06 01:12:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:05,373 INFO L479 AbstractCegarLoop]: Abstraction has 411 states and 1216 transitions. [2020-10-06 01:12:05,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:12:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1216 transitions. [2020-10-06 01:12:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 01:12:05,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:05,374 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:05,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:12:05,375 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:05,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash -442809329, now seen corresponding path program 1 times [2020-10-06 01:12:05,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:05,376 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369693416] [2020-10-06 01:12:05,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:05,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369693416] [2020-10-06 01:12:05,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:05,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:12:05,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [678630274] [2020-10-06 01:12:05,419 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:05,421 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:05,423 INFO L258 McrAutomatonBuilder]: Finished intersection with 13 states and 12 transitions. [2020-10-06 01:12:05,423 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:05,424 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:05,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:12:05,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:12:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:12:05,425 INFO L87 Difference]: Start difference. First operand 411 states and 1216 transitions. Second operand 3 states. [2020-10-06 01:12:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:05,440 INFO L93 Difference]: Finished difference Result 560 states and 1604 transitions. [2020-10-06 01:12:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:12:05,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-06 01:12:05,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:05,444 INFO L225 Difference]: With dead ends: 560 [2020-10-06 01:12:05,444 INFO L226 Difference]: Without dead ends: 425 [2020-10-06 01:12:05,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-06 01:12:05,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-10-06 01:12:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2020-10-06 01:12:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-06 01:12:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-06 01:12:05,459 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-06 01:12:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:05,460 INFO L479 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-06 01:12:05,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:12:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-06 01:12:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:12:05,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:05,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:05,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:12:05,462 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:05,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:05,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2005652100, now seen corresponding path program 1 times [2020-10-06 01:12:05,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:05,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520994991] [2020-10-06 01:12:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:05,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:05,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520994991] [2020-10-06 01:12:05,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:05,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:12:05,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958603390] [2020-10-06 01:12:05,562 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:05,563 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:05,570 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-06 01:12:05,570 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:05,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-06 01:12:05,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:05,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,610 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:05,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:05,622 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:05,629 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:05,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:05,699 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:05,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:12:05,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:05,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:12:05,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:12:05,701 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-06 01:12:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:05,861 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-10-06 01:12:05,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:12:05,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-06 01:12:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:05,865 INFO L225 Difference]: With dead ends: 440 [2020-10-06 01:12:05,865 INFO L226 Difference]: Without dead ends: 392 [2020-10-06 01:12:05,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:12:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-06 01:12:05,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-10-06 01:12:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-06 01:12:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-06 01:12:05,883 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-10-06 01:12:05,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:05,883 INFO L479 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-06 01:12:05,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:12:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-06 01:12:05,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 01:12:05,885 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:05,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:05,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:12:05,886 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:05,886 INFO L82 PathProgramCache]: Analyzing trace with hash -842166617, now seen corresponding path program 1 times [2020-10-06 01:12:05,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:05,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769781854] [2020-10-06 01:12:05,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:06,007 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769781854] [2020-10-06 01:12:06,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:06,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:12:06,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1160460782] [2020-10-06 01:12:06,008 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:06,010 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:06,014 INFO L258 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-06 01:12:06,014 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:06,017 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:06,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:12:06,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:06,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:12:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:12:06,018 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-06 01:12:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:06,056 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-06 01:12:06,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:12:06,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-06 01:12:06,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:06,059 INFO L225 Difference]: With dead ends: 384 [2020-10-06 01:12:06,059 INFO L226 Difference]: Without dead ends: 280 [2020-10-06 01:12:06,060 INFO L675 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-10-06 01:12:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-06 01:12:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-06 01:12:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-06 01:12:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-06 01:12:06,069 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-06 01:12:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:06,069 INFO L479 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-06 01:12:06,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:12:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-06 01:12:06,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:12:06,070 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:06,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:06,070 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:12:06,071 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:06,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:06,071 INFO L82 PathProgramCache]: Analyzing trace with hash -711911559, now seen corresponding path program 1 times [2020-10-06 01:12:06,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:06,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787195611] [2020-10-06 01:12:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:06,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787195611] [2020-10-06 01:12:06,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:06,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:12:06,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1464179103] [2020-10-06 01:12:06,161 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:06,163 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:06,167 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2020-10-06 01:12:06,168 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:06,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,204 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:12:06,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:12:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:12:06,206 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-06 01:12:06,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:06,252 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-06 01:12:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:12:06,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-06 01:12:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:06,254 INFO L225 Difference]: With dead ends: 230 [2020-10-06 01:12:06,254 INFO L226 Difference]: Without dead ends: 176 [2020-10-06 01:12:06,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:12:06,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-06 01:12:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-06 01:12:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-06 01:12:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-06 01:12:06,260 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-06 01:12:06,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:06,261 INFO L479 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-06 01:12:06,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:12:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-06 01:12:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 01:12:06,262 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:06,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:12:06,262 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:12:06,262 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:06,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1312231858, now seen corresponding path program 1 times [2020-10-06 01:12:06,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:06,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133746626] [2020-10-06 01:12:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:06,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133746626] [2020-10-06 01:12:06,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:06,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:12:06,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785977522] [2020-10-06 01:12:06,353 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:06,355 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:06,361 INFO L258 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-10-06 01:12:06,361 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:06,383 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13465#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 01:12:06,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:12:06,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:06,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:12:06,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:12:06,384 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 7 states. [2020-10-06 01:12:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:06,441 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-06 01:12:06,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:12:06,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-06 01:12:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:06,443 INFO L225 Difference]: With dead ends: 157 [2020-10-06 01:12:06,443 INFO L226 Difference]: Without dead ends: 97 [2020-10-06 01:12:06,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:12:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-06 01:12:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-06 01:12:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-06 01:12:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-06 01:12:06,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-06 01:12:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:06,447 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-06 01:12:06,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:12:06,448 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-06 01:12:06,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:12:06,448 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:06,448 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] [2020-10-06 01:12:06,448 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:12:06,449 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1503762436, now seen corresponding path program 1 times [2020-10-06 01:12:06,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:06,450 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080944435] [2020-10-06 01:12:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:06,501 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080944435] [2020-10-06 01:12:06,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:06,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:12:06,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363014954] [2020-10-06 01:12:06,502 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:06,505 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:06,523 INFO L258 McrAutomatonBuilder]: Finished intersection with 73 states and 140 transitions. [2020-10-06 01:12:06,523 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:06,598 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:12:06,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:12:06,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:12:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:12:06,600 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 4 states. [2020-10-06 01:12:06,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:06,616 INFO L93 Difference]: Finished difference Result 113 states and 224 transitions. [2020-10-06 01:12:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:12:06,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-06 01:12:06,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:06,618 INFO L225 Difference]: With dead ends: 113 [2020-10-06 01:12:06,618 INFO L226 Difference]: Without dead ends: 47 [2020-10-06 01:12:06,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-10-06 01:12:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-06 01:12:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-06 01:12:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-06 01:12:06,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-06 01:12:06,621 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-06 01:12:06,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:06,621 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-06 01:12:06,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:12:06,621 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-06 01:12:06,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:12:06,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:06,622 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] [2020-10-06 01:12:06,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 01:12:06,622 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:06,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:06,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1669447360, now seen corresponding path program 2 times [2020-10-06 01:12:06,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:06,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52595291] [2020-10-06 01:12:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:12:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 01:12:06,874 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52595291] [2020-10-06 01:12:06,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:12:06,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 01:12:06,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [861846258] [2020-10-06 01:12:06,875 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:12:06,878 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:12:06,891 INFO L258 McrAutomatonBuilder]: Finished intersection with 48 states and 71 transitions. [2020-10-06 01:12:06,891 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:12:06,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-06 01:12:06,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,912 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-06 01:12:06,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:12:06,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:12:06,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,921 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:06,952 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:06,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:06,982 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 01:12:06,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,985 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:06,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:06,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:06,994 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 01:12:06,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,037 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,050 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,057 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,063 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:12:07,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,155 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 3, 2, 1] term [2020-10-06 01:12:07,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,156 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 3, 2, 1] term [2020-10-06 01:12:07,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:07,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:12:07,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,233 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,236 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-06 01:12:07,236 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,238 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,271 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,279 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,286 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,293 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:12:07,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,335 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,407 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:12:07,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,413 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,445 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 01:12:07,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,576 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2020-10-06 01:12:07,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:12:07,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:12:07,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,601 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:12:07,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,622 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:12:07,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,628 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:12:07,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,633 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,637 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:12:07,638 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:12:07,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:12:07,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:12:07,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-06 01:12:07,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:12:07,714 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14020#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0) (<= 0 (div ~y$w_buff0_used~0 256))), 14021#(and (or (= ~y$w_buff0_used~0 0) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff1~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0))] [2020-10-06 01:12:07,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-06 01:12:07,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:12:07,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-06 01:12:07,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-06 01:12:07,715 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 10 states. [2020-10-06 01:12:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:12:07,869 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-06 01:12:07,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:12:07,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-10-06 01:12:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:12:07,871 INFO L225 Difference]: With dead ends: 61 [2020-10-06 01:12:07,871 INFO L226 Difference]: Without dead ends: 35 [2020-10-06 01:12:07,872 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-06 01:12:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-06 01:12:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-06 01:12:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-06 01:12:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-06 01:12:07,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-06 01:12:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:12:07,874 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-06 01:12:07,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-06 01:12:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-06 01:12:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-06 01:12:07,875 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:12:07,875 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] [2020-10-06 01:12:07,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 01:12:07,875 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:12:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:12:07,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1311498048, now seen corresponding path program 3 times [2020-10-06 01:12:07,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:12:07,877 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005001832] [2020-10-06 01:12:07,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:12:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:12:07,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:12:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:12:07,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:12:07,970 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:12:07,971 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:12:07,971 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 01:12:07,972 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:12:07,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L813-->L820: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In1213391683 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In1213391683 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In1213391683 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1213391683 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_In1213391683 ~y$r_buff0_thd0~0_Out1213391683) (or (and (= ~y~0_Out1213391683 ~y$w_buff0~0_In1213391683) .cse0 .cse1) (and .cse2 (or (and .cse3 (= ~y~0_Out1213391683 ~y~0_In1213391683)) (and (= ~y~0_Out1213391683 ~y$w_buff1~0_In1213391683) .cse4 .cse5)))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1213391683 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1213391683|) (= ~y$r_buff1_thd0~0_Out1213391683 ~y$r_buff1_thd0~0_In1213391683) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1213391683 0)) (or (and (= ~y$w_buff1_used~0_Out1213391683 ~y$w_buff1_used~0_In1213391683) .cse3) (and (= ~y$w_buff1_used~0_Out1213391683 0) .cse4 .cse5)) (or (and .cse0 (= ~y$w_buff0_used~0_Out1213391683 0) .cse1) (and .cse2 (= ~y$w_buff0_used~0_Out1213391683 ~y$w_buff0_used~0_In1213391683)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1213391683|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1213391683, ~y$w_buff1~0=~y$w_buff1~0_In1213391683, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1213391683, ~y$w_buff0~0=~y$w_buff0~0_In1213391683, ~y~0=~y~0_In1213391683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1213391683, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1213391683} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1213391683, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1213391683|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1213391683|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1213391683|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1213391683|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1213391683|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1213391683|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1213391683|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1213391683, ~y$w_buff1~0=~y$w_buff1~0_In1213391683, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1213391683, ~y$w_buff0~0=~y$w_buff0~0_In1213391683, ~y~0=~y~0_Out1213391683, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1213391683, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1213391683} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 01:12:07,987 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,988 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,989 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,989 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,989 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,990 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,990 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,990 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,991 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,991 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,991 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,992 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,992 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,992 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,992 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,993 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,993 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,993 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,994 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,994 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,995 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,995 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,996 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,996 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,997 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,997 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:07,998 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:12:07,998 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:12:08,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:12:08 BasicIcfg [2020-10-06 01:12:08,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:12:08,051 INFO L168 Benchmark]: Toolchain (without parser) took 17023.70 ms. Allocated memory was 138.9 MB in the beginning and 411.0 MB in the end (delta: 272.1 MB). Free memory was 100.2 MB in the beginning and 233.8 MB in the end (delta: -133.6 MB). Peak memory consumption was 138.5 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,052 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.84 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 156.0 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.58 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,053 INFO L168 Benchmark]: Boogie Preprocessor took 42.34 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,054 INFO L168 Benchmark]: RCFGBuilder took 2138.98 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 150.7 MB in the beginning and 191.8 MB in the end (delta: -41.1 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,055 INFO L168 Benchmark]: TraceAbstraction took 13893.49 ms. Allocated memory was 248.5 MB in the beginning and 411.0 MB in the end (delta: 162.5 MB). Free memory was 189.9 MB in the beginning and 233.8 MB in the end (delta: -43.8 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. [2020-10-06 01:12:08,059 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 871.84 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.0 MB in the beginning and 156.0 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.58 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 152.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.34 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2138.98 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 150.7 MB in the beginning and 191.8 MB in the end (delta: -41.1 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13893.49 ms. Allocated memory was 248.5 MB in the beginning and 411.0 MB in the end (delta: 162.5 MB). Free memory was 189.9 MB in the beginning and 233.8 MB in the end (delta: -43.8 MB). Peak memory consumption was 118.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.0s, 99 ProgramPointsBefore, 35 ProgramPointsAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 787 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 3990 CheckedPairsTotal, 77 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2528; [L805] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t2529; [L807] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 0 pthread_t t2530; [L809] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L826] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L829] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L829] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L831] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L832] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 288 SDtfs, 257 SDslu, 426 SDs, 0 SdLazy, 226 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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, 13 MinimizatonAttempts, 41 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 14895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...