/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 00:35:30,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 00:35:30,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 00:35:30,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 00:35:30,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 00:35:30,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 00:35:30,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 00:35:30,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 00:35:30,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 00:35:30,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 00:35:30,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 00:35:30,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 00:35:30,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 00:35:30,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 00:35:30,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 00:35:30,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 00:35:30,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 00:35:30,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 00:35:30,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 00:35:30,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 00:35:30,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 00:35:30,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 00:35:30,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 00:35:30,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 00:35:30,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 00:35:30,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 00:35:30,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 00:35:30,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 00:35:30,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 00:35:30,859 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 00:35:30,859 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 00:35:30,860 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 00:35:30,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 00:35:30,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 00:35:30,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 00:35:30,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 00:35:30,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 00:35:30,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 00:35:30,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 00:35:30,865 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 00:35:30,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 00:35:30,868 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 00:35:30,908 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 00:35:30,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 00:35:30,910 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 00:35:30,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 00:35:30,910 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 00:35:30,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 00:35:30,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 00:35:30,911 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 00:35:30,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 00:35:30,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 00:35:30,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 00:35:30,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 00:35:30,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 00:35:30,912 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 00:35:30,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 00:35:30,912 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 00:35:30,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 00:35:30,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 00:35:30,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 00:35:30,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 00:35:30,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 00:35:30,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:35:30,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 00:35:30,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 00:35:30,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 00:35:30,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 00:35:30,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 00:35:30,915 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 00:35:30,915 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 00:35:30,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 00:35:30,915 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 00:35:31,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 00:35:31,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 00:35:31,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 00:35:31,217 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 00:35:31,218 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 00:35:31,219 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-06 00:35:31,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11491206/425128cf068b4b1f9bfbaab75e329bba/FLAGf54b15bac [2020-10-06 00:35:31,842 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 00:35:31,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-06 00:35:31,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11491206/425128cf068b4b1f9bfbaab75e329bba/FLAGf54b15bac [2020-10-06 00:35:32,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f11491206/425128cf068b4b1f9bfbaab75e329bba [2020-10-06 00:35:32,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 00:35:32,166 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 00:35:32,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 00:35:32,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 00:35:32,170 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 00:35:32,170 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486300a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32, skipping insertion in model container [2020-10-06 00:35:32,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 00:35:32,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 00:35:32,747 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:35:32,760 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 00:35:32,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 00:35:32,892 INFO L208 MainTranslator]: Completed translation [2020-10-06 00:35:32,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32 WrapperNode [2020-10-06 00:35:32,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 00:35:32,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 00:35:32,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 00:35:32,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 00:35:32,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 00:35:32,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 00:35:32,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 00:35:32,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 00:35:32,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:32,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:33,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... [2020-10-06 00:35:33,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 00:35:33,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 00:35:33,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 00:35:33,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 00:35:33,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 00:35:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 00:35:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 00:35:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 00:35:33,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 00:35:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 00:35:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 00:35:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 00:35:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 00:35:33,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-06 00:35:33,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-06 00:35:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 00:35:33,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 00:35:33,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 00:35:33,076 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 00:35:35,147 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 00:35:35,148 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 00:35:35,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:35:35 BoogieIcfgContainer [2020-10-06 00:35:35,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 00:35:35,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 00:35:35,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 00:35:35,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 00:35:35,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 12:35:32" (1/3) ... [2020-10-06 00:35:35,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6245b67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:35:35, skipping insertion in model container [2020-10-06 00:35:35,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 12:35:32" (2/3) ... [2020-10-06 00:35:35,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6245b67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 12:35:35, skipping insertion in model container [2020-10-06 00:35:35,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 12:35:35" (3/3) ... [2020-10-06 00:35:35,159 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2020-10-06 00:35:35,169 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 00:35:35,169 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 00:35:35,177 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 00:35:35,178 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 00:35:35,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,208 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,209 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,212 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,225 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,230 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,231 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,231 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,235 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,235 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 00:35:35,251 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-06 00:35:35,272 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 00:35:35,272 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 00:35:35,272 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 00:35:35,272 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 00:35:35,273 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 00:35:35,273 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 00:35:35,273 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 00:35:35,273 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 00:35:35,289 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 217 flow [2020-10-06 00:35:35,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-10-06 00:35:35,339 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-10-06 00:35:35,339 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:35:35,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-06 00:35:35,348 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2020-10-06 00:35:35,372 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2020-10-06 00:35:35,372 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 00:35:35,373 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-06 00:35:35,376 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1990 [2020-10-06 00:35:35,377 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 00:35:35,985 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 00:35:37,534 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-06 00:35:37,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-06 00:35:37,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:35:37,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-06 00:35:37,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 00:35:38,352 WARN L193 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-06 00:35:38,788 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-06 00:35:39,972 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-06 00:35:40,469 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 00:35:41,153 WARN L193 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-06 00:35:41,462 WARN L193 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-06 00:35:41,946 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-06 00:35:42,314 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-06 00:35:42,932 WARN L193 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-06 00:35:43,246 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-06 00:35:43,648 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-06 00:35:43,788 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-06 00:35:43,796 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5631 [2020-10-06 00:35:43,796 INFO L214 etLargeBlockEncoding]: Total number of compositions: 83 [2020-10-06 00:35:43,799 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 28 transitions, 71 flow [2020-10-06 00:35:43,869 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states. [2020-10-06 00:35:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states. [2020-10-06 00:35:43,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-06 00:35:43,878 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:43,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-06 00:35:43,880 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1029880774, now seen corresponding path program 1 times [2020-10-06 00:35:43,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:43,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486481298] [2020-10-06 00:35:43,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:44,144 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486481298] [2020-10-06 00:35:44,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:44,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:35:44,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [456291148] [2020-10-06 00:35:44,147 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:44,150 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:44,163 INFO L258 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-06 00:35:44,163 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:44,168 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:35:44,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:35:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,182 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand 3 states. [2020-10-06 00:35:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:44,314 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-10-06 00:35:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:35:44,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-06 00:35:44,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:44,354 INFO L225 Difference]: With dead ends: 972 [2020-10-06 00:35:44,354 INFO L226 Difference]: Without dead ends: 792 [2020-10-06 00:35:44,356 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-06 00:35:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-06 00:35:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-06 00:35:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-10-06 00:35:44,465 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5 [2020-10-06 00:35:44,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:44,465 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-10-06 00:35:44,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:35:44,466 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-10-06 00:35:44,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 00:35:44,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:44,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:44,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 00:35:44,470 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash 380005547, now seen corresponding path program 1 times [2020-10-06 00:35:44,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:44,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344414811] [2020-10-06 00:35:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:44,644 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344414811] [2020-10-06 00:35:44,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:44,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:35:44,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1613923882] [2020-10-06 00:35:44,645 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:44,647 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:44,649 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-06 00:35:44,649 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:44,649 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:44,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:35:44,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:44,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:35:44,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,652 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-10-06 00:35:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:44,668 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-10-06 00:35:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:35:44,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 00:35:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:44,676 INFO L225 Difference]: With dead ends: 732 [2020-10-06 00:35:44,676 INFO L226 Difference]: Without dead ends: 732 [2020-10-06 00:35:44,677 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-06 00:35:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-10-06 00:35:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-10-06 00:35:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-10-06 00:35:44,706 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9 [2020-10-06 00:35:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:44,707 INFO L479 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-10-06 00:35:44,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:35:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-10-06 00:35:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 00:35:44,709 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:44,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:44,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 00:35:44,710 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:44,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash 92237913, now seen corresponding path program 1 times [2020-10-06 00:35:44,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:44,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503877097] [2020-10-06 00:35:44,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:44,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:44,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503877097] [2020-10-06 00:35:44,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:44,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:35:44,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [46888905] [2020-10-06 00:35:44,794 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:44,796 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:44,799 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-06 00:35:44,799 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:44,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:44,871 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:44,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:44,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:44,900 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:44,929 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:44,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:35:44,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:44,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:35:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,930 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-10-06 00:35:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:44,976 INFO L93 Difference]: Finished difference Result 712 states and 2205 transitions. [2020-10-06 00:35:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:35:44,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-06 00:35:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:44,982 INFO L225 Difference]: With dead ends: 712 [2020-10-06 00:35:44,983 INFO L226 Difference]: Without dead ends: 712 [2020-10-06 00:35:44,983 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-10-06 00:35:45,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-10-06 00:35:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-10-06 00:35:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2205 transitions. [2020-10-06 00:35:45,007 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2205 transitions. Word has length 11 [2020-10-06 00:35:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:45,007 INFO L479 AbstractCegarLoop]: Abstraction has 712 states and 2205 transitions. [2020-10-06 00:35:45,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:35:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2205 transitions. [2020-10-06 00:35:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-06 00:35:45,010 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:45,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:45,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 00:35:45,010 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1435592969, now seen corresponding path program 1 times [2020-10-06 00:35:45,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:45,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7457284] [2020-10-06 00:35:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:45,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7457284] [2020-10-06 00:35:45,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:45,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 00:35:45,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1756653375] [2020-10-06 00:35:45,067 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:45,069 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:45,072 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-06 00:35:45,073 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:45,115 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:45,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 00:35:45,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:45,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 00:35:45,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:45,117 INFO L87 Difference]: Start difference. First operand 712 states and 2205 transitions. Second operand 3 states. [2020-10-06 00:35:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:45,132 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-10-06 00:35:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 00:35:45,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-06 00:35:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:45,138 INFO L225 Difference]: With dead ends: 692 [2020-10-06 00:35:45,139 INFO L226 Difference]: Without dead ends: 692 [2020-10-06 00:35:45,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 00:35:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-06 00:35:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-10-06 00:35:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-10-06 00:35:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-10-06 00:35:45,161 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 12 [2020-10-06 00:35:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:45,161 INFO L479 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-10-06 00:35:45,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 00:35:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-10-06 00:35:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-06 00:35:45,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:45,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:45,164 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 00:35:45,164 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:45,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1553710148, now seen corresponding path program 1 times [2020-10-06 00:35:45,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:45,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324588021] [2020-10-06 00:35:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:45,360 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324588021] [2020-10-06 00:35:45,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:45,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:35:45,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1198719637] [2020-10-06 00:35:45,364 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:45,366 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:45,371 INFO L258 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-06 00:35:45,371 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:45,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,439 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:35:45,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,450 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:45,462 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,492 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,497 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,504 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:35:45,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,506 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:45,514 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:45,534 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:45,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:35:45,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:45,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:35:45,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:45,536 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 5 states. [2020-10-06 00:35:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:45,619 INFO L93 Difference]: Finished difference Result 720 states and 2216 transitions. [2020-10-06 00:35:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:35:45,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-06 00:35:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:45,627 INFO L225 Difference]: With dead ends: 720 [2020-10-06 00:35:45,627 INFO L226 Difference]: Without dead ends: 720 [2020-10-06 00:35:45,628 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-10-06 00:35:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2020-10-06 00:35:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2020-10-06 00:35:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 2216 transitions. [2020-10-06 00:35:45,655 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 2216 transitions. Word has length 13 [2020-10-06 00:35:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:45,655 INFO L479 AbstractCegarLoop]: Abstraction has 720 states and 2216 transitions. [2020-10-06 00:35:45,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:35:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 2216 transitions. [2020-10-06 00:35:45,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:35:45,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:45,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:45,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 00:35:45,658 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:45,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:45,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1513096444, now seen corresponding path program 1 times [2020-10-06 00:35:45,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:45,661 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817461017] [2020-10-06 00:35:45,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:45,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817461017] [2020-10-06 00:35:45,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:45,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:35:45,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1392428244] [2020-10-06 00:35:45,868 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:45,872 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:45,881 INFO L258 McrAutomatonBuilder]: Finished intersection with 42 states and 71 transitions. [2020-10-06 00:35:45,882 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:45,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,990 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:45,991 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:45,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,042 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:46,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 00:35:46,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:46,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 00:35:46,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:35:46,043 INFO L87 Difference]: Start difference. First operand 720 states and 2216 transitions. Second operand 6 states. [2020-10-06 00:35:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:46,185 INFO L93 Difference]: Finished difference Result 786 states and 2442 transitions. [2020-10-06 00:35:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:35:46,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-06 00:35:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:46,192 INFO L225 Difference]: With dead ends: 786 [2020-10-06 00:35:46,192 INFO L226 Difference]: Without dead ends: 786 [2020-10-06 00:35:46,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:35:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2020-10-06 00:35:46,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2020-10-06 00:35:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-10-06 00:35:46,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2442 transitions. [2020-10-06 00:35:46,217 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2442 transitions. Word has length 15 [2020-10-06 00:35:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:46,218 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 2442 transitions. [2020-10-06 00:35:46,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 00:35:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2442 transitions. [2020-10-06 00:35:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:35:46,220 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:46,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:46,221 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 00:35:46,221 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:46,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:46,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1006795886, now seen corresponding path program 2 times [2020-10-06 00:35:46,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:46,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497521276] [2020-10-06 00:35:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:46,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497521276] [2020-10-06 00:35:46,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:46,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:35:46,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072159997] [2020-10-06 00:35:46,415 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:46,417 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:46,426 INFO L258 McrAutomatonBuilder]: Finished intersection with 50 states and 95 transitions. [2020-10-06 00:35:46,426 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:46,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,559 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,569 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:46,575 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:35:46,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,603 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:35:46,608 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,636 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,641 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-06 00:35:46,652 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,673 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,686 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:46,690 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:35:46,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,715 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:46,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:46,724 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:46,730 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-06 00:35:46,760 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15887#(and (= ~x~0 1) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)))] [2020-10-06 00:35:46,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:35:46,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:35:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:35:46,761 INFO L87 Difference]: Start difference. First operand 786 states and 2442 transitions. Second operand 7 states. [2020-10-06 00:35:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:46,898 INFO L93 Difference]: Finished difference Result 852 states and 2629 transitions. [2020-10-06 00:35:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:35:46,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 00:35:46,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:46,905 INFO L225 Difference]: With dead ends: 852 [2020-10-06 00:35:46,906 INFO L226 Difference]: Without dead ends: 852 [2020-10-06 00:35:46,906 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:35:46,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2020-10-06 00:35:46,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 780. [2020-10-06 00:35:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-10-06 00:35:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2394 transitions. [2020-10-06 00:35:46,931 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2394 transitions. Word has length 15 [2020-10-06 00:35:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:46,931 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 2394 transitions. [2020-10-06 00:35:46,931 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:35:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2394 transitions. [2020-10-06 00:35:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:35:46,933 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:46,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:46,933 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 00:35:46,934 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:46,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1517521685, now seen corresponding path program 1 times [2020-10-06 00:35:46,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:46,936 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474523832] [2020-10-06 00:35:46,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:47,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474523832] [2020-10-06 00:35:47,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:47,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:35:47,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229828462] [2020-10-06 00:35:47,306 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:47,308 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:47,314 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-10-06 00:35:47,314 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:47,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:35:47,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,417 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:35:47,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,428 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:47,463 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:35:47,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,465 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:35:47,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,473 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:47,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-06 00:35:47,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-06 00:35:47,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:47,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:47,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:47,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:47,502 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:47,652 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2020-10-06 00:35:47,656 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [18310#(and (= 0 ~x$r_buff0_thd3~0) (= ~x~0 0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (or (= 0 ~x$w_buff1~0) (= (mod ~x$w_buff1_used~0 256) 0)) (= ~x~0 ~x$w_buff0~0))] [2020-10-06 00:35:47,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:35:47,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:47,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:35:47,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:35:47,657 INFO L87 Difference]: Start difference. First operand 780 states and 2394 transitions. Second operand 7 states. [2020-10-06 00:35:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:47,813 INFO L93 Difference]: Finished difference Result 832 states and 2573 transitions. [2020-10-06 00:35:47,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:35:47,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 00:35:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:47,820 INFO L225 Difference]: With dead ends: 832 [2020-10-06 00:35:47,820 INFO L226 Difference]: Without dead ends: 832 [2020-10-06 00:35:47,820 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:35:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2020-10-06 00:35:47,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 736. [2020-10-06 00:35:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-10-06 00:35:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2252 transitions. [2020-10-06 00:35:47,844 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2252 transitions. Word has length 15 [2020-10-06 00:35:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:47,844 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 2252 transitions. [2020-10-06 00:35:47,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:35:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2252 transitions. [2020-10-06 00:35:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:35:47,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:47,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:47,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 00:35:47,847 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1533109787, now seen corresponding path program 1 times [2020-10-06 00:35:47,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:47,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690385718] [2020-10-06 00:35:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:47,902 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690385718] [2020-10-06 00:35:47,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:47,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:35:47,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1356282859] [2020-10-06 00:35:47,903 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:47,906 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:47,911 INFO L258 McrAutomatonBuilder]: Finished intersection with 26 states and 35 transitions. [2020-10-06 00:35:47,912 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:47,937 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:47,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:35:47,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:47,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:35:47,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:35:47,939 INFO L87 Difference]: Start difference. First operand 736 states and 2252 transitions. Second operand 4 states. [2020-10-06 00:35:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:47,966 INFO L93 Difference]: Finished difference Result 1027 states and 3079 transitions. [2020-10-06 00:35:47,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:35:47,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-06 00:35:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:47,972 INFO L225 Difference]: With dead ends: 1027 [2020-10-06 00:35:47,972 INFO L226 Difference]: Without dead ends: 766 [2020-10-06 00:35:47,973 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2020-10-06 00:35:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 736. [2020-10-06 00:35:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2020-10-06 00:35:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 2171 transitions. [2020-10-06 00:35:47,995 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 2171 transitions. Word has length 15 [2020-10-06 00:35:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:47,995 INFO L479 AbstractCegarLoop]: Abstraction has 736 states and 2171 transitions. [2020-10-06 00:35:47,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:35:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 2171 transitions. [2020-10-06 00:35:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 00:35:47,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:47,997 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:47,998 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 00:35:47,998 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:47,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:47,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1183987585, now seen corresponding path program 2 times [2020-10-06 00:35:48,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:48,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665361258] [2020-10-06 00:35:48,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:48,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665361258] [2020-10-06 00:35:48,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:48,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:35:48,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [557691973] [2020-10-06 00:35:48,076 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:48,078 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:48,082 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 19 transitions. [2020-10-06 00:35:48,082 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:48,085 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:48,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:35:48,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:48,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:35:48,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:35:48,086 INFO L87 Difference]: Start difference. First operand 736 states and 2171 transitions. Second operand 4 states. [2020-10-06 00:35:48,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:48,121 INFO L93 Difference]: Finished difference Result 698 states and 1827 transitions. [2020-10-06 00:35:48,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 00:35:48,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-06 00:35:48,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:48,125 INFO L225 Difference]: With dead ends: 698 [2020-10-06 00:35:48,125 INFO L226 Difference]: Without dead ends: 498 [2020-10-06 00:35:48,126 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2020-10-06 00:35:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2020-10-06 00:35:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2020-10-06 00:35:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1253 transitions. [2020-10-06 00:35:48,139 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1253 transitions. Word has length 15 [2020-10-06 00:35:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:48,139 INFO L479 AbstractCegarLoop]: Abstraction has 498 states and 1253 transitions. [2020-10-06 00:35:48,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:35:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1253 transitions. [2020-10-06 00:35:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-06 00:35:48,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:48,141 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:48,141 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 00:35:48,141 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1053320640, now seen corresponding path program 1 times [2020-10-06 00:35:48,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:48,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833387607] [2020-10-06 00:35:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:48,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833387607] [2020-10-06 00:35:48,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:48,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 00:35:48,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1446077011] [2020-10-06 00:35:48,230 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:48,232 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:48,238 INFO L258 McrAutomatonBuilder]: Finished intersection with 35 states and 52 transitions. [2020-10-06 00:35:48,238 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:48,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:48,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:48,339 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:48,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 00:35:48,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:48,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 00:35:48,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:48,340 INFO L87 Difference]: Start difference. First operand 498 states and 1253 transitions. Second operand 5 states. [2020-10-06 00:35:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:48,393 INFO L93 Difference]: Finished difference Result 410 states and 964 transitions. [2020-10-06 00:35:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 00:35:48,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-06 00:35:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:48,399 INFO L225 Difference]: With dead ends: 410 [2020-10-06 00:35:48,400 INFO L226 Difference]: Without dead ends: 319 [2020-10-06 00:35:48,400 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-06 00:35:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2020-10-06 00:35:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 299. [2020-10-06 00:35:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-10-06 00:35:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 686 transitions. [2020-10-06 00:35:48,408 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 686 transitions. Word has length 16 [2020-10-06 00:35:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:48,408 INFO L479 AbstractCegarLoop]: Abstraction has 299 states and 686 transitions. [2020-10-06 00:35:48,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 00:35:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 686 transitions. [2020-10-06 00:35:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-06 00:35:48,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:48,410 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 00:35:48,410 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 00:35:48,410 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1311971931, now seen corresponding path program 1 times [2020-10-06 00:35:48,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:48,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828493903] [2020-10-06 00:35:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:48,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828493903] [2020-10-06 00:35:48,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:48,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 00:35:48,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1991965305] [2020-10-06 00:35:48,512 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:48,515 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:48,523 INFO L258 McrAutomatonBuilder]: Finished intersection with 37 states and 53 transitions. [2020-10-06 00:35:48,523 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:48,596 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [25844#(<= ~__unbuffered_cnt~0 0)] [2020-10-06 00:35:48,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 00:35:48,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:48,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 00:35:48,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-06 00:35:48,597 INFO L87 Difference]: Start difference. First operand 299 states and 686 transitions. Second operand 7 states. [2020-10-06 00:35:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:48,652 INFO L93 Difference]: Finished difference Result 275 states and 637 transitions. [2020-10-06 00:35:48,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:35:48,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-06 00:35:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:48,654 INFO L225 Difference]: With dead ends: 275 [2020-10-06 00:35:48,654 INFO L226 Difference]: Without dead ends: 184 [2020-10-06 00:35:48,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-06 00:35:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-06 00:35:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2020-10-06 00:35:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-06 00:35:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions. [2020-10-06 00:35:48,662 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 19 [2020-10-06 00:35:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:48,663 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 415 transitions. [2020-10-06 00:35:48,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 00:35:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions. [2020-10-06 00:35:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:35:48,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:48,664 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] [2020-10-06 00:35:48,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-06 00:35:48,664 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1271353866, now seen corresponding path program 1 times [2020-10-06 00:35:48,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:48,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052125555] [2020-10-06 00:35:48,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:48,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052125555] [2020-10-06 00:35:48,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:48,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 00:35:48,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [318205892] [2020-10-06 00:35:48,734 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:48,740 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:48,762 INFO L258 McrAutomatonBuilder]: Finished intersection with 76 states and 138 transitions. [2020-10-06 00:35:48,763 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:49,034 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 00:35:49,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 00:35:49,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 00:35:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 00:35:49,036 INFO L87 Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 4 states. [2020-10-06 00:35:49,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:49,053 INFO L93 Difference]: Finished difference Result 218 states and 492 transitions. [2020-10-06 00:35:49,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 00:35:49,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-06 00:35:49,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:49,055 INFO L225 Difference]: With dead ends: 218 [2020-10-06 00:35:49,055 INFO L226 Difference]: Without dead ends: 76 [2020-10-06 00:35:49,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 00:35:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-06 00:35:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-06 00:35:49,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-06 00:35:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2020-10-06 00:35:49,058 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23 [2020-10-06 00:35:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:49,059 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2020-10-06 00:35:49,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 00:35:49,059 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2020-10-06 00:35:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:35:49,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:49,060 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] [2020-10-06 00:35:49,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-06 00:35:49,060 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash -671140278, now seen corresponding path program 2 times [2020-10-06 00:35:49,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:49,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444168829] [2020-10-06 00:35:49,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 00:35:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-06 00:35:49,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444168829] [2020-10-06 00:35:49,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 00:35:49,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-06 00:35:49,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [838226761] [2020-10-06 00:35:49,656 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 00:35:49,659 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 00:35:49,670 INFO L258 McrAutomatonBuilder]: Finished intersection with 46 states and 67 transitions. [2020-10-06 00:35:49,671 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 00:35:49,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:49,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,692 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-10-06 00:35:49,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,699 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,701 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,708 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,723 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-06 00:35:49,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,762 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:49,762 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,763 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-10-06 00:35:49,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,765 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,765 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,769 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:49,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,788 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,795 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,802 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,806 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,809 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-06 00:35:49,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,842 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 4, 2, 3, 2, 1] term [2020-10-06 00:35:49,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,843 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-06 00:35:49,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,846 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:49,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 7, 3, 7, 1] term [2020-10-06 00:35:49,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,868 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:49,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,873 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,878 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:49,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,886 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,886 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,900 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-06 00:35:49,901 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,931 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 3, 2, 1] term [2020-10-06 00:35:49,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 9, 3, 2, 1] term [2020-10-06 00:35:49,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:49,934 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 9, 1] term [2020-10-06 00:35:49,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,937 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,938 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:35:49,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:49,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:49,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:49,971 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:49,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:49,982 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:35:49,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:49,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,000 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:50,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 9, 4, 2, 3, 2, 1] term [2020-10-06 00:35:50,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,025 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:50,067 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:50,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,069 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-06 00:35:50,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,083 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,093 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:35:50,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,124 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:50,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,163 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-10-06 00:35:50,163 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:50,164 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:50,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,179 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:50,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,180 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:50,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,196 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,203 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 00:35:50,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,221 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-06 00:35:50,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,550 WARN L193 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 33 [2020-10-06 00:35:50,569 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 00:35:50,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,571 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-10-06 00:35:50,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:50,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,573 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 00:35:50,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 00:35:50,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:35:50,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,586 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,599 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 00:35:50,600 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 00:35:50,606 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 00:35:50,607 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 00:35:50,614 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-06 00:35:50,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 00:35:50,643 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26866#(and (= 0 ~x$r_buff0_thd3~0) (<= ~x$r_buff0_thd0~0 (* 256 (div ~x$r_buff0_thd0~0 256))) (= 2 ~x$w_buff0~0) (= 0 ~x$w_buff1~0) (< 0 (+ (div ~x$r_buff0_thd0~0 256) 1)) (= ~x$w_buff1_used~0 0) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))))] [2020-10-06 00:35:50,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-06 00:35:50,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 00:35:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-06 00:35:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-06 00:35:50,644 INFO L87 Difference]: Start difference. First operand 76 states and 143 transitions. Second operand 9 states. [2020-10-06 00:35:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 00:35:50,836 INFO L93 Difference]: Finished difference Result 96 states and 178 transitions. [2020-10-06 00:35:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 00:35:50,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-06 00:35:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 00:35:50,837 INFO L225 Difference]: With dead ends: 96 [2020-10-06 00:35:50,837 INFO L226 Difference]: Without dead ends: 54 [2020-10-06 00:35:50,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-06 00:35:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-06 00:35:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-06 00:35:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-06 00:35:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-10-06 00:35:50,839 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23 [2020-10-06 00:35:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 00:35:50,840 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2020-10-06 00:35:50,840 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-06 00:35:50,841 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2020-10-06 00:35:50,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-06 00:35:50,841 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 00:35:50,842 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] [2020-10-06 00:35:50,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-06 00:35:50,842 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 00:35:50,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 00:35:50,842 INFO L82 PathProgramCache]: Analyzing trace with hash 786968882, now seen corresponding path program 3 times [2020-10-06 00:35:50,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 00:35:50,845 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091472397] [2020-10-06 00:35:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 00:35:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:35:50,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:35:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 00:35:50,975 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 00:35:51,009 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 00:35:51,009 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 00:35:51,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-06 00:35:51,011 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 00:35:51,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L2-->L845: Formula: (let ((.cse7 (= (mod ~x$w_buff0_used~0_In1150806295 256) 0)) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In1150806295 256))) (.cse9 (= (mod ~x$r_buff1_thd0~0_In1150806295 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In1150806295 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1150806295 0)) (or (and (or (and .cse0 (= ~x~0_In1150806295 ~x~0_Out1150806295)) (and .cse1 (= ~x~0_Out1150806295 ~x$w_buff1~0_In1150806295) .cse2)) .cse3) (and .cse4 (= ~x~0_Out1150806295 ~x$w_buff0~0_In1150806295) .cse5)) (= ~x$r_buff0_thd0~0_Out1150806295 ~x$r_buff0_thd0~0_In1150806295) (or (and (= ~x$w_buff1_used~0_In1150806295 ~x$w_buff1_used~0_Out1150806295) .cse0) (and (= ~x$w_buff1_used~0_Out1150806295 0) .cse1 .cse2)) (= ~x$r_buff1_thd0~0_Out1150806295 ~x$r_buff1_thd0~0_In1150806295) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1150806295 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1150806295|) (or (and .cse3 (= ~x$w_buff0_used~0_In1150806295 ~x$w_buff0_used~0_Out1150806295)) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out1150806295 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1150806295, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1150806295, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1150806295|, ~x$w_buff1~0=~x$w_buff1~0_In1150806295, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1150806295, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1150806295, ~x~0=~x~0_In1150806295, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1150806295} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1150806295, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1150806295, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1150806295|, ~x$w_buff1~0=~x$w_buff1~0_In1150806295, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1150806295|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1150806295, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1150806295|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1150806295|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1150806295|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1150806295, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1150806295, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1150806295|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1150806295|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1150806295, ~x~0=~x~0_Out1150806295} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-06 00:35:51,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,036 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,037 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,038 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,042 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,043 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,044 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,045 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 00:35:51,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 00:35:51,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 12:35:51 BasicIcfg [2020-10-06 00:35:51,107 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 00:35:51,109 INFO L168 Benchmark]: Toolchain (without parser) took 18942.74 ms. Allocated memory was 140.0 MB in the beginning and 474.5 MB in the end (delta: 334.5 MB). Free memory was 101.5 MB in the beginning and 315.4 MB in the end (delta: -213.9 MB). Peak memory consumption was 120.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,110 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.22 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,111 INFO L168 Benchmark]: Boogie Preprocessor took 40.40 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,112 INFO L168 Benchmark]: RCFGBuilder took 2144.40 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 150.7 MB in the beginning and 167.7 MB in the end (delta: -16.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,113 INFO L168 Benchmark]: TraceAbstraction took 15955.64 ms. Allocated memory was 247.5 MB in the beginning and 474.5 MB in the end (delta: 227.0 MB). Free memory was 167.7 MB in the beginning and 315.4 MB in the end (delta: -147.7 MB). Peak memory consumption was 79.3 MB. Max. memory is 7.1 GB. [2020-10-06 00:35:51,116 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.22 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 101.3 MB in the beginning and 156.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.42 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 153.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.40 ms. Allocated memory is still 203.4 MB. Free memory was 153.4 MB in the beginning and 150.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2144.40 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 150.7 MB in the beginning and 167.7 MB in the end (delta: -16.9 MB). Peak memory consumption was 102.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15955.64 ms. Allocated memory was 247.5 MB in the beginning and 474.5 MB in the end (delta: 227.0 MB). Free memory was 167.7 MB in the beginning and 315.4 MB in the end (delta: -147.7 MB). Peak memory consumption was 79.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 109 ProgramPointsBefore, 38 ProgramPointsAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1990 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 1041 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 5631 CheckedPairsTotal, 83 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p1_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L710] 0 int b = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff0_thd3; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L829] 0 pthread_t t891; [L830] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t892; [L832] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t893; [L834] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 y = 1 [L775] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 a = 1 [L801] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 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) [L781] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L781] 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) [L781] 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) [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 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 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 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 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L746] 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) [L746] 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) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 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 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L807] 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) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] 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) [L807] 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) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 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 [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L847] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L848] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L849] 0 x$flush_delayed = weak$$choice2 [L850] 0 x$mem_tmp = x [L851] 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) [L851] 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) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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)) [L854] 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)) [L854] 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)) [L855] 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)) [L855] 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)) [L856] 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)) [L856] EXPR 0 !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) [L856] 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)) [L856] 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)) [L857] 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)) [L857] EXPR 0 !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) [L857] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L857] EXPR 0 !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) [L857] 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)) [L857] 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)) [L858] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L859] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L859] 0 x = x$flush_delayed ? x$mem_tmp : x [L860] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 389 SDtfs, 390 SDslu, 632 SDs, 0 SdLazy, 296 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 179 SyntacticMatches, 36 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 222 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 35888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...