/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/mix027_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:10:02,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:10:02,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:10:02,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:10:02,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:10:02,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:10:02,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:10:02,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:10:02,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:10:02,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:10:02,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:10:02,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:10:02,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:10:02,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:10:02,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:10:02,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:10:02,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:10:02,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:10:02,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:10:02,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:10:02,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:10:02,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:10:02,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:10:02,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:10:02,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:10:02,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:10:02,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:10:02,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:10:02,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:10:02,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:10:02,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:10:02,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:10:02,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:10:02,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:10:02,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:10:02,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:10:02,707 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:10:02,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:10:02,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:10:02,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:10:02,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:10:02,715 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-22 00:10:02,747 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:10:02,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:10:02,749 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:10:02,749 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:10:02,749 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:10:02,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:10:02,750 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:10:02,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:10:02,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:10:02,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:10:02,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:10:02,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:10:02,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:10:02,753 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:10:02,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:10:02,753 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:10:02,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:10:02,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:10:02,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:10:02,754 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:10:02,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:10:02,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:10:02,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:10:02,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:10:02,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:10:02,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:10:02,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:10:02,755 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:10:02,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:10:02,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:10:02,756 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:10:03,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:10:03,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:10:03,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:10:03,051 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:10:03,052 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:10:03,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2020-10-22 00:10:03,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e6e167/936178eb6d4648c18359d402d4fb37ff/FLAG6e69c8312 [2020-10-22 00:10:03,577 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:10:03,577 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.opt.i [2020-10-22 00:10:03,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e6e167/936178eb6d4648c18359d402d4fb37ff/FLAG6e69c8312 [2020-10-22 00:10:03,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d0e6e167/936178eb6d4648c18359d402d4fb37ff [2020-10-22 00:10:03,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:10:03,947 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:10:03,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:10:03,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:10:03,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:10:03,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:10:03" (1/1) ... [2020-10-22 00:10:03,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583129f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:03, skipping insertion in model container [2020-10-22 00:10:03,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:10:03" (1/1) ... [2020-10-22 00:10:03,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:10:04,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:10:04,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:10:04,656 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:10:04,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:10:04,792 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:10:04,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04 WrapperNode [2020-10-22 00:10:04,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:10:04,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:10:04,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:10:04,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:10:04,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,857 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:10:04,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:10:04,858 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:10:04,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:10:04,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,873 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (1/1) ... [2020-10-22 00:10:04,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:10:04,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:10:04,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:10:04,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:10:04,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (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-22 00:10:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:10:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:10:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:10:04,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:10:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:10:04,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:10:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:10:04,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:10:04,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:10:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:10:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-22 00:10:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-22 00:10:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:10:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:10:04,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:10:04,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:10:04,982 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:10:07,240 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:10:07,241 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:10:07,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:10:07 BoogieIcfgContainer [2020-10-22 00:10:07,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:10:07,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:10:07,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:10:07,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:10:07,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:10:03" (1/3) ... [2020-10-22 00:10:07,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c3be13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:10:07, skipping insertion in model container [2020-10-22 00:10:07,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:10:04" (2/3) ... [2020-10-22 00:10:07,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c3be13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:10:07, skipping insertion in model container [2020-10-22 00:10:07,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:10:07" (3/3) ... [2020-10-22 00:10:07,252 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.opt.i [2020-10-22 00:10:07,263 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:10:07,264 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:10:07,272 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:10:07,273 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:10:07,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,305 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,307 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,309 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,310 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,315 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,315 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,316 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,318 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,318 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,320 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,326 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,328 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,331 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,332 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,333 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,336 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:10:07,338 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:10:07,352 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-22 00:10:07,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:10:07,372 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:10:07,373 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:10:07,373 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:10:07,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:10:07,373 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:10:07,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:10:07,373 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:10:07,388 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:10:07,389 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 00:10:07,391 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 121 transitions, 262 flow [2020-10-22 00:10:07,393 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 131 places, 121 transitions, 262 flow [2020-10-22 00:10:07,448 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-22 00:10:07,448 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:10:07,453 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-10-22 00:10:07,460 INFO L116 LiptonReduction]: Number of co-enabled transitions 3006 [2020-10-22 00:10:08,028 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:10:09,564 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-22 00:10:09,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-22 00:10:09,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:10:09,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-22 00:10:09,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:10:10,847 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-22 00:10:12,330 WARN L193 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-22 00:10:12,627 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:10:13,540 WARN L193 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-22 00:10:13,853 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-22 00:10:14,490 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2020-10-22 00:10:15,027 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-10-22 00:10:15,179 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-22 00:10:15,322 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-22 00:10:15,920 WARN L193 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 122 [2020-10-22 00:10:16,145 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 00:10:16,157 INFO L131 LiptonReduction]: Checked pairs total: 9213 [2020-10-22 00:10:16,158 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-10-22 00:10:16,164 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-22 00:10:16,531 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-22 00:10:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-22 00:10:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:10:16,546 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:16,547 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:10:16,548 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:16,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:16,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1198314430, now seen corresponding path program 1 times [2020-10-22 00:10:16,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:16,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468073156] [2020-10-22 00:10:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:16,843 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-22 00:10:16,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468073156] [2020-10-22 00:10:16,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:16,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:10:16,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2030903485] [2020-10-22 00:10:16,847 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:16,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:16,868 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:10:16,870 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:16,874 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:16,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:10:16,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:10:16,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:16,896 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-22 00:10:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:17,056 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-22 00:10:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:10:17,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:10:17,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:17,110 INFO L225 Difference]: With dead ends: 4062 [2020-10-22 00:10:17,110 INFO L226 Difference]: Without dead ends: 3312 [2020-10-22 00:10:17,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:17,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-22 00:10:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-22 00:10:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-22 00:10:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-22 00:10:17,327 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-10-22 00:10:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:17,327 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-22 00:10:17,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:10:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-22 00:10:17,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:10:17,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:17,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:17,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:10:17,332 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -833643970, now seen corresponding path program 1 times [2020-10-22 00:10:17,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:17,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297349108] [2020-10-22 00:10:17,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:17,442 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-22 00:10:17,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297349108] [2020-10-22 00:10:17,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:17,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:10:17,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611904653] [2020-10-22 00:10:17,443 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:17,445 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:17,448 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 00:10:17,448 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:17,449 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:17,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:10:17,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:10:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:17,451 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-22 00:10:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:17,496 INFO L93 Difference]: Finished difference Result 3262 states and 12720 transitions. [2020-10-22 00:10:17,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:10:17,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 00:10:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:17,528 INFO L225 Difference]: With dead ends: 3262 [2020-10-22 00:10:17,528 INFO L226 Difference]: Without dead ends: 3262 [2020-10-22 00:10:17,529 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2020-10-22 00:10:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3262. [2020-10-22 00:10:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3262 states. [2020-10-22 00:10:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3262 states to 3262 states and 12720 transitions. [2020-10-22 00:10:17,653 INFO L78 Accepts]: Start accepts. Automaton has 3262 states and 12720 transitions. Word has length 11 [2020-10-22 00:10:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:17,655 INFO L481 AbstractCegarLoop]: Abstraction has 3262 states and 12720 transitions. [2020-10-22 00:10:17,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:10:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3262 states and 12720 transitions. [2020-10-22 00:10:17,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:10:17,659 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:17,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:17,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:10:17,659 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -74427126, now seen corresponding path program 1 times [2020-10-22 00:10:17,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:17,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839100168] [2020-10-22 00:10:17,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:17,753 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-22 00:10:17,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839100168] [2020-10-22 00:10:17,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:17,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:10:17,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933248391] [2020-10-22 00:10:17,755 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:17,756 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:17,759 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 16 transitions. [2020-10-22 00:10:17,759 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:17,810 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:17,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:10:17,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:10:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:17,812 INFO L87 Difference]: Start difference. First operand 3262 states and 12720 transitions. Second operand 3 states. [2020-10-22 00:10:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:17,968 INFO L93 Difference]: Finished difference Result 3206 states and 12462 transitions. [2020-10-22 00:10:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:10:17,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 00:10:17,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:17,999 INFO L225 Difference]: With dead ends: 3206 [2020-10-22 00:10:17,999 INFO L226 Difference]: Without dead ends: 3206 [2020-10-22 00:10:18,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 00:10:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3206 states. [2020-10-22 00:10:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3206 to 3206. [2020-10-22 00:10:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2020-10-22 00:10:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 12462 transitions. [2020-10-22 00:10:18,122 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 12462 transitions. Word has length 12 [2020-10-22 00:10:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:18,122 INFO L481 AbstractCegarLoop]: Abstraction has 3206 states and 12462 transitions. [2020-10-22 00:10:18,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:10:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 12462 transitions. [2020-10-22 00:10:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:10:18,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:18,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:18,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:10:18,128 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1509693860, now seen corresponding path program 1 times [2020-10-22 00:10:18,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:18,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191932230] [2020-10-22 00:10:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:18,257 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-22 00:10:18,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191932230] [2020-10-22 00:10:18,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:18,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:18,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566368840] [2020-10-22 00:10:18,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:18,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:18,265 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-22 00:10:18,265 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:18,602 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:18,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:10:18,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:10:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:18,603 INFO L87 Difference]: Start difference. First operand 3206 states and 12462 transitions. Second operand 5 states. [2020-10-22 00:10:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:18,760 INFO L93 Difference]: Finished difference Result 3254 states and 12638 transitions. [2020-10-22 00:10:18,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:10:18,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:10:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:18,791 INFO L225 Difference]: With dead ends: 3254 [2020-10-22 00:10:18,792 INFO L226 Difference]: Without dead ends: 3254 [2020-10-22 00:10:18,792 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:10:18,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3254 states. [2020-10-22 00:10:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3254 to 3254. [2020-10-22 00:10:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3254 states. [2020-10-22 00:10:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3254 states to 3254 states and 12638 transitions. [2020-10-22 00:10:18,907 INFO L78 Accepts]: Start accepts. Automaton has 3254 states and 12638 transitions. Word has length 13 [2020-10-22 00:10:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:18,907 INFO L481 AbstractCegarLoop]: Abstraction has 3254 states and 12638 transitions. [2020-10-22 00:10:18,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:10:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3254 states and 12638 transitions. [2020-10-22 00:10:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:10:18,910 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:18,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:18,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:10:18,911 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash -970382897, now seen corresponding path program 1 times [2020-10-22 00:10:18,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:18,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259564712] [2020-10-22 00:10:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:18,958 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-22 00:10:18,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259564712] [2020-10-22 00:10:18,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:18,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:10:18,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1715090060] [2020-10-22 00:10:18,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:18,961 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:18,969 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 56 transitions. [2020-10-22 00:10:18,969 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:19,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:19,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:10:19,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:10:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:10:19,211 INFO L87 Difference]: Start difference. First operand 3254 states and 12638 transitions. Second operand 3 states. [2020-10-22 00:10:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:19,244 INFO L93 Difference]: Finished difference Result 3086 states and 11924 transitions. [2020-10-22 00:10:19,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:10:19,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-22 00:10:19,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:19,264 INFO L225 Difference]: With dead ends: 3086 [2020-10-22 00:10:19,265 INFO L226 Difference]: Without dead ends: 3086 [2020-10-22 00:10:19,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-22 00:10:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2020-10-22 00:10:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3022. [2020-10-22 00:10:19,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-22 00:10:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-22 00:10:19,474 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 14 [2020-10-22 00:10:19,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:19,474 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-22 00:10:19,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:10:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-22 00:10:19,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:10:19,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:19,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:19,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:10:19,478 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash -447066724, now seen corresponding path program 1 times [2020-10-22 00:10:19,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:19,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013245012] [2020-10-22 00:10:19,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:19,577 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-22 00:10:19,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013245012] [2020-10-22 00:10:19,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:19,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:19,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354701392] [2020-10-22 00:10:19,578 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:19,581 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:19,585 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 42 transitions. [2020-10-22 00:10:19,585 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:19,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:19,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:10:19,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:19,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:10:19,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:19,968 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 5 states. [2020-10-22 00:10:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:20,108 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions. [2020-10-22 00:10:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:10:20,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:10:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:20,125 INFO L225 Difference]: With dead ends: 3230 [2020-10-22 00:10:20,125 INFO L226 Difference]: Without dead ends: 3230 [2020-10-22 00:10:20,126 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:10:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2020-10-22 00:10:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2020-10-22 00:10:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-10-22 00:10:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions. [2020-10-22 00:10:20,247 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14 [2020-10-22 00:10:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:20,248 INFO L481 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions. [2020-10-22 00:10:20,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:10:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions. [2020-10-22 00:10:20,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:10:20,251 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:20,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:20,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:10:20,252 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:20,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:20,252 INFO L82 PathProgramCache]: Analyzing trace with hash -20034863, now seen corresponding path program 1 times [2020-10-22 00:10:20,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:20,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499497922] [2020-10-22 00:10:20,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:20,383 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-22 00:10:20,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499497922] [2020-10-22 00:10:20,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:20,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:20,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2047415152] [2020-10-22 00:10:20,384 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:20,386 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:20,392 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 71 transitions. [2020-10-22 00:10:20,392 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:20,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:20,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:10:20,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:20,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:10:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:20,860 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states. [2020-10-22 00:10:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:20,962 INFO L93 Difference]: Finished difference Result 3240 states and 12508 transitions. [2020-10-22 00:10:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:10:20,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 00:10:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:20,985 INFO L225 Difference]: With dead ends: 3240 [2020-10-22 00:10:20,985 INFO L226 Difference]: Without dead ends: 3240 [2020-10-22 00:10:20,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:21,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2020-10-22 00:10:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3170. [2020-10-22 00:10:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2020-10-22 00:10:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions. [2020-10-22 00:10:21,200 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 15 [2020-10-22 00:10:21,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:21,200 INFO L481 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions. [2020-10-22 00:10:21,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:10:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions. [2020-10-22 00:10:21,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:10:21,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:21,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:21,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:10:21,205 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1827863841, now seen corresponding path program 1 times [2020-10-22 00:10:21,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:21,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930040009] [2020-10-22 00:10:21,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:21,290 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-22 00:10:21,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930040009] [2020-10-22 00:10:21,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:21,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:10:21,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520285618] [2020-10-22 00:10:21,291 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:21,294 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:21,305 INFO L252 McrAutomatonBuilder]: Finished intersection with 72 states and 154 transitions. [2020-10-22 00:10:21,306 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:22,692 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [78167#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256))))] [2020-10-22 00:10:22,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:10:22,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:22,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:10:22,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:22,693 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 7 states. [2020-10-22 00:10:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:22,813 INFO L93 Difference]: Finished difference Result 3604 states and 13842 transitions. [2020-10-22 00:10:22,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:10:22,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-22 00:10:22,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:22,833 INFO L225 Difference]: With dead ends: 3604 [2020-10-22 00:10:22,833 INFO L226 Difference]: Without dead ends: 3604 [2020-10-22 00:10:22,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:22,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2020-10-22 00:10:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 3536. [2020-10-22 00:10:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3536 states. [2020-10-22 00:10:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 13626 transitions. [2020-10-22 00:10:22,952 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 13626 transitions. Word has length 16 [2020-10-22 00:10:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:22,953 INFO L481 AbstractCegarLoop]: Abstraction has 3536 states and 13626 transitions. [2020-10-22 00:10:22,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:10:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 13626 transitions. [2020-10-22 00:10:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:10:22,958 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:22,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:22,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:10:22,959 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -227365157, now seen corresponding path program 1 times [2020-10-22 00:10:22,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:22,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851442840] [2020-10-22 00:10:22,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:10:23,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851442840] [2020-10-22 00:10:23,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:23,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:23,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070427608] [2020-10-22 00:10:23,050 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:23,052 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:23,059 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 49 transitions. [2020-10-22 00:10:23,059 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:23,090 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:10:23,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:10:23,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,106 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:10:23,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,136 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:10:23,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,149 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,152 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,157 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,164 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,173 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,176 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,205 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,632 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,640 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,642 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,664 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:10:23,667 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 00:10:23,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,682 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:10:23,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,700 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,716 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,717 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,735 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,745 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:10:23,746 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:10:23,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,761 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:10:23,761 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:10:23,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,792 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 00:10:23,796 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 00:10:23,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,853 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,865 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 00:10:23,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,889 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:10:23,895 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,896 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,905 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:10:23,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:10:23,915 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,932 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:10:23,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,933 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:10:23,938 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,943 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,962 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,964 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,968 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:23,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:10:23,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,985 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:10:23,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:23,986 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:23,987 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,988 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:10:23,997 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:10:24,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:24,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,009 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 00:10:24,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,040 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-22 00:10:24,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:24,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,060 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-22 00:10:24,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:10:24,596 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [88849#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0) (= (mod ~x$r_buff0_thd4~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0)), 88850#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= (mod ~x$r_buff0_thd4~0 256) 0))] [2020-10-22 00:10:24,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:10:24,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:10:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:24,598 INFO L87 Difference]: Start difference. First operand 3536 states and 13626 transitions. Second operand 7 states. [2020-10-22 00:10:24,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:24,684 INFO L93 Difference]: Finished difference Result 3512 states and 13518 transitions. [2020-10-22 00:10:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:10:24,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-22 00:10:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:24,699 INFO L225 Difference]: With dead ends: 3512 [2020-10-22 00:10:24,700 INFO L226 Difference]: Without dead ends: 3512 [2020-10-22 00:10:24,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3512 states. [2020-10-22 00:10:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3440. [2020-10-22 00:10:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3440 states. [2020-10-22 00:10:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 13218 transitions. [2020-10-22 00:10:24,814 INFO L78 Accepts]: Start accepts. Automaton has 3440 states and 13218 transitions. Word has length 16 [2020-10-22 00:10:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:24,814 INFO L481 AbstractCegarLoop]: Abstraction has 3440 states and 13218 transitions. [2020-10-22 00:10:24,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:10:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3440 states and 13218 transitions. [2020-10-22 00:10:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:10:24,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:24,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:24,820 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:10:24,821 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:24,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:24,821 INFO L82 PathProgramCache]: Analyzing trace with hash -238435877, now seen corresponding path program 1 times [2020-10-22 00:10:24,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:24,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822031644] [2020-10-22 00:10:24,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:24,938 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-22 00:10:24,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822031644] [2020-10-22 00:10:24,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:24,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:24,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1938047692] [2020-10-22 00:10:24,940 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:24,943 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:24,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 84 transitions. [2020-10-22 00:10:24,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:25,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:25,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:25,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:10:25,552 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [99247#(not (= 4 ~__unbuffered_cnt~0))] [2020-10-22 00:10:25,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:10:25,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:10:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:25,554 INFO L87 Difference]: Start difference. First operand 3440 states and 13218 transitions. Second operand 5 states. [2020-10-22 00:10:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:25,652 INFO L93 Difference]: Finished difference Result 2564 states and 8926 transitions. [2020-10-22 00:10:25,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:10:25,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-22 00:10:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:25,662 INFO L225 Difference]: With dead ends: 2564 [2020-10-22 00:10:25,662 INFO L226 Difference]: Without dead ends: 1652 [2020-10-22 00:10:25,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2020-10-22 00:10:25,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1510. [2020-10-22 00:10:25,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2020-10-22 00:10:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 4709 transitions. [2020-10-22 00:10:25,788 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 4709 transitions. Word has length 16 [2020-10-22 00:10:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:25,791 INFO L481 AbstractCegarLoop]: Abstraction has 1510 states and 4709 transitions. [2020-10-22 00:10:25,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:10:25,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 4709 transitions. [2020-10-22 00:10:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:10:25,795 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:25,795 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-22 00:10:25,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:10:25,796 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 379995694, now seen corresponding path program 1 times [2020-10-22 00:10:25,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:25,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258534800] [2020-10-22 00:10:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:25,933 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-22 00:10:25,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258534800] [2020-10-22 00:10:25,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:25,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:10:25,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1753306392] [2020-10-22 00:10:25,935 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:25,938 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:25,948 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 54 transitions. [2020-10-22 00:10:25,948 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:26,167 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [104842#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:10:26,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:10:26,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:26,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:10:26,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:26,169 INFO L87 Difference]: Start difference. First operand 1510 states and 4709 transitions. Second operand 7 states. [2020-10-22 00:10:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:26,246 INFO L93 Difference]: Finished difference Result 1331 states and 4133 transitions. [2020-10-22 00:10:26,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:10:26,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-22 00:10:26,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:26,251 INFO L225 Difference]: With dead ends: 1331 [2020-10-22 00:10:26,251 INFO L226 Difference]: Without dead ends: 1187 [2020-10-22 00:10:26,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:10:26,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-10-22 00:10:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1123. [2020-10-22 00:10:26,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2020-10-22 00:10:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 3548 transitions. [2020-10-22 00:10:26,281 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 3548 transitions. Word has length 20 [2020-10-22 00:10:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:26,282 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 3548 transitions. [2020-10-22 00:10:26,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:10:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 3548 transitions. [2020-10-22 00:10:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 00:10:26,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:26,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:26,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:10:26,285 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:26,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:26,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1783621777, now seen corresponding path program 1 times [2020-10-22 00:10:26,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:26,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357281945] [2020-10-22 00:10:26,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:26,362 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-22 00:10:26,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357281945] [2020-10-22 00:10:26,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:26,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:26,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311653190] [2020-10-22 00:10:26,364 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:26,368 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:26,399 INFO L252 McrAutomatonBuilder]: Finished intersection with 96 states and 181 transitions. [2020-10-22 00:10:26,399 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:27,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:27,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:10:27,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:27,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:10:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:10:27,672 INFO L87 Difference]: Start difference. First operand 1123 states and 3548 transitions. Second operand 4 states. [2020-10-22 00:10:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:27,715 INFO L93 Difference]: Finished difference Result 1464 states and 4533 transitions. [2020-10-22 00:10:27,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:10:27,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-22 00:10:27,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:27,721 INFO L225 Difference]: With dead ends: 1464 [2020-10-22 00:10:27,721 INFO L226 Difference]: Without dead ends: 1126 [2020-10-22 00:10:27,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-22 00:10:27,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2020-10-22 00:10:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1123. [2020-10-22 00:10:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1123 states. [2020-10-22 00:10:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 3446 transitions. [2020-10-22 00:10:27,761 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 3446 transitions. Word has length 24 [2020-10-22 00:10:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:27,762 INFO L481 AbstractCegarLoop]: Abstraction has 1123 states and 3446 transitions. [2020-10-22 00:10:27,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:10:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 3446 transitions. [2020-10-22 00:10:27,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 00:10:27,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:27,767 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:27,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:10:27,767 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:27,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1097414211, now seen corresponding path program 1 times [2020-10-22 00:10:27,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:27,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780013671] [2020-10-22 00:10:27,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:27,915 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-22 00:10:27,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780013671] [2020-10-22 00:10:27,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:27,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:10:27,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [235129156] [2020-10-22 00:10:27,918 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:27,926 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:27,972 INFO L252 McrAutomatonBuilder]: Finished intersection with 93 states and 177 transitions. [2020-10-22 00:10:27,973 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:29,416 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [112144#(and (= ~y~0 1) (= 0 ~x$w_buff0~0))] [2020-10-22 00:10:29,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:10:29,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:10:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:10:29,418 INFO L87 Difference]: Start difference. First operand 1123 states and 3446 transitions. Second operand 7 states. [2020-10-22 00:10:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:29,658 INFO L93 Difference]: Finished difference Result 1646 states and 4964 transitions. [2020-10-22 00:10:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:10:29,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-22 00:10:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:29,665 INFO L225 Difference]: With dead ends: 1646 [2020-10-22 00:10:29,665 INFO L226 Difference]: Without dead ends: 966 [2020-10-22 00:10:29,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:10:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2020-10-22 00:10:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 963. [2020-10-22 00:10:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-10-22 00:10:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2756 transitions. [2020-10-22 00:10:29,696 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2756 transitions. Word has length 24 [2020-10-22 00:10:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:29,697 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 2756 transitions. [2020-10-22 00:10:29,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:10:29,697 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2756 transitions. [2020-10-22 00:10:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-22 00:10:29,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:29,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:29,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:10:29,702 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:29,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:29,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1187502413, now seen corresponding path program 2 times [2020-10-22 00:10:29,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:29,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52719032] [2020-10-22 00:10:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:29,841 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-22 00:10:29,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52719032] [2020-10-22 00:10:29,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:29,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:10:29,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [252322659] [2020-10-22 00:10:29,843 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:29,851 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:29,876 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 77 transitions. [2020-10-22 00:10:29,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:30,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [115730#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:10:30,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:10:30,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:30,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:10:30,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:10:30,386 INFO L87 Difference]: Start difference. First operand 963 states and 2756 transitions. Second operand 8 states. [2020-10-22 00:10:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:30,493 INFO L93 Difference]: Finished difference Result 932 states and 2694 transitions. [2020-10-22 00:10:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:10:30,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-10-22 00:10:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:30,496 INFO L225 Difference]: With dead ends: 932 [2020-10-22 00:10:30,496 INFO L226 Difference]: Without dead ends: 365 [2020-10-22 00:10:30,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:10:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-10-22 00:10:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 357. [2020-10-22 00:10:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-10-22 00:10:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 964 transitions. [2020-10-22 00:10:30,512 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 964 transitions. Word has length 24 [2020-10-22 00:10:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:30,512 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 964 transitions. [2020-10-22 00:10:30,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:10:30,513 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 964 transitions. [2020-10-22 00:10:30,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-22 00:10:30,517 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:30,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:30,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:10:30,518 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:30,518 INFO L82 PathProgramCache]: Analyzing trace with hash 96302780, now seen corresponding path program 1 times [2020-10-22 00:10:30,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:30,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205275611] [2020-10-22 00:10:30,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:10:30,656 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-22 00:10:30,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205275611] [2020-10-22 00:10:30,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:10:30,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:10:30,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559698705] [2020-10-22 00:10:30,658 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:10:30,664 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:10:30,703 INFO L252 McrAutomatonBuilder]: Finished intersection with 81 states and 134 transitions. [2020-10-22 00:10:30,704 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:10:31,609 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:10:31,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:10:31,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:10:31,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:10:31,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:10:31,610 INFO L87 Difference]: Start difference. First operand 357 states and 964 transitions. Second operand 5 states. [2020-10-22 00:10:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:10:31,688 INFO L93 Difference]: Finished difference Result 512 states and 1386 transitions. [2020-10-22 00:10:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:10:31,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2020-10-22 00:10:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:10:31,690 INFO L225 Difference]: With dead ends: 512 [2020-10-22 00:10:31,690 INFO L226 Difference]: Without dead ends: 221 [2020-10-22 00:10:31,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:10:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-22 00:10:31,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-10-22 00:10:31,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-22 00:10:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 560 transitions. [2020-10-22 00:10:31,698 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 560 transitions. Word has length 28 [2020-10-22 00:10:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:10:31,699 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 560 transitions. [2020-10-22 00:10:31,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:10:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 560 transitions. [2020-10-22 00:10:31,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-22 00:10:31,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:10:31,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:10:31,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:10:31,701 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:10:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:10:31,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1955985784, now seen corresponding path program 2 times [2020-10-22 00:10:31,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:10:31,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814550506] [2020-10-22 00:10:31,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:10:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:10:31,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:10:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:10:31,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:10:31,901 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:10:31,903 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:10:31,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:10:31,905 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:10:31,940 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1198] [1198] L3-->L869: Formula: (let ((.cse7 (= (mod ~x$r_buff0_thd0~0_In-1516611898 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In-1516611898 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In-1516611898 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In-1516611898 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse3 (or .cse6 .cse7))) (and (or (and .cse0 (= ~x$w_buff1_used~0_Out-1516611898 0) .cse1) (and (= ~x$w_buff1_used~0_In-1516611898 ~x$w_buff1_used~0_Out-1516611898) .cse2)) (= ~x$r_buff0_thd0~0_Out-1516611898 ~x$r_buff0_thd0~0_In-1516611898) (or (and (or (and (= ~x~0_Out-1516611898 ~x$w_buff1~0_In-1516611898) .cse0 .cse1) (and (= ~x~0_In-1516611898 ~x~0_Out-1516611898) .cse2)) .cse3) (and .cse4 (= ~x$w_buff0~0_In-1516611898 ~x~0_Out-1516611898) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1516611898 0)) (= ~x$r_buff1_thd0~0_In-1516611898 ~x$r_buff1_thd0~0_Out-1516611898) (or (and (= ~x$w_buff0_used~0_Out-1516611898 0) .cse4 .cse5) (and .cse3 (= ~x$w_buff0_used~0_Out-1516611898 ~x$w_buff0_used~0_In-1516611898)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1516611898, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1516611898, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1516611898, ~x$w_buff1~0=~x$w_buff1~0_In-1516611898, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1516611898, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1516611898, ~x~0=~x~0_In-1516611898, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1516611898} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1516611898, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1516611898, ~x$w_buff1~0=~x$w_buff1~0_In-1516611898, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-1516611898|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1516611898, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1516611898|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1516611898|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1516611898|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1516611898, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-1516611898|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1516611898, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1516611898|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1516611898, ~x~0=~x~0_Out-1516611898} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~x$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-22 00:10:31,951 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-22 00:10:31,951 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [769] [2020-10-22 00:10:31,955 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-22 00:10:31,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,956 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-22 00:10:31,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,956 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-22 00:10:31,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,956 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-22 00:10:31,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,957 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-22 00:10:31,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,957 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-22 00:10:31,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,959 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-22 00:10:31,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,959 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-22 00:10:31,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,959 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-22 00:10:31,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,959 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-22 00:10:31,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,960 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-22 00:10:31,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,960 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-22 00:10:31,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,961 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-22 00:10:31,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,961 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-22 00:10:31,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,961 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-22 00:10:31,961 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,961 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-22 00:10:31,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,962 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-22 00:10:31,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,962 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-22 00:10:31,962 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,967 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-22 00:10:31,967 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,967 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-22 00:10:31,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,968 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-22 00:10:31,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,968 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-22 00:10:31,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,968 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-22 00:10:31,968 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,969 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-22 00:10:31,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,969 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-22 00:10:31,969 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,970 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-22 00:10:31,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,970 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-22 00:10:31,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,970 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-22 00:10:31,970 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,970 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-22 00:10:31,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,971 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-22 00:10:31,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,971 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-22 00:10:31,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:31,971 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-22 00:10:31,971 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:10:32,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:10:32 BasicIcfg [2020-10-22 00:10:32,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:10:32,099 INFO L168 Benchmark]: Toolchain (without parser) took 28155.88 ms. Allocated memory was 141.0 MB in the beginning and 708.8 MB in the end (delta: 567.8 MB). Free memory was 102.2 MB in the beginning and 632.7 MB in the end (delta: -530.5 MB). Peak memory consumption was 447.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,099 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 845.13 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 153.2 MB in the end (delta: -51.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.06 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 149.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,101 INFO L168 Benchmark]: Boogie Preprocessor took 41.92 ms. Allocated memory is still 203.9 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,102 INFO L168 Benchmark]: RCFGBuilder took 2343.83 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 147.1 MB in the beginning and 126.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 95.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,103 INFO L168 Benchmark]: TraceAbstraction took 24852.50 ms. Allocated memory was 246.4 MB in the beginning and 708.8 MB in the end (delta: 462.4 MB). Free memory was 125.1 MB in the beginning and 632.7 MB in the end (delta: -507.6 MB). Peak memory consumption was 365.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:10:32,106 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 845.13 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 101.3 MB in the beginning and 153.2 MB in the end (delta: -51.8 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.06 ms. Allocated memory is still 203.9 MB. Free memory was 153.2 MB in the beginning and 149.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.92 ms. Allocated memory is still 203.9 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2343.83 ms. Allocated memory was 203.9 MB in the beginning and 246.4 MB in the end (delta: 42.5 MB). Free memory was 147.1 MB in the beginning and 126.9 MB in the end (delta: 20.2 MB). Peak memory consumption was 95.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24852.50 ms. Allocated memory was 246.4 MB in the beginning and 708.8 MB in the end (delta: 462.4 MB). Free memory was 125.1 MB in the beginning and 632.7 MB in the end (delta: -507.6 MB). Peak memory consumption was 365.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1550 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 123 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 131 PlacesBefore, 47 PlacesAfterwards, 121 TransitionsBefore, 34 TransitionsAfterwards, 3006 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 104 TotalNumberOfCompositions, 9213 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t741; [L852] FCALL, FORK 0 pthread_create(&t741, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t742; [L854] FCALL, FORK 0 pthread_create(&t742, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t743; [L856] FCALL, FORK 0 pthread_create(&t743, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t744; [L858] FCALL, FORK 0 pthread_create(&t744, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix027_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.5s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 485 SDtfs, 618 SDslu, 842 SDs, 0 SdLazy, 413 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 360 SyntacticMatches, 27 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 494 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 28292 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...