/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:19:47,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:19:47,726 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:19:47,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:19:47,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:19:47,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:19:47,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:19:47,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:19:47,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:19:47,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:19:47,757 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:19:47,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:19:47,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:19:47,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:19:47,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:19:47,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:19:47,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:19:47,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:19:47,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:19:47,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:19:47,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:19:47,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:19:47,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:19:47,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:19:47,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:19:47,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:19:47,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:19:47,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:19:47,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:19:47,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:19:47,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:19:47,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:19:47,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:19:47,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:19:47,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:19:47,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:19:47,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:19:47,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:19:47,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:19:47,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:19:47,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:19:47,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-10-22 02:19:47,839 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:19:47,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:19:47,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:19:47,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:19:47,841 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:19:47,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:19:47,842 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:19:47,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:19:47,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:19:47,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:19:47,843 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:19:47,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:19:47,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:19:47,844 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:19:47,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:19:47,845 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:19:47,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:19:47,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:19:47,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:19:47,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:19:47,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:19:47,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:19:47,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:19:47,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:19:47,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:19:47,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:19:47,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:19:47,847 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:19:47,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:19:47,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:19:47,848 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:19:48,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:19:48,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:19:48,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:19:48,177 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:19:48,178 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:19:48,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2020-10-22 02:19:48,257 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6537cf3a8/7cb5ed37aca142d5902a6f6913e993dc/FLAGfc867a94e [2020-10-22 02:19:48,805 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:19:48,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.oepc.i [2020-10-22 02:19:48,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6537cf3a8/7cb5ed37aca142d5902a6f6913e993dc/FLAGfc867a94e [2020-10-22 02:19:49,079 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6537cf3a8/7cb5ed37aca142d5902a6f6913e993dc [2020-10-22 02:19:49,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:19:49,096 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:19:49,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:19:49,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:19:49,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:19:49,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d4738f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49, skipping insertion in model container [2020-10-22 02:19:49,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:19:49,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:19:49,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:19:49,661 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:19:49,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:19:49,874 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:19:49,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49 WrapperNode [2020-10-22 02:19:49,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:19:49,876 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:19:49,876 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:19:49,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:19:49,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:19:49,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:19:49,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:19:49,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:19:49,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,958 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:49,990 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... [2020-10-22 02:19:50,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:19:50,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:19:50,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:19:50,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:19:50,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:19:50,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:19:50,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:19:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:19:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:19:50,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:19:50,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:19:50,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:19:50,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:19:50,080 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:19:50,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:19:50,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:19:50,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:19:50,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:19:50,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:19:50,083 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:19:52,249 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:19:52,249 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:19:52,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:19:52 BoogieIcfgContainer [2020-10-22 02:19:52,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:19:52,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:19:52,253 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:19:52,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:19:52,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:19:49" (1/3) ... [2020-10-22 02:19:52,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f46e49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:19:52, skipping insertion in model container [2020-10-22 02:19:52,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:19:49" (2/3) ... [2020-10-22 02:19:52,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f46e49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:19:52, skipping insertion in model container [2020-10-22 02:19:52,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:19:52" (3/3) ... [2020-10-22 02:19:52,260 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.oepc.i [2020-10-22 02:19:52,271 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:19:52,271 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:19:52,279 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:19:52,280 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:19:52,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,311 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,318 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,318 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,320 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,323 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,335 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,336 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,336 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:19:52,339 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:19:52,352 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:19:52,372 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:19:52,372 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:19:52,372 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:19:52,372 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:19:52,373 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:19:52,373 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:19:52,373 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:19:52,373 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:19:52,386 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:19:52,387 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 02:19:52,390 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 02:19:52,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-22 02:19:52,437 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-22 02:19:52,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:19:52,442 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 02:19:52,446 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-22 02:19:54,186 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-22 02:19:54,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 02:19:54,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:54,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 02:19:54,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:19:55,289 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-22 02:19:56,077 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 02:19:56,227 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 02:19:56,596 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-22 02:19:57,331 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-10-22 02:19:57,502 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-22 02:19:57,516 INFO L131 LiptonReduction]: Checked pairs total: 5192 [2020-10-22 02:19:57,516 INFO L133 LiptonReduction]: Total number of compositions: 87 [2020-10-22 02:19:57,525 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-10-22 02:19:57,600 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-10-22 02:19:57,603 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-10-22 02:19:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 02:19:57,609 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:57,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 02:19:57,610 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:57,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1086473, now seen corresponding path program 1 times [2020-10-22 02:19:57,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:57,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748164316] [2020-10-22 02:19:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:57,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:19:57,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748164316] [2020-10-22 02:19:57,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:57,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:19:57,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1393904710] [2020-10-22 02:19:57,885 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:57,887 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:57,899 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 02:19:57,899 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:57,903 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:57,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:19:57,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:19:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:19:57,918 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-10-22 02:19:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:58,021 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-22 02:19:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:19:58,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 02:19:58,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:58,064 INFO L225 Difference]: With dead ends: 812 [2020-10-22 02:19:58,065 INFO L226 Difference]: Without dead ends: 687 [2020-10-22 02:19:58,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:19:58,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-10-22 02:19:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-10-22 02:19:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-10-22 02:19:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-10-22 02:19:58,178 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-10-22 02:19:58,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:58,179 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-10-22 02:19:58,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:19:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-10-22 02:19:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:19:58,186 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:58,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:58,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:19:58,186 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash -622279271, now seen corresponding path program 1 times [2020-10-22 02:19:58,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:58,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467267390] [2020-10-22 02:19:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:58,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:19:58,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467267390] [2020-10-22 02:19:58,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:58,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:19:58,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992465614] [2020-10-22 02:19:58,436 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:58,438 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:58,440 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 02:19:58,440 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:58,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:58,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:19:58,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:58,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:19:58,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:19:58,443 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-10-22 02:19:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:58,533 INFO L93 Difference]: Finished difference Result 802 states and 2417 transitions. [2020-10-22 02:19:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:19:58,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 02:19:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:58,540 INFO L225 Difference]: With dead ends: 802 [2020-10-22 02:19:58,540 INFO L226 Difference]: Without dead ends: 677 [2020-10-22 02:19:58,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:19:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-22 02:19:58,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2020-10-22 02:19:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2020-10-22 02:19:58,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 2112 transitions. [2020-10-22 02:19:58,574 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 2112 transitions. Word has length 10 [2020-10-22 02:19:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:58,576 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 2112 transitions. [2020-10-22 02:19:58,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:19:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 2112 transitions. [2020-10-22 02:19:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:19:58,578 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:58,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:58,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:19:58,579 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:58,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:58,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1985552932, now seen corresponding path program 1 times [2020-10-22 02:19:58,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:58,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991144891] [2020-10-22 02:19:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:19:58,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991144891] [2020-10-22 02:19:58,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:58,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:19:58,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607259835] [2020-10-22 02:19:58,701 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:58,704 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:58,707 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-22 02:19:58,707 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:58,860 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6414#(or (and (= ~x~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-22 02:19:58,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:19:58,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:58,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:19:58,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:19:58,862 INFO L87 Difference]: Start difference. First operand 677 states and 2112 transitions. Second operand 6 states. [2020-10-22 02:19:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:59,110 INFO L93 Difference]: Finished difference Result 875 states and 2671 transitions. [2020-10-22 02:19:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:19:59,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 02:19:59,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:59,118 INFO L225 Difference]: With dead ends: 875 [2020-10-22 02:19:59,118 INFO L226 Difference]: Without dead ends: 775 [2020-10-22 02:19:59,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:19:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2020-10-22 02:19:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 667. [2020-10-22 02:19:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2020-10-22 02:19:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2020-10-22 02:19:59,142 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 11 [2020-10-22 02:19:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:59,143 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2020-10-22 02:19:59,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:19:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2020-10-22 02:19:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:19:59,145 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:59,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:59,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:19:59,146 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:59,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:59,146 INFO L82 PathProgramCache]: Analyzing trace with hash 622995715, now seen corresponding path program 1 times [2020-10-22 02:19:59,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:59,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934101316] [2020-10-22 02:19:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:19:59,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934101316] [2020-10-22 02:19:59,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:59,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:19:59,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552372526] [2020-10-22 02:19:59,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:59,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:59,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-22 02:19:59,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:19:59,312 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:19:59,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:19:59,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:19:59,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:19:59,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:19:59,313 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2020-10-22 02:19:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:19:59,384 INFO L93 Difference]: Finished difference Result 765 states and 2302 transitions. [2020-10-22 02:19:59,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:19:59,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 02:19:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:19:59,391 INFO L225 Difference]: With dead ends: 765 [2020-10-22 02:19:59,391 INFO L226 Difference]: Without dead ends: 665 [2020-10-22 02:19:59,392 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:19:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2020-10-22 02:19:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2020-10-22 02:19:59,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2020-10-22 02:19:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 2066 transitions. [2020-10-22 02:19:59,412 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 2066 transitions. Word has length 11 [2020-10-22 02:19:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:19:59,412 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 2066 transitions. [2020-10-22 02:19:59,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:19:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 2066 transitions. [2020-10-22 02:19:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:19:59,414 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:19:59,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:19:59,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:19:59,414 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:19:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:19:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1311185184, now seen corresponding path program 1 times [2020-10-22 02:19:59,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:19:59,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488938059] [2020-10-22 02:19:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:19:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:19:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:19:59,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488938059] [2020-10-22 02:19:59,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:19:59,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:19:59,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [460298207] [2020-10-22 02:19:59,549 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:19:59,551 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:19:59,557 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 41 transitions. [2020-10-22 02:19:59,557 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:00,036 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10737#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~y~0 0) (not (= ~z$w_buff0~0 2)))] [2020-10-22 02:20:00,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:20:00,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:20:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:00,037 INFO L87 Difference]: Start difference. First operand 665 states and 2066 transitions. Second operand 7 states. [2020-10-22 02:20:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:00,183 INFO L93 Difference]: Finished difference Result 764 states and 2302 transitions. [2020-10-22 02:20:00,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:20:00,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-22 02:20:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:00,189 INFO L225 Difference]: With dead ends: 764 [2020-10-22 02:20:00,189 INFO L226 Difference]: Without dead ends: 669 [2020-10-22 02:20:00,190 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2020-10-22 02:20:00,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2020-10-22 02:20:00,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-10-22 02:20:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 2078 transitions. [2020-10-22 02:20:00,211 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 2078 transitions. Word has length 12 [2020-10-22 02:20:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:00,211 INFO L481 AbstractCegarLoop]: Abstraction has 669 states and 2078 transitions. [2020-10-22 02:20:00,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:20:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 2078 transitions. [2020-10-22 02:20:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:20:00,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:00,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:00,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:20:00,213 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -108743901, now seen corresponding path program 1 times [2020-10-22 02:20:00,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:00,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132740718] [2020-10-22 02:20:00,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:00,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132740718] [2020-10-22 02:20:00,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:00,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:20:00,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969393563] [2020-10-22 02:20:00,348 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:00,350 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:00,354 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 28 transitions. [2020-10-22 02:20:00,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:00,476 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:00,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:20:00,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:20:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:20:00,477 INFO L87 Difference]: Start difference. First operand 669 states and 2078 transitions. Second operand 5 states. [2020-10-22 02:20:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:00,607 INFO L93 Difference]: Finished difference Result 1098 states and 3267 transitions. [2020-10-22 02:20:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:20:00,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 02:20:00,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:00,617 INFO L225 Difference]: With dead ends: 1098 [2020-10-22 02:20:00,617 INFO L226 Difference]: Without dead ends: 783 [2020-10-22 02:20:00,618 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2020-10-22 02:20:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 663. [2020-10-22 02:20:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2020-10-22 02:20:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1984 transitions. [2020-10-22 02:20:00,640 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1984 transitions. Word has length 12 [2020-10-22 02:20:00,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:00,641 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 1984 transitions. [2020-10-22 02:20:00,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:20:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1984 transitions. [2020-10-22 02:20:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:20:00,642 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:00,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:00,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:20:00,643 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash 2132982820, now seen corresponding path program 2 times [2020-10-22 02:20:00,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:00,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345923569] [2020-10-22 02:20:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:00,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345923569] [2020-10-22 02:20:00,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:00,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:00,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [919363199] [2020-10-22 02:20:00,764 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:00,768 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:00,772 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 22 transitions. [2020-10-22 02:20:00,772 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:00,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:00,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:20:00,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:00,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:20:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:20:00,916 INFO L87 Difference]: Start difference. First operand 663 states and 1984 transitions. Second operand 6 states. [2020-10-22 02:20:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:01,138 INFO L93 Difference]: Finished difference Result 774 states and 2235 transitions. [2020-10-22 02:20:01,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:01,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 02:20:01,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:01,144 INFO L225 Difference]: With dead ends: 774 [2020-10-22 02:20:01,144 INFO L226 Difference]: Without dead ends: 659 [2020-10-22 02:20:01,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:20:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2020-10-22 02:20:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2020-10-22 02:20:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2020-10-22 02:20:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1936 transitions. [2020-10-22 02:20:01,167 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1936 transitions. Word has length 12 [2020-10-22 02:20:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:01,167 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 1936 transitions. [2020-10-22 02:20:01,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:20:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1936 transitions. [2020-10-22 02:20:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:20:01,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:01,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:01,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:20:01,169 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:01,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1152971523, now seen corresponding path program 1 times [2020-10-22 02:20:01,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:01,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240514938] [2020-10-22 02:20:01,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:01,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240514938] [2020-10-22 02:20:01,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:01,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:01,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [740326725] [2020-10-22 02:20:01,284 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:01,286 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:01,290 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 35 transitions. [2020-10-22 02:20:01,290 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:01,405 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:01,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:01,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:01,442 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:01,448 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:20:01,452 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:20:01,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:01,466 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:01,572 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:01,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:20:01,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:20:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:20:01,574 INFO L87 Difference]: Start difference. First operand 655 states and 1936 transitions. Second operand 6 states. [2020-10-22 02:20:01,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:01,641 INFO L93 Difference]: Finished difference Result 1036 states and 2926 transitions. [2020-10-22 02:20:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:20:01,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 02:20:01,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:01,647 INFO L225 Difference]: With dead ends: 1036 [2020-10-22 02:20:01,648 INFO L226 Difference]: Without dead ends: 697 [2020-10-22 02:20:01,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2020-10-22 02:20:01,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 613. [2020-10-22 02:20:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2020-10-22 02:20:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1716 transitions. [2020-10-22 02:20:01,669 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1716 transitions. Word has length 13 [2020-10-22 02:20:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:01,669 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 1716 transitions. [2020-10-22 02:20:01,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:20:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1716 transitions. [2020-10-22 02:20:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:20:01,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:01,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:01,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:20:01,671 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1698263793, now seen corresponding path program 1 times [2020-10-22 02:20:01,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:01,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330455982] [2020-10-22 02:20:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:01,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330455982] [2020-10-22 02:20:01,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:01,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:01,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1700439874] [2020-10-22 02:20:01,747 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:01,749 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:01,751 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2020-10-22 02:20:01,751 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:01,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:20:01,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:01,793 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:01,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:01,803 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:01,989 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19649#(or (= ~z$w_buff0_used~0 0) (and (not (= (mod ~z$w_buff0_used~0 256) 0)) (not (= (mod ~z$r_buff0_thd0~0 256) 0))))] [2020-10-22 02:20:01,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:20:01,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:01,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:20:01,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:01,991 INFO L87 Difference]: Start difference. First operand 613 states and 1716 transitions. Second operand 7 states. [2020-10-22 02:20:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:02,135 INFO L93 Difference]: Finished difference Result 684 states and 1885 transitions. [2020-10-22 02:20:02,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:02,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-22 02:20:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:02,140 INFO L225 Difference]: With dead ends: 684 [2020-10-22 02:20:02,140 INFO L226 Difference]: Without dead ends: 622 [2020-10-22 02:20:02,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:20:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2020-10-22 02:20:02,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 618. [2020-10-22 02:20:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2020-10-22 02:20:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1729 transitions. [2020-10-22 02:20:02,159 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1729 transitions. Word has length 13 [2020-10-22 02:20:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:02,159 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 1729 transitions. [2020-10-22 02:20:02,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:20:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1729 transitions. [2020-10-22 02:20:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:20:02,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:02,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:02,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:20:02,161 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:02,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:02,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1676525973, now seen corresponding path program 2 times [2020-10-22 02:20:02,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:02,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617290091] [2020-10-22 02:20:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:02,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617290091] [2020-10-22 02:20:02,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:02,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:02,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [858072546] [2020-10-22 02:20:02,252 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:02,254 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:02,257 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 35 transitions. [2020-10-22 02:20:02,257 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:02,526 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:02,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:20:02,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:20:02,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:20:02,527 INFO L87 Difference]: Start difference. First operand 618 states and 1729 transitions. Second operand 6 states. [2020-10-22 02:20:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:02,669 INFO L93 Difference]: Finished difference Result 682 states and 1874 transitions. [2020-10-22 02:20:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:02,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 02:20:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:02,674 INFO L225 Difference]: With dead ends: 682 [2020-10-22 02:20:02,674 INFO L226 Difference]: Without dead ends: 620 [2020-10-22 02:20:02,674 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-10-22 02:20:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 615. [2020-10-22 02:20:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2020-10-22 02:20:02,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1719 transitions. [2020-10-22 02:20:02,689 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1719 transitions. Word has length 13 [2020-10-22 02:20:02,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:02,689 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 1719 transitions. [2020-10-22 02:20:02,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:20:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1719 transitions. [2020-10-22 02:20:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:20:02,691 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:02,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:02,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:20:02,691 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:02,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1623379918, now seen corresponding path program 1 times [2020-10-22 02:20:02,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:02,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834225948] [2020-10-22 02:20:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:02,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:02,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834225948] [2020-10-22 02:20:02,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:02,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:02,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985373790] [2020-10-22 02:20:02,775 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:02,777 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:02,782 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 69 transitions. [2020-10-22 02:20:02,783 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:02,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:02,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:02,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:02,804 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:02,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:02,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:03,422 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [23504#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0_used~0 0)))] [2020-10-22 02:20:03,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:20:03,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:03,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:20:03,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:03,424 INFO L87 Difference]: Start difference. First operand 615 states and 1719 transitions. Second operand 7 states. [2020-10-22 02:20:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:03,722 INFO L93 Difference]: Finished difference Result 756 states and 2092 transitions. [2020-10-22 02:20:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:03,723 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-22 02:20:03,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:03,727 INFO L225 Difference]: With dead ends: 756 [2020-10-22 02:20:03,727 INFO L226 Difference]: Without dead ends: 696 [2020-10-22 02:20:03,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:20:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-10-22 02:20:03,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 672. [2020-10-22 02:20:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2020-10-22 02:20:03,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1876 transitions. [2020-10-22 02:20:03,745 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1876 transitions. Word has length 14 [2020-10-22 02:20:03,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:03,745 INFO L481 AbstractCegarLoop]: Abstraction has 672 states and 1876 transitions. [2020-10-22 02:20:03,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:20:03,745 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1876 transitions. [2020-10-22 02:20:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:20:03,746 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:03,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:03,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:20:03,747 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:03,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:03,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1380655557, now seen corresponding path program 1 times [2020-10-22 02:20:03,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:03,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180609986] [2020-10-22 02:20:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:03,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180609986] [2020-10-22 02:20:03,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:03,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:20:03,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [923331250] [2020-10-22 02:20:03,866 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:03,868 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:03,874 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 66 transitions. [2020-10-22 02:20:03,874 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:03,885 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:03,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:03,890 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:03,896 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:03,898 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:04,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [25620#(and (= ~z$r_buff0_thd1~0 1) (= ~z$w_buff0_used~0 1) (= ~y~0 0) (= (mod ~z$r_buff0_thd0~0 256) 0)), 25621#(or (and (= ~z$r_buff0_thd0~0 0) (= ~y~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-22 02:20:04,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 02:20:04,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:04,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 02:20:04,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:20:04,382 INFO L87 Difference]: Start difference. First operand 672 states and 1876 transitions. Second operand 9 states. [2020-10-22 02:20:04,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:04,555 INFO L93 Difference]: Finished difference Result 819 states and 2224 transitions. [2020-10-22 02:20:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:04,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-22 02:20:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:04,563 INFO L225 Difference]: With dead ends: 819 [2020-10-22 02:20:04,563 INFO L226 Difference]: Without dead ends: 779 [2020-10-22 02:20:04,563 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:20:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-10-22 02:20:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 656. [2020-10-22 02:20:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-10-22 02:20:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1830 transitions. [2020-10-22 02:20:04,585 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1830 transitions. Word has length 14 [2020-10-22 02:20:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:04,587 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 1830 transitions. [2020-10-22 02:20:04,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 02:20:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1830 transitions. [2020-10-22 02:20:04,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:20:04,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:04,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:04,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:20:04,589 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:04,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1106554870, now seen corresponding path program 2 times [2020-10-22 02:20:04,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:04,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135203001] [2020-10-22 02:20:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:04,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:04,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135203001] [2020-10-22 02:20:04,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:04,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:04,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [51710455] [2020-10-22 02:20:04,672 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:04,674 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:04,680 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 48 transitions. [2020-10-22 02:20:04,681 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:04,698 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:04,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:04,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:04,713 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:20:04,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:04,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:04,731 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:20:04,734 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:05,045 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [27763#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))))] [2020-10-22 02:20:05,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:20:05,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:20:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:05,049 INFO L87 Difference]: Start difference. First operand 656 states and 1830 transitions. Second operand 7 states. [2020-10-22 02:20:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:05,189 INFO L93 Difference]: Finished difference Result 730 states and 1999 transitions. [2020-10-22 02:20:05,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:20:05,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-22 02:20:05,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:05,195 INFO L225 Difference]: With dead ends: 730 [2020-10-22 02:20:05,195 INFO L226 Difference]: Without dead ends: 678 [2020-10-22 02:20:05,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:20:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2020-10-22 02:20:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 633. [2020-10-22 02:20:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-10-22 02:20:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1756 transitions. [2020-10-22 02:20:05,212 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1756 transitions. Word has length 14 [2020-10-22 02:20:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:05,213 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 1756 transitions. [2020-10-22 02:20:05,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:20:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1756 transitions. [2020-10-22 02:20:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:20:05,214 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:05,214 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:05,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:20:05,215 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1106519313, now seen corresponding path program 1 times [2020-10-22 02:20:05,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:05,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042575967] [2020-10-22 02:20:05,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:05,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042575967] [2020-10-22 02:20:05,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:05,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:20:05,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594741739] [2020-10-22 02:20:05,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:05,298 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:05,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-10-22 02:20:05,302 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:05,401 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:05,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:05,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:05,414 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:05,417 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:20:05,418 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:20:05,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:05,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:05,627 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:05,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:20:05,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:05,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:20:05,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:20:05,628 INFO L87 Difference]: Start difference. First operand 633 states and 1756 transitions. Second operand 6 states. [2020-10-22 02:20:05,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:05,759 INFO L93 Difference]: Finished difference Result 845 states and 2246 transitions. [2020-10-22 02:20:05,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:20:05,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 02:20:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:05,763 INFO L225 Difference]: With dead ends: 845 [2020-10-22 02:20:05,763 INFO L226 Difference]: Without dead ends: 613 [2020-10-22 02:20:05,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:05,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2020-10-22 02:20:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 541. [2020-10-22 02:20:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-10-22 02:20:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 1446 transitions. [2020-10-22 02:20:05,779 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 1446 transitions. Word has length 14 [2020-10-22 02:20:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:05,779 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 1446 transitions. [2020-10-22 02:20:05,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:20:05,779 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1446 transitions. [2020-10-22 02:20:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:20:05,781 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:05,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:05,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:20:05,781 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:05,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:05,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1518178514, now seen corresponding path program 1 times [2020-10-22 02:20:05,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:05,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630918231] [2020-10-22 02:20:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:05,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630918231] [2020-10-22 02:20:05,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:05,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:20:05,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1896094129] [2020-10-22 02:20:05,977 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:05,979 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:05,986 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 99 transitions. [2020-10-22 02:20:05,987 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:06,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 02:20:06,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 02:20:06,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 2, 3, 2, 1] term [2020-10-22 02:20:06,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,252 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-10-22 02:20:06,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 5, 3, 2, 1] term [2020-10-22 02:20:06,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,269 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term [2020-10-22 02:20:06,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,272 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:06,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:20:06,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 5, 3, 2, 1] term [2020-10-22 02:20:06,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 5, 2, 5, 1] term [2020-10-22 02:20:06,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,312 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,331 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,337 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 5, 2, 5, 1] term [2020-10-22 02:20:06,337 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,339 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,341 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,346 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,358 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,574 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2020-10-22 02:20:06,776 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 99 [2020-10-22 02:20:06,791 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-10-22 02:20:06,792 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 02:20:06,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:06,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:20:06,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:20:06,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 7, 1] term [2020-10-22 02:20:06,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:20:06,813 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 7, 1] term [2020-10-22 02:20:06,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:06,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:20:06,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,851 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:06,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:06,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:06,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,040 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 26 [2020-10-22 02:20:07,364 WARN L193 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 110 [2020-10-22 02:20:07,378 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 3, 2, 1] term [2020-10-22 02:20:07,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,379 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 1] term [2020-10-22 02:20:07,379 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,380 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:07,380 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,382 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:20:07,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 5, 3, 2, 1] term [2020-10-22 02:20:07,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 5, 2, 5, 1] term [2020-10-22 02:20:07,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,407 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:07,412 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:07,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,418 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 3, 5, 2, 5, 1] term [2020-10-22 02:20:07,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,429 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:07,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,727 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 99 [2020-10-22 02:20:07,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 3, 2, 1] term [2020-10-22 02:20:07,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,737 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 7, 3, 2, 1] term [2020-10-22 02:20:07,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,738 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:20:07,738 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,739 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:20:07,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,741 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 7, 4, 2, 3, 2, 1] term [2020-10-22 02:20:07,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,742 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 3, 7, 1] term [2020-10-22 02:20:07,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,743 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,751 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:20:07,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 3, 7, 1] term [2020-10-22 02:20:07,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:20:07,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:07,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,793 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:07,798 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:20:07,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:07,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:20:08,951 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [31712#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (<= ~z$w_buff0_used~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (not (= ~z$w_buff0~0 2)) (<= 0 ~z$w_buff0_used~0) (= (mod ~z$r_buff0_thd2~0 256) 0))), 31713#(or (and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff0~0 2)) (= ~z$w_buff0_used~0 0)) (not (= (mod ~z$w_buff0_used~0 256) 0))), 31708#(and (or (and (not (= (mod ~z$w_buff1_used~0 256) 0)) (not (= (mod ~z$r_buff1_thd0~0 256) 0))) (and (<= 0 ~z$w_buff1_used~0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$w_buff0~0 2))) (or (= (mod ~z$w_buff1_used~0 256) 0) (and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)))), 31709#(and (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd2~0 256) 0)) (or (and (not (= (mod ~z$w_buff1_used~0 256) 0)) (not (= (mod ~z$r_buff1_thd0~0 256) 0))) (and (<= 0 ~z$w_buff1_used~0) (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff1_used~0 (* 256 (div ~z$w_buff1_used~0 256))) (= ~z$w_buff0~0 2))) (or (= (mod ~z$w_buff1_used~0 256) 0) (and (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)))), 31710#(and (<= ~z$w_buff1_used~0 0) (<= 0 ~z$w_buff1_used~0) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd2~0 256) 0)) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 31711#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~z$r_buff0_thd0~0 0) (<= 0 ~z$w_buff0_used~0) (not (= 2 ~z~0)) (= (mod ~z$r_buff0_thd2~0 256) 0)))] [2020-10-22 02:20:08,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 02:20:08,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 02:20:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2020-10-22 02:20:08,952 INFO L87 Difference]: Start difference. First operand 541 states and 1446 transitions. Second operand 13 states. [2020-10-22 02:20:09,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:09,534 INFO L93 Difference]: Finished difference Result 673 states and 1754 transitions. [2020-10-22 02:20:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-22 02:20:09,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-10-22 02:20:09,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:09,539 INFO L225 Difference]: With dead ends: 673 [2020-10-22 02:20:09,539 INFO L226 Difference]: Without dead ends: 625 [2020-10-22 02:20:09,540 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2020-10-22 02:20:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2020-10-22 02:20:09,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 551. [2020-10-22 02:20:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2020-10-22 02:20:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1469 transitions. [2020-10-22 02:20:09,553 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1469 transitions. Word has length 15 [2020-10-22 02:20:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:09,553 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 1469 transitions. [2020-10-22 02:20:09,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 02:20:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1469 transitions. [2020-10-22 02:20:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:20:09,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:09,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:09,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:20:09,555 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 151163354, now seen corresponding path program 1 times [2020-10-22 02:20:09,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:09,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476807905] [2020-10-22 02:20:09,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:09,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476807905] [2020-10-22 02:20:09,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:09,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:20:09,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1023803530] [2020-10-22 02:20:09,618 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:09,620 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:09,629 INFO L252 McrAutomatonBuilder]: Finished intersection with 58 states and 112 transitions. [2020-10-22 02:20:09,629 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:09,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:09,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:09,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:09,958 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:10,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:20:10,136 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [33501#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 02:20:10,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:20:10,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:10,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:20:10,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:20:10,138 INFO L87 Difference]: Start difference. First operand 551 states and 1469 transitions. Second operand 5 states. [2020-10-22 02:20:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:10,189 INFO L93 Difference]: Finished difference Result 352 states and 806 transitions. [2020-10-22 02:20:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:10,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 02:20:10,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:10,191 INFO L225 Difference]: With dead ends: 352 [2020-10-22 02:20:10,191 INFO L226 Difference]: Without dead ends: 225 [2020-10-22 02:20:10,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-22 02:20:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2020-10-22 02:20:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2020-10-22 02:20:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 444 transitions. [2020-10-22 02:20:10,197 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 444 transitions. Word has length 15 [2020-10-22 02:20:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:10,197 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 444 transitions. [2020-10-22 02:20:10,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:20:10,198 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 444 transitions. [2020-10-22 02:20:10,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:20:10,198 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:10,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:20:10,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 02:20:10,199 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:10,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:10,199 INFO L82 PathProgramCache]: Analyzing trace with hash -229010692, now seen corresponding path program 1 times [2020-10-22 02:20:10,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:10,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041689960] [2020-10-22 02:20:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:10,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041689960] [2020-10-22 02:20:10,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:10,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:20:10,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1135209204] [2020-10-22 02:20:10,326 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:10,329 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:10,333 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 32 transitions. [2020-10-22 02:20:10,333 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:10,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:20:10,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:20:10,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:20:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:10,469 INFO L87 Difference]: Start difference. First operand 223 states and 444 transitions. Second operand 8 states. [2020-10-22 02:20:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:10,659 INFO L93 Difference]: Finished difference Result 242 states and 469 transitions. [2020-10-22 02:20:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:20:10,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-22 02:20:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:10,660 INFO L225 Difference]: With dead ends: 242 [2020-10-22 02:20:10,660 INFO L226 Difference]: Without dead ends: 225 [2020-10-22 02:20:10,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:20:10,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2020-10-22 02:20:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 215. [2020-10-22 02:20:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-22 02:20:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 424 transitions. [2020-10-22 02:20:10,666 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 424 transitions. Word has length 18 [2020-10-22 02:20:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:10,666 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 424 transitions. [2020-10-22 02:20:10,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:20:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 424 transitions. [2020-10-22 02:20:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:20:10,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:10,667 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-22 02:20:10,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 02:20:10,668 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:10,668 INFO L82 PathProgramCache]: Analyzing trace with hash 996718655, now seen corresponding path program 1 times [2020-10-22 02:20:10,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:10,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307217150] [2020-10-22 02:20:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:10,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307217150] [2020-10-22 02:20:10,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:10,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:20:10,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993908048] [2020-10-22 02:20:10,852 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:10,855 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:10,864 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 71 transitions. [2020-10-22 02:20:10,864 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:11,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [34998#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff0~0 2)) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0)), 34999#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff0_thd2~0 0) (not (= ~z$w_buff0~0 2)) (= ~z$r_buff0_thd3~0 0))] [2020-10-22 02:20:11,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 02:20:11,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:11,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 02:20:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:20:11,364 INFO L87 Difference]: Start difference. First operand 215 states and 424 transitions. Second operand 10 states. [2020-10-22 02:20:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:11,686 INFO L93 Difference]: Finished difference Result 248 states and 475 transitions. [2020-10-22 02:20:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 02:20:11,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-10-22 02:20:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:11,688 INFO L225 Difference]: With dead ends: 248 [2020-10-22 02:20:11,688 INFO L226 Difference]: Without dead ends: 179 [2020-10-22 02:20:11,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-10-22 02:20:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-22 02:20:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2020-10-22 02:20:11,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-10-22 02:20:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 326 transitions. [2020-10-22 02:20:11,693 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 326 transitions. Word has length 19 [2020-10-22 02:20:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:11,693 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 326 transitions. [2020-10-22 02:20:11,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 02:20:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 326 transitions. [2020-10-22 02:20:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:20:11,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:11,694 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-22 02:20:11,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 02:20:11,694 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 354604781, now seen corresponding path program 1 times [2020-10-22 02:20:11,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:11,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437919035] [2020-10-22 02:20:11,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:11,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:20:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:20:11,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437919035] [2020-10-22 02:20:11,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:20:11,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:20:11,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1618406267] [2020-10-22 02:20:11,777 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:20:11,781 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:20:11,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 78 states and 137 transitions. [2020-10-22 02:20:11,803 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:20:12,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [35592#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:20:12,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:20:12,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:20:12,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:20:12,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:20:12,397 INFO L87 Difference]: Start difference. First operand 165 states and 326 transitions. Second operand 7 states. [2020-10-22 02:20:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:20:12,450 INFO L93 Difference]: Finished difference Result 142 states and 280 transitions. [2020-10-22 02:20:12,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:20:12,451 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 02:20:12,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:20:12,452 INFO L225 Difference]: With dead ends: 142 [2020-10-22 02:20:12,452 INFO L226 Difference]: Without dead ends: 63 [2020-10-22 02:20:12,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:20:12,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-22 02:20:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-22 02:20:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-22 02:20:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2020-10-22 02:20:12,456 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2020-10-22 02:20:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:20:12,456 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2020-10-22 02:20:12,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:20:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2020-10-22 02:20:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 02:20:12,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:20:12,457 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] [2020-10-22 02:20:12,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 02:20:12,457 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:20:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:20:12,458 INFO L82 PathProgramCache]: Analyzing trace with hash -222298438, now seen corresponding path program 1 times [2020-10-22 02:20:12,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:20:12,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912233390] [2020-10-22 02:20:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:20:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:20:12,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:20:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:20:12,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:20:12,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:20:12,606 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:20:12,606 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-22 02:20:12,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,627 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [738] [2020-10-22 02:20:12,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,637 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,637 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,638 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,638 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,638 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,639 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,639 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,641 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,641 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,646 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,646 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,647 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,647 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,648 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,648 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,649 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,649 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,650 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,650 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,651 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:20:12,651 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:20:12,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:20:12 BasicIcfg [2020-10-22 02:20:12,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:20:12,732 INFO L168 Benchmark]: Toolchain (without parser) took 23641.95 ms. Allocated memory was 146.8 MB in the beginning and 487.6 MB in the end (delta: 340.8 MB). Free memory was 100.9 MB in the beginning and 281.6 MB in the end (delta: -180.7 MB). Peak memory consumption was 160.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,733 INFO L168 Benchmark]: CDTParser took 3.18 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.74 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 100.0 MB in the beginning and 152.1 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,734 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.66 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,734 INFO L168 Benchmark]: Boogie Preprocessor took 57.72 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 147.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,735 INFO L168 Benchmark]: RCFGBuilder took 2251.93 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 147.2 MB in the beginning and 158.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 99.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,735 INFO L168 Benchmark]: TraceAbstraction took 20477.95 ms. Allocated memory was 246.4 MB in the beginning and 487.6 MB in the end (delta: 241.2 MB). Free memory was 158.2 MB in the beginning and 281.6 MB in the end (delta: -123.4 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:20:12,738 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.18 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.74 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 100.0 MB in the beginning and 152.1 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.66 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 149.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.72 ms. Allocated memory is still 202.4 MB. Free memory was 149.1 MB in the beginning and 147.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2251.93 ms. Allocated memory was 202.4 MB in the beginning and 246.4 MB in the end (delta: 44.0 MB). Free memory was 147.2 MB in the beginning and 158.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 99.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20477.95 ms. Allocated memory was 246.4 MB in the beginning and 487.6 MB in the end (delta: 241.2 MB). Free memory was 158.2 MB in the beginning and 281.6 MB in the end (delta: -123.4 MB). Peak memory consumption was 117.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 919 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 60 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.1s, 107 PlacesBefore, 37 PlacesAfterwards, 100 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 5192 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2495; [L817] FCALL, FORK 0 pthread_create(&t2495, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 pthread_t t2496; [L819] FCALL, FORK 0 pthread_create(&t2496, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2497; [L821] FCALL, FORK 0 pthread_create(&t2497, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L774] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L827] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L838] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L839] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1 [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L840] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L841] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 572 SDtfs, 698 SDslu, 1393 SDs, 0 SdLazy, 928 SolverSat, 269 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 210 SyntacticMatches, 21 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred 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, 19 MinimizatonAttempts, 689 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 233 ConstructedInterpolants, 0 QuantifiedInterpolants, 35316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...