/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:14:12,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:14:12,752 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:14:12,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:14:12,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:14:12,798 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:14:12,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:14:12,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:14:12,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:14:12,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:14:12,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:14:12,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:14:12,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:14:12,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:14:12,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:14:12,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:14:12,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:14:12,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:14:12,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:14:12,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:14:12,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:14:12,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:14:12,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:14:12,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:14:12,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:14:12,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:14:12,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:14:12,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:14:12,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:14:12,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:14:12,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:14:12,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:14:12,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:14:12,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:14:12,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:14:12,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:14:12,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:14:12,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:14:12,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:14:12,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:14:12,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:14:12,857 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:14:12,885 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:14:12,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:14:12,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:14:12,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:14:12,887 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:14:12,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:14:12,887 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:14:12,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:14:12,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:14:12,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:14:12,888 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:14:12,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:14:12,889 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:14:12,889 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:14:12,889 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:14:12,889 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:14:12,889 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:14:12,890 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:14:12,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:14:12,890 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:14:12,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:14:12,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:14:12,891 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:14:12,891 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:14:12,891 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:14:12,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:14:12,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:14:12,892 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:14:12,892 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:14:12,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:14:12,892 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:14:13,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:14:13,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:14:13,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:14:13,211 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:14:13,211 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:14:13,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-22 02:14:13,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3b2f42/b06412c5203341c0aa164a2520d4c0ac/FLAGf959165b2 [2020-10-22 02:14:13,805 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:14:13,806 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2020-10-22 02:14:13,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3b2f42/b06412c5203341c0aa164a2520d4c0ac/FLAGf959165b2 [2020-10-22 02:14:14,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca3b2f42/b06412c5203341c0aa164a2520d4c0ac [2020-10-22 02:14:14,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:14:14,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:14:14,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:14:14,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:14:14,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:14:14,120 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@574e9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14, skipping insertion in model container [2020-10-22 02:14:14,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:14:14,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:14:14,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:14:14,726 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:14:14,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:14:14,881 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:14:14,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14 WrapperNode [2020-10-22 02:14:14,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:14:14,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:14:14,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:14:14,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:14:14,892 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:14:14" (1/1) ... [2020-10-22 02:14:14,912 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:14:14" (1/1) ... [2020-10-22 02:14:14,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:14:14,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:14:14,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:14:14,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:14:14,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:14,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (1/1) ... [2020-10-22 02:14:15,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:14:15,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:14:15,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:14:15,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:14:15,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (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:14:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:14:15,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:14:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:14:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:14:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:14:15,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:14:15,077 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:14:15,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:14:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:14:15,078 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:14:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:14:15,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:14:15,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:14:15,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:14:15,081 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:14:17,186 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:14:17,187 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:14:17,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:14:17 BoogieIcfgContainer [2020-10-22 02:14:17,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:14:17,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:14:17,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:14:17,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:14:17,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:14:14" (1/3) ... [2020-10-22 02:14:17,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c211f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:14:17, skipping insertion in model container [2020-10-22 02:14:17,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:14:14" (2/3) ... [2020-10-22 02:14:17,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15c211f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:14:17, skipping insertion in model container [2020-10-22 02:14:17,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:14:17" (3/3) ... [2020-10-22 02:14:17,198 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2020-10-22 02:14:17,211 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:14:17,211 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:14:17,219 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:14:17,220 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:14:17,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,252 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,252 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,252 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:14:17,253 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:14:17,253 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,253 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:14:17,254 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:14:17,254 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:14:17,254 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,254 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:14:17,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,256 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,257 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,258 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,260 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,269 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:14:17,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,269 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:14:17,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,277 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,277 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,279 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,280 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,281 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,281 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,282 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:14:17,284 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:14:17,298 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:14:17,321 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:14:17,321 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:14:17,321 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:14:17,321 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:14:17,321 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:14:17,321 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:14:17,322 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:14:17,322 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:14:17,337 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:14:17,338 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:14:17,341 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:14:17,343 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 02:14:17,392 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 02:14:17,392 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:14:17,398 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 02:14:17,401 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-10-22 02:14:17,763 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 02:14:19,183 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-22 02:14:19,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 02:14:19,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:14:19,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 02:14:19,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:14:20,061 WARN L193 SmtUtils]: Spent 805.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-22 02:14:20,661 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 02:14:21,354 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 02:14:22,044 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 02:14:22,327 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 02:14:23,601 WARN L193 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-22 02:14:23,894 WARN L193 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 02:14:24,294 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 02:14:24,460 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 02:14:24,491 INFO L131 LiptonReduction]: Checked pairs total: 4956 [2020-10-22 02:14:24,491 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-22 02:14:24,515 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 02:14:24,596 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 824 states. [2020-10-22 02:14:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states. [2020-10-22 02:14:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-22 02:14:24,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:24,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-22 02:14:24,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:14:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:24,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1092291, now seen corresponding path program 1 times [2020-10-22 02:14:24,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:24,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910366315] [2020-10-22 02:14:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:24,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:24,862 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:14:24,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910366315] [2020-10-22 02:14:24,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:24,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:14:24,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556477490] [2020-10-22 02:14:24,864 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:24,867 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:24,878 INFO L252 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-22 02:14:24,878 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:24,882 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:24,883 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:14:24,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:14:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:14:24,899 INFO L87 Difference]: Start difference. First operand 824 states. Second operand 3 states. [2020-10-22 02:14:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:25,007 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-22 02:14:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:14:25,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-22 02:14:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:25,050 INFO L225 Difference]: With dead ends: 687 [2020-10-22 02:14:25,050 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 02:14:25,055 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:14:25,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 02:14:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-22 02:14:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-22 02:14:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-22 02:14:25,187 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 3 [2020-10-22 02:14:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:25,187 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-22 02:14:25,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:14:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-22 02:14:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:14:25,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:25,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:25,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:14:25,190 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:14:25,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:25,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1825720558, now seen corresponding path program 1 times [2020-10-22 02:14:25,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:25,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662433064] [2020-10-22 02:14:25,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:25,336 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:14:25,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662433064] [2020-10-22 02:14:25,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:25,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:14:25,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860395895] [2020-10-22 02:14:25,338 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:25,375 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:25,376 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:14:25,377 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:25,379 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:25,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:14:25,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:14:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:14:25,384 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-22 02:14:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:25,436 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-22 02:14:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:14:25,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:14:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:25,444 INFO L225 Difference]: With dead ends: 557 [2020-10-22 02:14:25,444 INFO L226 Difference]: Without dead ends: 557 [2020-10-22 02:14:25,446 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:14:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-22 02:14:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-22 02:14:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-22 02:14:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-22 02:14:25,488 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-22 02:14:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:25,489 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-22 02:14:25,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:14:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-22 02:14:25,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:14:25,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:25,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:25,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:14:25,494 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:14:25,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:25,494 INFO L82 PathProgramCache]: Analyzing trace with hash -128941837, now seen corresponding path program 1 times [2020-10-22 02:14:25,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:25,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556424343] [2020-10-22 02:14:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:25,621 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:14:25,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556424343] [2020-10-22 02:14:25,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:25,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:14:25,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [378786896] [2020-10-22 02:14:25,622 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:25,624 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:25,626 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 20 transitions. [2020-10-22 02:14:25,627 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:25,769 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:25,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:14:25,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:25,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:14:25,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:14:25,770 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-22 02:14:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:25,783 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-22 02:14:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:14:25,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:14:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:25,789 INFO L225 Difference]: With dead ends: 552 [2020-10-22 02:14:25,790 INFO L226 Difference]: Without dead ends: 552 [2020-10-22 02:14:25,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:14:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-22 02:14:25,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-22 02:14:25,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-22 02:14:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-22 02:14:25,812 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 10 [2020-10-22 02:14:25,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:25,813 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-22 02:14:25,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:14:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-22 02:14:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:14:25,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:25,815 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:25,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:14:25,815 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:14:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -762762748, now seen corresponding path program 1 times [2020-10-22 02:14:25,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:25,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584196221] [2020-10-22 02:14:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:25,887 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:14:25,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584196221] [2020-10-22 02:14:25,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:25,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:14:25,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044495330] [2020-10-22 02:14:25,888 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:25,889 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:25,891 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-22 02:14:25,892 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:25,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:14:25,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:25,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:25,931 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:25,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:25,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:26,011 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:26,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:14:26,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:14:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:14:26,013 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-22 02:14:26,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:26,044 INFO L93 Difference]: Finished difference Result 548 states and 1672 transitions. [2020-10-22 02:14:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:14:26,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:14:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:26,049 INFO L225 Difference]: With dead ends: 548 [2020-10-22 02:14:26,050 INFO L226 Difference]: Without dead ends: 548 [2020-10-22 02:14:26,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 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:14:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2020-10-22 02:14:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2020-10-22 02:14:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2020-10-22 02:14:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1672 transitions. [2020-10-22 02:14:26,070 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1672 transitions. Word has length 10 [2020-10-22 02:14:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:26,070 INFO L481 AbstractCegarLoop]: Abstraction has 548 states and 1672 transitions. [2020-10-22 02:14:26,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:14:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1672 transitions. [2020-10-22 02:14:26,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:14:26,072 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:26,072 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:26,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:14:26,073 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:14:26,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 297770051, now seen corresponding path program 1 times [2020-10-22 02:14:26,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:26,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370290256] [2020-10-22 02:14:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:26,162 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:14:26,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370290256] [2020-10-22 02:14:26,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:26,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:26,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [165124858] [2020-10-22 02:14:26,163 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:26,165 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:26,169 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 40 transitions. [2020-10-22 02:14:26,170 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:26,187 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:26,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:26,200 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:26,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:14:26,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:26,608 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [8560#(or (not (= (mod ~z$w_buff0_used~0 256) 0)) (and (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff0_thd0~0 0))), 8558#(and (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~z$w_buff0_used~0 0)) (or (= (mod ~z$w_buff0_used~0 256) 0) (= (mod ~z$r_buff0_thd0~0 256) 0))), 8559#(or (and (not (= ~__unbuffered_p2_EAX~0 1)) (= (mod ~z$r_buff0_thd0~0 256) 0)) (not (= (mod ~z$w_buff0_used~0 256) 0)))] [2020-10-22 02:14:26,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:14:26,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:14:26,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:26,609 INFO L87 Difference]: Start difference. First operand 548 states and 1672 transitions. Second operand 8 states. [2020-10-22 02:14:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:26,740 INFO L93 Difference]: Finished difference Result 677 states and 2069 transitions. [2020-10-22 02:14:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:14:26,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-10-22 02:14:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:26,747 INFO L225 Difference]: With dead ends: 677 [2020-10-22 02:14:26,747 INFO L226 Difference]: Without dead ends: 677 [2020-10-22 02:14:26,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2020-10-22 02:14:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 529. [2020-10-22 02:14:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2020-10-22 02:14:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1605 transitions. [2020-10-22 02:14:26,770 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1605 transitions. Word has length 11 [2020-10-22 02:14:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:26,771 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 1605 transitions. [2020-10-22 02:14:26,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:14:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1605 transitions. [2020-10-22 02:14:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:14:26,775 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:26,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:26,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:14:26,776 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:14:26,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:26,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2124151563, now seen corresponding path program 1 times [2020-10-22 02:14:26,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:26,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662792934] [2020-10-22 02:14:26,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:26,920 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:14:26,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662792934] [2020-10-22 02:14:26,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:26,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:14:26,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [98822151] [2020-10-22 02:14:26,922 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:26,927 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:26,930 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 31 transitions. [2020-10-22 02:14:26,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:26,967 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:26,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:26,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,002 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:27,025 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:14:27,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,034 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:27,066 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:14:27,229 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:27,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:14:27,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:27,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:14:27,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:14:27,231 INFO L87 Difference]: Start difference. First operand 529 states and 1605 transitions. Second operand 4 states. [2020-10-22 02:14:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:27,308 INFO L93 Difference]: Finished difference Result 561 states and 1701 transitions. [2020-10-22 02:14:27,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:27,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 02:14:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:27,314 INFO L225 Difference]: With dead ends: 561 [2020-10-22 02:14:27,314 INFO L226 Difference]: Without dead ends: 561 [2020-10-22 02:14:27,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:14:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2020-10-22 02:14:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2020-10-22 02:14:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2020-10-22 02:14:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 1701 transitions. [2020-10-22 02:14:27,338 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 1701 transitions. Word has length 11 [2020-10-22 02:14:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:27,338 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 1701 transitions. [2020-10-22 02:14:27,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:14:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 1701 transitions. [2020-10-22 02:14:27,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:14:27,340 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:27,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:27,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:14:27,341 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:14:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:27,341 INFO L82 PathProgramCache]: Analyzing trace with hash 640929964, now seen corresponding path program 1 times [2020-10-22 02:14:27,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:27,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264643101] [2020-10-22 02:14:27,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:27,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:27,430 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:14:27,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264643101] [2020-10-22 02:14:27,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:27,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:14:27,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482825430] [2020-10-22 02:14:27,431 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:27,433 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:27,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 65 transitions. [2020-10-22 02:14:27,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:27,846 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:27,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:14:27,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:14:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:14:27,847 INFO L87 Difference]: Start difference. First operand 561 states and 1701 transitions. Second operand 4 states. [2020-10-22 02:14:27,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:27,870 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-10-22 02:14:27,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:27,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 02:14:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:27,875 INFO L225 Difference]: With dead ends: 677 [2020-10-22 02:14:27,875 INFO L226 Difference]: Without dead ends: 377 [2020-10-22 02:14:27,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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:14:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-22 02:14:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-22 02:14:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-22 02:14:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-10-22 02:14:27,888 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 12 [2020-10-22 02:14:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:27,889 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-10-22 02:14:27,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:14:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-10-22 02:14:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:14:27,890 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:27,890 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:27,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:14:27,890 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:14:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:27,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1424343219, now seen corresponding path program 1 times [2020-10-22 02:14:27,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:27,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173668564] [2020-10-22 02:14:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:27,941 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:14:27,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173668564] [2020-10-22 02:14:27,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:27,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:14:27,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [313359000] [2020-10-22 02:14:27,942 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:27,944 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:27,947 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 32 transitions. [2020-10-22 02:14:27,947 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:27,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:14:27,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:27,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:14:27,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:27,962 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:27,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,984 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:27,989 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:27,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:27,995 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:28,217 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:28,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:14:28,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:14:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:14:28,219 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 3 states. [2020-10-22 02:14:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:28,253 INFO L93 Difference]: Finished difference Result 374 states and 1066 transitions. [2020-10-22 02:14:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:14:28,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:14:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:28,257 INFO L225 Difference]: With dead ends: 374 [2020-10-22 02:14:28,257 INFO L226 Difference]: Without dead ends: 374 [2020-10-22 02:14:28,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:14:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2020-10-22 02:14:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2020-10-22 02:14:28,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2020-10-22 02:14:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1066 transitions. [2020-10-22 02:14:28,271 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1066 transitions. Word has length 12 [2020-10-22 02:14:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:28,272 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 1066 transitions. [2020-10-22 02:14:28,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:14:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1066 transitions. [2020-10-22 02:14:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:14:28,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:28,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:28,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:14:28,273 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:14:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:28,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1605853390, now seen corresponding path program 1 times [2020-10-22 02:14:28,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:28,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252399071] [2020-10-22 02:14:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:28,361 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:14:28,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252399071] [2020-10-22 02:14:28,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:28,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:28,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [420796133] [2020-10-22 02:14:28,362 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:28,364 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:28,371 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 70 transitions. [2020-10-22 02:14:28,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:28,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:14:28,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:14:28,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,399 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:28,407 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:28,409 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:28,414 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:28,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:29,337 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 8 [2020-10-22 02:14:29,338 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:29,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:14:29,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:14:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:14:29,340 INFO L87 Difference]: Start difference. First operand 374 states and 1066 transitions. Second operand 5 states. [2020-10-22 02:14:29,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:29,472 INFO L93 Difference]: Finished difference Result 404 states and 1154 transitions. [2020-10-22 02:14:29,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:29,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 02:14:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:29,476 INFO L225 Difference]: With dead ends: 404 [2020-10-22 02:14:29,476 INFO L226 Difference]: Without dead ends: 404 [2020-10-22 02:14:29,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:14:29,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2020-10-22 02:14:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2020-10-22 02:14:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2020-10-22 02:14:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1154 transitions. [2020-10-22 02:14:29,492 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 1154 transitions. Word has length 13 [2020-10-22 02:14:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:29,492 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 1154 transitions. [2020-10-22 02:14:29,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:14:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 1154 transitions. [2020-10-22 02:14:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:14:29,494 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:29,494 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:29,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:14:29,494 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:14:29,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1204965012, now seen corresponding path program 1 times [2020-10-22 02:14:29,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:29,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640710265] [2020-10-22 02:14:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:29,582 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:14:29,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640710265] [2020-10-22 02:14:29,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:29,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:14:29,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706473686] [2020-10-22 02:14:29,583 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:29,585 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:29,589 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2020-10-22 02:14:29,590 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:29,619 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:29,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:29,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:29,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:29,814 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:29,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:14:29,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:14:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:14:29,815 INFO L87 Difference]: Start difference. First operand 404 states and 1154 transitions. Second operand 4 states. [2020-10-22 02:14:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:29,866 INFO L93 Difference]: Finished difference Result 411 states and 1176 transitions. [2020-10-22 02:14:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:29,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 02:14:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:29,870 INFO L225 Difference]: With dead ends: 411 [2020-10-22 02:14:29,870 INFO L226 Difference]: Without dead ends: 411 [2020-10-22 02:14:29,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:14:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-10-22 02:14:29,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-10-22 02:14:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-22 02:14:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1162 transitions. [2020-10-22 02:14:29,883 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1162 transitions. Word has length 13 [2020-10-22 02:14:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:29,884 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1162 transitions. [2020-10-22 02:14:29,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:14:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1162 transitions. [2020-10-22 02:14:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:14:29,885 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:29,885 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:29,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:14:29,885 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:14:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash 438940752, now seen corresponding path program 2 times [2020-10-22 02:14:29,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:29,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95180132] [2020-10-22 02:14:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:29,951 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:14:29,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95180132] [2020-10-22 02:14:29,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:29,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:29,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910368856] [2020-10-22 02:14:29,953 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:29,954 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:29,957 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 02:14:29,957 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:30,087 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:30,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:14:30,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:30,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:14:30,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:14:30,088 INFO L87 Difference]: Start difference. First operand 407 states and 1162 transitions. Second operand 5 states. [2020-10-22 02:14:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:30,159 INFO L93 Difference]: Finished difference Result 402 states and 1146 transitions. [2020-10-22 02:14:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:30,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 02:14:30,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:30,163 INFO L225 Difference]: With dead ends: 402 [2020-10-22 02:14:30,164 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 02:14:30,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:14:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 02:14:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 395. [2020-10-22 02:14:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2020-10-22 02:14:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 1124 transitions. [2020-10-22 02:14:30,176 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 1124 transitions. Word has length 13 [2020-10-22 02:14:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:30,177 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 1124 transitions. [2020-10-22 02:14:30,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:14:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 1124 transitions. [2020-10-22 02:14:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:14:30,178 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:30,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:30,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:14:30,178 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:14:30,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:30,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1758105819, now seen corresponding path program 1 times [2020-10-22 02:14:30,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:30,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018832131] [2020-10-22 02:14:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:14:30,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018832131] [2020-10-22 02:14:30,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:30,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:14:30,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1772152060] [2020-10-22 02:14:30,307 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:30,309 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:30,317 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 73 transitions. [2020-10-22 02:14:30,317 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:30,340 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:14:30,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,341 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:14:30,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:14:30,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:14:30,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:30,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:14:30,368 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:30,372 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:30,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:14:30,381 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:30,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:30,424 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:30,562 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:30,705 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:30,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:31,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:31,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:31,994 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:31,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:32,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:32,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:32,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:33,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:33,221 INFO L721 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:33,335 INFO L721 QuantifierPusher]: Run 20 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:33,439 INFO L721 QuantifierPusher]: Run 30 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2020-10-22 02:14:33,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:33,688 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:33,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:33,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:34,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:34,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:34,618 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:34,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:34,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:35,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:35,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:35,486 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:35,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:35,925 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:36,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:36,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:36,483 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:36,485 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 6 conjuncts [2020-10-22 02:14:36,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:36,488 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:36,499 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:36,502 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:36,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:36,675 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:36,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:36,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:37,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:37,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:37,544 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:37,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:37,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:38,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:38,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:38,433 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:38,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:38,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:38,845 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:39,187 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:39,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:39,379 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:39,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:39,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:39,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:40,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:40,263 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:40,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:40,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:40,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:40,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:40,901 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:40,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:41,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:41,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:41,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:14:41,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:41,604 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:41,605 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:41,607 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:41,618 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:41,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:41,630 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:41,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:41,759 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:41,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:41,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:42,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:42,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:42,335 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:42,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:42,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:42,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:42,771 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:42,794 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:42,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:42,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:43,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:14:43,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-10-22 02:14:43,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,183 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:43,185 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:43,250 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:14:43,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,272 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,292 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:43,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,342 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:14:43,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:43,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,424 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:43,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,463 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:43,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,603 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:43,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:43,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:43,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:44,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:44,165 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:44,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:44,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:44,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:44,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:44,560 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:14:44,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:44,705 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:44,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:14:44,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,383 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-10-22 02:14:45,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 02:14:45,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 3, 2, 1] term [2020-10-22 02:14:45,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 5, 2, 1] term [2020-10-22 02:14:45,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,404 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,430 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:45,435 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:45,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,777 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2020-10-22 02:14:45,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 02:14:45,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 02:14:45,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:45,785 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:45,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,797 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:45,803 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:14:45,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:45,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:46,659 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [18198#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (or (= ~z$w_buff1~0 ~z~0) (not (= (mod ~z$r_buff1_thd2~0 256) 0))) (or (= ~z$w_buff1~0 ~z$w_buff0~0) (= (mod ~z$r_buff0_thd2~0 256) 0)) (or (= ~z$w_buff1~0 ~z~0) (not (= (mod ~z$w_buff1_used~0 256) 0)))), 18199#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= (mod ~z$r_buff0_thd2~0 256) 0))] [2020-10-22 02:14:46,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 02:14:46,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:46,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 02:14:46,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:46,661 INFO L87 Difference]: Start difference. First operand 395 states and 1124 transitions. Second operand 8 states. [2020-10-22 02:14:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:46,803 INFO L93 Difference]: Finished difference Result 391 states and 1110 transitions. [2020-10-22 02:14:46,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:14:46,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-22 02:14:46,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:46,807 INFO L225 Difference]: With dead ends: 391 [2020-10-22 02:14:46,808 INFO L226 Difference]: Without dead ends: 391 [2020-10-22 02:14:46,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:14:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-10-22 02:14:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 359. [2020-10-22 02:14:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2020-10-22 02:14:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1014 transitions. [2020-10-22 02:14:46,821 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1014 transitions. Word has length 14 [2020-10-22 02:14:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:46,823 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 1014 transitions. [2020-10-22 02:14:46,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 02:14:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1014 transitions. [2020-10-22 02:14:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:14:46,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:46,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:46,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:14:46,825 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:14:46,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1758150645, now seen corresponding path program 1 times [2020-10-22 02:14:46,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:46,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642931632] [2020-10-22 02:14:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:46,957 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:14:46,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642931632] [2020-10-22 02:14:46,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:46,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:46,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515601454] [2020-10-22 02:14:46,959 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:46,963 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:46,971 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 71 transitions. [2020-10-22 02:14:46,971 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:46,987 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 02:14:46,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:46,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:46,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:46,994 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:47,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:14:47,610 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [19316#(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:14:47,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:14:47,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:14:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:14:47,611 INFO L87 Difference]: Start difference. First operand 359 states and 1014 transitions. Second operand 6 states. [2020-10-22 02:14:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:47,805 INFO L93 Difference]: Finished difference Result 429 states and 1210 transitions. [2020-10-22 02:14:47,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:14:47,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-22 02:14:47,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:47,810 INFO L225 Difference]: With dead ends: 429 [2020-10-22 02:14:47,810 INFO L226 Difference]: Without dead ends: 429 [2020-10-22 02:14:47,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:14:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-22 02:14:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 423. [2020-10-22 02:14:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2020-10-22 02:14:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 1197 transitions. [2020-10-22 02:14:47,824 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 1197 transitions. Word has length 14 [2020-10-22 02:14:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:47,824 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 1197 transitions. [2020-10-22 02:14:47,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:14:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 1197 transitions. [2020-10-22 02:14:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:14:47,825 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:47,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:47,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 02:14:47,826 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:14:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906856, now seen corresponding path program 1 times [2020-10-22 02:14:47,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:47,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282052268] [2020-10-22 02:14:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:47,955 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:14:47,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282052268] [2020-10-22 02:14:47,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:47,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:14:47,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212426752] [2020-10-22 02:14:47,956 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:47,958 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:47,965 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-10-22 02:14:47,965 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:47,979 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:47,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:47,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:47,988 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 02:14:47,990 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:14:47,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:48,001 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:48,003 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:48,636 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:48,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:14:48,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:48,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:14:48,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:14:48,638 INFO L87 Difference]: Start difference. First operand 423 states and 1197 transitions. Second operand 6 states. [2020-10-22 02:14:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:48,757 INFO L93 Difference]: Finished difference Result 460 states and 1289 transitions. [2020-10-22 02:14:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:14:48,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:14:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:48,762 INFO L225 Difference]: With dead ends: 460 [2020-10-22 02:14:48,763 INFO L226 Difference]: Without dead ends: 460 [2020-10-22 02:14:48,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2020-10-22 02:14:48,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 428. [2020-10-22 02:14:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2020-10-22 02:14:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1211 transitions. [2020-10-22 02:14:48,775 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1211 transitions. Word has length 15 [2020-10-22 02:14:48,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:48,775 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 1211 transitions. [2020-10-22 02:14:48,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:14:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1211 transitions. [2020-10-22 02:14:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:14:48,777 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:48,777 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:48,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 02:14:48,777 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:14:48,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:48,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1331906639, now seen corresponding path program 1 times [2020-10-22 02:14:48,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:48,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377075101] [2020-10-22 02:14:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:48,897 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:14:48,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377075101] [2020-10-22 02:14:48,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:48,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:14:48,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759113034] [2020-10-22 02:14:48,898 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:48,900 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:48,907 INFO L252 McrAutomatonBuilder]: Finished intersection with 41 states and 72 transitions. [2020-10-22 02:14:48,907 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:48,923 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:48,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:48,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:48,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:48,934 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:14:48,939 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:14:48,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:48,943 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:14:49,603 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:49,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:14:49,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:14:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:14:49,604 INFO L87 Difference]: Start difference. First operand 428 states and 1211 transitions. Second operand 6 states. [2020-10-22 02:14:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:49,725 INFO L93 Difference]: Finished difference Result 574 states and 1578 transitions. [2020-10-22 02:14:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:14:49,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:14:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:49,729 INFO L225 Difference]: With dead ends: 574 [2020-10-22 02:14:49,729 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 02:14:49,730 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 02:14:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 438. [2020-10-22 02:14:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-22 02:14:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1230 transitions. [2020-10-22 02:14:49,747 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1230 transitions. Word has length 15 [2020-10-22 02:14:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:49,748 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1230 transitions. [2020-10-22 02:14:49,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:14:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1230 transitions. [2020-10-22 02:14:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:14:49,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:49,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:49,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 02:14:49,751 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:14:49,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:49,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1331920527, now seen corresponding path program 1 times [2020-10-22 02:14:49,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:49,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408939671] [2020-10-22 02:14:49,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:49,815 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:14:49,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408939671] [2020-10-22 02:14:49,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:49,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:49,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [95104757] [2020-10-22 02:14:49,816 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:49,821 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:49,832 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 120 transitions. [2020-10-22 02:14:49,833 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:49,859 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:14:49,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:49,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:49,866 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:50,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:50,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:14:50,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:50,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:14:50,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:14:50,470 INFO L87 Difference]: Start difference. First operand 438 states and 1230 transitions. Second operand 5 states. [2020-10-22 02:14:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:50,539 INFO L93 Difference]: Finished difference Result 669 states and 1833 transitions. [2020-10-22 02:14:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:14:50,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 02:14:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:50,543 INFO L225 Difference]: With dead ends: 669 [2020-10-22 02:14:50,543 INFO L226 Difference]: Without dead ends: 414 [2020-10-22 02:14:50,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:14:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-22 02:14:50,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 390. [2020-10-22 02:14:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2020-10-22 02:14:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1009 transitions. [2020-10-22 02:14:50,558 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1009 transitions. Word has length 15 [2020-10-22 02:14:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:50,559 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 1009 transitions. [2020-10-22 02:14:50,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:14:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1009 transitions. [2020-10-22 02:14:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:14:50,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:50,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:50,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 02:14:50,560 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:14:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1154086099, now seen corresponding path program 2 times [2020-10-22 02:14:50,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:50,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393887985] [2020-10-22 02:14:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:50,630 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:14:50,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393887985] [2020-10-22 02:14:50,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:50,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:14:50,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1321423558] [2020-10-22 02:14:50,632 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:50,637 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:50,651 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 113 transitions. [2020-10-22 02:14:50,651 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:50,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:50,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:50,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:50,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:14:51,068 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [24846#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 02:14:51,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:14:51,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:51,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:14:51,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:14:51,069 INFO L87 Difference]: Start difference. First operand 390 states and 1009 transitions. Second operand 5 states. [2020-10-22 02:14:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:51,128 INFO L93 Difference]: Finished difference Result 279 states and 648 transitions. [2020-10-22 02:14:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:14:51,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-22 02:14:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:51,131 INFO L225 Difference]: With dead ends: 279 [2020-10-22 02:14:51,131 INFO L226 Difference]: Without dead ends: 186 [2020-10-22 02:14:51,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:14:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-22 02:14:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 178. [2020-10-22 02:14:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-22 02:14:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 366 transitions. [2020-10-22 02:14:51,138 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 366 transitions. Word has length 15 [2020-10-22 02:14:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:51,139 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 366 transitions. [2020-10-22 02:14:51,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:14:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 366 transitions. [2020-10-22 02:14:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:14:51,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:51,140 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:14:51,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 02:14:51,140 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:14:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:51,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1909702425, now seen corresponding path program 1 times [2020-10-22 02:14:51,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:51,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805956847] [2020-10-22 02:14:51,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:51,348 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:14:51,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805956847] [2020-10-22 02:14:51,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:51,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:14:51,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [18555293] [2020-10-22 02:14:51,350 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:51,353 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:51,367 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2020-10-22 02:14:51,367 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:52,033 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:14:52,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:14:52,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:52,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:14:52,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:14:52,035 INFO L87 Difference]: Start difference. First operand 178 states and 366 transitions. Second operand 7 states. [2020-10-22 02:14:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:52,131 INFO L93 Difference]: Finished difference Result 229 states and 449 transitions. [2020-10-22 02:14:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:14:52,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 02:14:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:52,133 INFO L225 Difference]: With dead ends: 229 [2020-10-22 02:14:52,133 INFO L226 Difference]: Without dead ends: 173 [2020-10-22 02:14:52,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-22 02:14:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2020-10-22 02:14:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-10-22 02:14:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 339 transitions. [2020-10-22 02:14:52,139 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 339 transitions. Word has length 18 [2020-10-22 02:14:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:52,139 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 339 transitions. [2020-10-22 02:14:52,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:14:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 339 transitions. [2020-10-22 02:14:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:14:52,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:52,141 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:14:52,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 02:14:52,141 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:14:52,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2038631197, now seen corresponding path program 2 times [2020-10-22 02:14:52,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:52,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888441392] [2020-10-22 02:14:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:52,300 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:14:52,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888441392] [2020-10-22 02:14:52,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:52,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 02:14:52,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774766859] [2020-10-22 02:14:52,301 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:52,304 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:52,312 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 56 transitions. [2020-10-22 02:14:52,312 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:52,914 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26072#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$r_buff0_thd3~0 0) (not (= 2 ~z~0)))] [2020-10-22 02:14:52,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-22 02:14:52,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:52,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-22 02:14:52,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:14:52,916 INFO L87 Difference]: Start difference. First operand 170 states and 339 transitions. Second operand 9 states. [2020-10-22 02:14:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:53,029 INFO L93 Difference]: Finished difference Result 203 states and 387 transitions. [2020-10-22 02:14:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:14:53,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-22 02:14:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:53,031 INFO L225 Difference]: With dead ends: 203 [2020-10-22 02:14:53,031 INFO L226 Difference]: Without dead ends: 155 [2020-10-22 02:14:53,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:14:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-22 02:14:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2020-10-22 02:14:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-10-22 02:14:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 277 transitions. [2020-10-22 02:14:53,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 277 transitions. Word has length 18 [2020-10-22 02:14:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:53,036 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 277 transitions. [2020-10-22 02:14:53,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-22 02:14:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 277 transitions. [2020-10-22 02:14:53,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:14:53,037 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:53,037 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:14:53,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 02:14:53,037 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:14:53,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:53,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1448239176, now seen corresponding path program 1 times [2020-10-22 02:14:53,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:53,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670470372] [2020-10-22 02:14:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:14:53,117 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:14:53,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670470372] [2020-10-22 02:14:53,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:14:53,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:14:53,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [895839136] [2020-10-22 02:14:53,118 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:14:53,121 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:14:53,138 INFO L252 McrAutomatonBuilder]: Finished intersection with 79 states and 150 transitions. [2020-10-22 02:14:53,138 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:14:54,110 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [26570#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:14:54,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:14:54,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:14:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:14:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:14:54,112 INFO L87 Difference]: Start difference. First operand 144 states and 277 transitions. Second operand 7 states. [2020-10-22 02:14:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:14:54,181 INFO L93 Difference]: Finished difference Result 128 states and 246 transitions. [2020-10-22 02:14:54,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 02:14:54,182 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-10-22 02:14:54,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:14:54,183 INFO L225 Difference]: With dead ends: 128 [2020-10-22 02:14:54,184 INFO L226 Difference]: Without dead ends: 62 [2020-10-22 02:14:54,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:14:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-22 02:14:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-22 02:14:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-22 02:14:54,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 109 transitions. [2020-10-22 02:14:54,187 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 109 transitions. Word has length 18 [2020-10-22 02:14:54,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:14:54,187 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 109 transitions. [2020-10-22 02:14:54,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:14:54,187 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 109 transitions. [2020-10-22 02:14:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:14:54,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:14:54,190 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:14:54,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-22 02:14:54,190 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:14:54,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:14:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 357676392, now seen corresponding path program 1 times [2020-10-22 02:14:54,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:14:54,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168378891] [2020-10-22 02:14:54,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:14:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:14:54,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:14:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:14:54,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:14:54,303 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:14:54,304 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:14:54,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-22 02:14:54,305 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:14:54,318 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L2-->L834: Formula: (let ((.cse6 (= (mod ~z$r_buff1_thd0~0_In-101857087 256) 0)) (.cse7 (= (mod ~z$w_buff1_used~0_In-101857087 256) 0)) (.cse8 (= (mod ~z$r_buff0_thd0~0_In-101857087 256) 0)) (.cse9 (= (mod ~z$w_buff0_used~0_In-101857087 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (or .cse6 .cse7)) (.cse2 (not .cse7)) (.cse3 (not .cse6))) (and (or (and .cse0 (or (and .cse1 (= ~z~0_In-101857087 ~z~0_Out-101857087)) (and .cse2 (= ~z$w_buff1~0_In-101857087 ~z~0_Out-101857087) .cse3))) (and .cse4 .cse5 (= ~z~0_Out-101857087 ~z$w_buff0~0_In-101857087))) (or (and (= ~z$w_buff0_used~0_Out-101857087 ~z$w_buff0_used~0_In-101857087) .cse0) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out-101857087 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-101857087 0)) (= ~z$r_buff0_thd0~0_In-101857087 ~z$r_buff0_thd0~0_Out-101857087) (= ~z$r_buff1_thd0~0_In-101857087 ~z$r_buff1_thd0~0_Out-101857087) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-101857087 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-101857087|) (or (and .cse1 (= ~z$w_buff1_used~0_Out-101857087 ~z$w_buff1_used~0_In-101857087)) (and .cse2 .cse3 (= ~z$w_buff1_used~0_Out-101857087 0)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-101857087|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-101857087, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-101857087, ~z$w_buff0~0=~z$w_buff0~0_In-101857087, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-101857087, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-101857087, ~z$w_buff1~0=~z$w_buff1~0_In-101857087, ~z~0=~z~0_In-101857087} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-101857087|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-101857087, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-101857087|, ~z$w_buff0~0=~z$w_buff0~0_In-101857087, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-101857087, ~z$w_buff1~0=~z$w_buff1~0_In-101857087, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-101857087|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-101857087|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-101857087|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-101857087|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-101857087, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-101857087|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-101857087, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-101857087, ~z~0=~z~0_Out-101857087} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~z~0, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2020-10-22 02:14:54,323 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:14:54,324 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [740] [2020-10-22 02:14:54,326 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:14:54,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,326 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:14:54,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,327 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:14:54,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,327 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:14:54,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,327 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:14:54,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,328 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:14:54,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,329 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:14:54,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,329 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:14:54,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,330 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:14:54,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,330 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:14:54,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,330 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:14:54,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,331 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:14:54,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,331 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:14:54,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,332 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:14:54,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,332 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:14:54,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,332 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:14:54,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,333 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:14:54,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,333 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:14:54,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,334 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:14:54,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,334 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:14:54,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,334 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:14:54,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,335 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:14:54,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,335 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:14:54,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,335 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:14:54,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,336 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:14:54,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,336 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:14:54,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:14:54,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:14:54 BasicIcfg [2020-10-22 02:14:54,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:14:54,397 INFO L168 Benchmark]: Toolchain (without parser) took 40288.81 ms. Allocated memory was 140.5 MB in the beginning and 928.0 MB in the end (delta: 787.5 MB). Free memory was 102.0 MB in the beginning and 774.0 MB in the end (delta: -672.0 MB). Peak memory consumption was 115.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:14:54,398 INFO L168 Benchmark]: CDTParser took 2.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-22 02:14:54,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.44 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 154.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-22 02:14:54,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 151.6 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:14:54,400 INFO L168 Benchmark]: Boogie Preprocessor took 55.66 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.7 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:14:54,400 INFO L168 Benchmark]: RCFGBuilder took 2185.72 ms. Allocated memory was 204.5 MB in the beginning and 246.9 MB in the end (delta: 42.5 MB). Free memory was 148.7 MB in the beginning and 153.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:14:54,401 INFO L168 Benchmark]: TraceAbstraction took 37205.37 ms. Allocated memory was 246.9 MB in the beginning and 928.0 MB in the end (delta: 681.1 MB). Free memory was 153.4 MB in the beginning and 774.0 MB in the end (delta: -620.6 MB). Peak memory consumption was 60.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:14:54,404 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.49 ms. Allocated memory is still 140.5 MB. Free memory was 122.1 MB in the beginning and 121.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.44 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 101.2 MB in the beginning and 154.5 MB in the end (delta: -53.3 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.56 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 151.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.66 ms. Allocated memory is still 204.5 MB. Free memory was 151.6 MB in the beginning and 148.7 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2185.72 ms. Allocated memory was 204.5 MB in the beginning and 246.9 MB in the end (delta: 42.5 MB). Free memory was 148.7 MB in the beginning and 153.4 MB in the end (delta: -4.8 MB). Peak memory consumption was 97.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37205.37 ms. Allocated memory was 246.9 MB in the beginning and 928.0 MB in the end (delta: 681.1 MB). Free memory was 153.4 MB in the beginning and 774.0 MB in the end (delta: -620.6 MB). Peak memory consumption was 60.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1029 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 82 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.1s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4956 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; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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 t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L776] 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) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] 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) [L776] 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) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 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 [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 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 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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] [L756] 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) [L756] 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) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 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 [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 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 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] 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) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] 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) [L796] 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) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 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 [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 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 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 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) [L840] 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) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 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)) [L844] 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)) [L845] 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)) [L845] 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)) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, 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=0, x=2, y=1, 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, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 411 SDtfs, 424 SDslu, 765 SDs, 0 SdLazy, 520 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 436 GetRequests, 340 SyntacticMatches, 15 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824occurred 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, 20 MinimizatonAttempts, 399 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 30888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...