/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 01:49:18,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 01:49:18,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 01:49:18,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 01:49:18,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 01:49:18,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 01:49:18,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 01:49:18,743 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 01:49:18,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 01:49:18,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 01:49:18,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 01:49:18,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 01:49:18,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 01:49:18,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 01:49:18,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 01:49:18,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 01:49:18,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 01:49:18,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 01:49:18,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 01:49:18,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 01:49:18,773 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 01:49:18,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 01:49:18,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 01:49:18,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 01:49:18,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 01:49:18,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 01:49:18,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 01:49:18,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 01:49:18,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 01:49:18,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 01:49:18,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 01:49:18,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 01:49:18,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 01:49:18,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 01:49:18,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 01:49:18,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 01:49:18,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 01:49:18,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 01:49:18,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 01:49:18,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 01:49:18,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 01:49:18,799 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 01:49:18,838 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 01:49:18,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 01:49:18,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 01:49:18,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 01:49:18,841 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 01:49:18,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 01:49:18,842 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 01:49:18,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 01:49:18,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 01:49:18,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 01:49:18,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 01:49:18,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 01:49:18,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 01:49:18,844 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 01:49:18,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 01:49:18,845 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 01:49:18,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 01:49:18,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 01:49:18,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 01:49:18,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 01:49:18,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 01:49:18,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 01:49:18,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 01:49:18,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 01:49:18,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 01:49:18,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 01:49:18,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 01:49:18,847 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 01:49:18,847 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 01:49:18,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 01:49:18,848 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 01:49:19,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 01:49:19,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 01:49:19,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 01:49:19,181 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 01:49:19,181 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 01:49:19,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-22 01:49:19,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6747cb04/cfd93d686e6445dda9cf325250a6de66/FLAG788eed459 [2020-10-22 01:49:19,794 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 01:49:19,795 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2020-10-22 01:49:19,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6747cb04/cfd93d686e6445dda9cf325250a6de66/FLAG788eed459 [2020-10-22 01:49:20,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6747cb04/cfd93d686e6445dda9cf325250a6de66 [2020-10-22 01:49:20,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 01:49:20,051 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 01:49:20,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 01:49:20,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 01:49:20,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 01:49:20,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61525b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20, skipping insertion in model container [2020-10-22 01:49:20,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 01:49:20,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 01:49:20,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:49:20,663 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 01:49:20,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 01:49:20,811 INFO L208 MainTranslator]: Completed translation [2020-10-22 01:49:20,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20 WrapperNode [2020-10-22 01:49:20,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 01:49:20,812 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 01:49:20,812 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 01:49:20,812 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 01:49:20,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 01:49:20,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 01:49:20,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 01:49:20,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 01:49:20,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (1/1) ... [2020-10-22 01:49:20,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 01:49:20,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 01:49:20,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 01:49:20,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 01:49:20,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (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 01:49:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 01:49:20,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 01:49:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 01:49:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 01:49:20,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 01:49:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 01:49:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 01:49:20,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 01:49:20,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 01:49:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 01:49:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 01:49:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 01:49:20,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 01:49:20,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 01:49:21,001 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 01:49:23,123 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 01:49:23,124 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 01:49:23,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:49:23 BoogieIcfgContainer [2020-10-22 01:49:23,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 01:49:23,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 01:49:23,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 01:49:23,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 01:49:23,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 01:49:20" (1/3) ... [2020-10-22 01:49:23,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf788b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:49:23, skipping insertion in model container [2020-10-22 01:49:23,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 01:49:20" (2/3) ... [2020-10-22 01:49:23,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cf788b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 01:49:23, skipping insertion in model container [2020-10-22 01:49:23,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 01:49:23" (3/3) ... [2020-10-22 01:49:23,137 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2020-10-22 01:49:23,150 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 01:49:23,150 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 01:49:23,158 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 01:49:23,159 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 01:49:23,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,191 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,191 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,192 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,194 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,195 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,195 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,196 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,197 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,200 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,200 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,213 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 01:49:23,219 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 01:49:23,236 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 01:49:23,261 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 01:49:23,261 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 01:49:23,261 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 01:49:23,261 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 01:49:23,261 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 01:49:23,261 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 01:49:23,262 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 01:49:23,262 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 01:49:23,276 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 01:49:23,277 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 110 transitions, 235 flow [2020-10-22 01:49:23,280 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 110 transitions, 235 flow [2020-10-22 01:49:23,282 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 117 places, 110 transitions, 235 flow [2020-10-22 01:49:23,346 INFO L129 PetriNetUnfolder]: 3/107 cut-off events. [2020-10-22 01:49:23,347 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 01:49:23,355 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 3/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2020-10-22 01:49:23,364 INFO L116 LiptonReduction]: Number of co-enabled transitions 2250 [2020-10-22 01:49:23,820 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 01:49:23,964 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-22 01:49:24,227 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-22 01:49:25,770 WARN L193 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2020-10-22 01:49:25,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-22 01:49:25,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 01:49:25,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-22 01:49:25,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 01:49:27,041 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2020-10-22 01:49:27,605 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 01:49:28,853 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-22 01:49:29,262 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-22 01:49:30,653 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 140 DAG size of output: 131 [2020-10-22 01:49:31,206 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-22 01:49:32,046 WARN L193 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 112 [2020-10-22 01:49:32,377 WARN L193 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-10-22 01:49:33,035 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-22 01:49:33,469 WARN L193 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-10-22 01:49:33,923 WARN L193 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-10-22 01:49:34,157 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-22 01:49:34,184 INFO L131 LiptonReduction]: Checked pairs total: 6120 [2020-10-22 01:49:34,184 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-10-22 01:49:34,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 28 transitions, 71 flow [2020-10-22 01:49:34,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1132 states. [2020-10-22 01:49:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states. [2020-10-22 01:49:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 01:49:34,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:34,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 01:49:34,266 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:34,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1073645887, now seen corresponding path program 1 times [2020-10-22 01:49:34,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:34,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51019542] [2020-10-22 01:49:34,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:34,586 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 01:49:34,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51019542] [2020-10-22 01:49:34,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:34,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:49:34,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744633955] [2020-10-22 01:49:34,590 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:34,593 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:34,608 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 01:49:34,608 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:34,613 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:34,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:49:34,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:49:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:49:34,632 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand 3 states. [2020-10-22 01:49:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:34,785 INFO L93 Difference]: Finished difference Result 972 states and 3118 transitions. [2020-10-22 01:49:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:49:34,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 01:49:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:34,819 INFO L225 Difference]: With dead ends: 972 [2020-10-22 01:49:34,820 INFO L226 Difference]: Without dead ends: 792 [2020-10-22 01:49:34,821 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 01:49:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2020-10-22 01:49:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2020-10-22 01:49:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-10-22 01:49:34,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2494 transitions. [2020-10-22 01:49:34,962 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2494 transitions. Word has length 5 [2020-10-22 01:49:34,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:34,962 INFO L481 AbstractCegarLoop]: Abstraction has 792 states and 2494 transitions. [2020-10-22 01:49:34,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:49:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2494 transitions. [2020-10-22 01:49:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 01:49:34,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:34,964 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:34,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 01:49:34,967 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1560698105, now seen corresponding path program 1 times [2020-10-22 01:49:34,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:34,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971622409] [2020-10-22 01:49:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:35,119 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 01:49:35,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971622409] [2020-10-22 01:49:35,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:35,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:49:35,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1223357971] [2020-10-22 01:49:35,120 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:35,122 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:35,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 01:49:35,124 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:35,124 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:35,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:49:35,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:35,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:49:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:49:35,127 INFO L87 Difference]: Start difference. First operand 792 states and 2494 transitions. Second operand 3 states. [2020-10-22 01:49:35,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:35,145 INFO L93 Difference]: Finished difference Result 732 states and 2276 transitions. [2020-10-22 01:49:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:49:35,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 01:49:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:35,153 INFO L225 Difference]: With dead ends: 732 [2020-10-22 01:49:35,154 INFO L226 Difference]: Without dead ends: 732 [2020-10-22 01:49:35,155 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 01:49:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2020-10-22 01:49:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2020-10-22 01:49:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 732 states. [2020-10-22 01:49:35,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 2276 transitions. [2020-10-22 01:49:35,183 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 2276 transitions. Word has length 9 [2020-10-22 01:49:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:35,184 INFO L481 AbstractCegarLoop]: Abstraction has 732 states and 2276 transitions. [2020-10-22 01:49:35,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:49:35,185 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 2276 transitions. [2020-10-22 01:49:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 01:49:35,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:35,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:35,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 01:49:35,188 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:35,188 INFO L82 PathProgramCache]: Analyzing trace with hash -887281155, now seen corresponding path program 1 times [2020-10-22 01:49:35,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:35,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100551327] [2020-10-22 01:49:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:35,279 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 01:49:35,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100551327] [2020-10-22 01:49:35,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:35,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 01:49:35,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1213215109] [2020-10-22 01:49:35,280 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:35,282 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:35,285 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 01:49:35,285 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:35,285 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:35,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 01:49:35,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 01:49:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 01:49:35,287 INFO L87 Difference]: Start difference. First operand 732 states and 2276 transitions. Second operand 3 states. [2020-10-22 01:49:35,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:35,307 INFO L93 Difference]: Finished difference Result 692 states and 2134 transitions. [2020-10-22 01:49:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 01:49:35,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 01:49:35,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:35,314 INFO L225 Difference]: With dead ends: 692 [2020-10-22 01:49:35,314 INFO L226 Difference]: Without dead ends: 692 [2020-10-22 01:49:35,315 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 01:49:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2020-10-22 01:49:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 692. [2020-10-22 01:49:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2020-10-22 01:49:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 2134 transitions. [2020-10-22 01:49:35,340 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 2134 transitions. Word has length 11 [2020-10-22 01:49:35,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:35,340 INFO L481 AbstractCegarLoop]: Abstraction has 692 states and 2134 transitions. [2020-10-22 01:49:35,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 01:49:35,340 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 2134 transitions. [2020-10-22 01:49:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 01:49:35,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:35,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:35,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 01:49:35,344 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1991135112, now seen corresponding path program 1 times [2020-10-22 01:49:35,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:35,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121633539] [2020-10-22 01:49:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:35,512 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 01:49:35,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121633539] [2020-10-22 01:49:35,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:35,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:49:35,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018688072] [2020-10-22 01:49:35,514 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:35,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:35,522 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 29 transitions. [2020-10-22 01:49:35,522 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:35,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:49:35,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:35,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:35,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:35,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:35,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:35,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,172 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9226#(and (or (and (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0)) (and (not (= (mod ~x$w_buff1_used~0 256) 0)) (not (= (mod ~x$r_buff1_thd0~0 256) 0)))) (or (= (mod ~x$r_buff1_thd0~0 256) 0) (and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0)) (= (mod ~x$w_buff1_used~0 256) 0)))] [2020-10-22 01:49:36,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 01:49:36,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:36,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 01:49:36,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:49:36,173 INFO L87 Difference]: Start difference. First operand 692 states and 2134 transitions. Second operand 6 states. [2020-10-22 01:49:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:36,314 INFO L93 Difference]: Finished difference Result 726 states and 2252 transitions. [2020-10-22 01:49:36,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:49:36,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 01:49:36,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:36,322 INFO L225 Difference]: With dead ends: 726 [2020-10-22 01:49:36,322 INFO L226 Difference]: Without dead ends: 726 [2020-10-22 01:49:36,323 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 01:49:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2020-10-22 01:49:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2020-10-22 01:49:36,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2020-10-22 01:49:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2252 transitions. [2020-10-22 01:49:36,353 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 2252 transitions. Word has length 13 [2020-10-22 01:49:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:36,353 INFO L481 AbstractCegarLoop]: Abstraction has 726 states and 2252 transitions. [2020-10-22 01:49:36,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 01:49:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 2252 transitions. [2020-10-22 01:49:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:49:36,355 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:36,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:36,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 01:49:36,356 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1951262149, now seen corresponding path program 1 times [2020-10-22 01:49:36,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:36,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204151219] [2020-10-22 01:49:36,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:36,540 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 01:49:36,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204151219] [2020-10-22 01:49:36,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:36,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:49:36,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [789586165] [2020-10-22 01:49:36,541 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:36,543 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:36,552 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 71 transitions. [2020-10-22 01:49:36,553 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:36,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,578 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:36,582 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:36,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,594 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:36,602 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:36,615 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:36,624 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:49:36,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:36,635 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 01:49:37,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11411#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 (* 256 (div ~x$w_buff1_used~0 256))))] [2020-10-22 01:49:37,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:49:37,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:37,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:49:37,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:49:37,300 INFO L87 Difference]: Start difference. First operand 726 states and 2252 transitions. Second operand 7 states. [2020-10-22 01:49:37,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:37,437 INFO L93 Difference]: Finished difference Result 798 states and 2458 transitions. [2020-10-22 01:49:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 01:49:37,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 01:49:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:37,444 INFO L225 Difference]: With dead ends: 798 [2020-10-22 01:49:37,444 INFO L226 Difference]: Without dead ends: 798 [2020-10-22 01:49:37,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 15 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:49:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2020-10-22 01:49:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 744. [2020-10-22 01:49:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2020-10-22 01:49:37,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 2280 transitions. [2020-10-22 01:49:37,469 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 2280 transitions. Word has length 15 [2020-10-22 01:49:37,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:37,470 INFO L481 AbstractCegarLoop]: Abstraction has 744 states and 2280 transitions. [2020-10-22 01:49:37,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:49:37,470 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 2280 transitions. [2020-10-22 01:49:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:49:37,473 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:37,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:37,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 01:49:37,474 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:37,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2144419833, now seen corresponding path program 1 times [2020-10-22 01:49:37,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:37,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369293833] [2020-10-22 01:49:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:37,637 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 01:49:37,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369293833] [2020-10-22 01:49:37,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:37,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:49:37,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1414477000] [2020-10-22 01:49:37,638 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:37,641 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:37,645 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 27 transitions. [2020-10-22 01:49:37,645 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:37,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 01:49:37,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:37,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 01:49:37,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:37,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:37,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:37,683 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:38,058 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13704#(and (or (and (not (= (mod ~x$w_buff1_used~0 256) 0)) (not (= (mod ~x$r_buff1_thd0~0 256) 0))) (= ~x~0 ~x$w_buff0~0)) (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0))] [2020-10-22 01:49:38,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:49:38,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:38,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:49:38,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:49:38,060 INFO L87 Difference]: Start difference. First operand 744 states and 2280 transitions. Second operand 7 states. [2020-10-22 01:49:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:38,199 INFO L93 Difference]: Finished difference Result 780 states and 2394 transitions. [2020-10-22 01:49:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:49:38,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 01:49:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:38,207 INFO L225 Difference]: With dead ends: 780 [2020-10-22 01:49:38,207 INFO L226 Difference]: Without dead ends: 780 [2020-10-22 01:49:38,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:49:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2020-10-22 01:49:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2020-10-22 01:49:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-10-22 01:49:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2394 transitions. [2020-10-22 01:49:38,232 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2394 transitions. Word has length 15 [2020-10-22 01:49:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:38,232 INFO L481 AbstractCegarLoop]: Abstraction has 780 states and 2394 transitions. [2020-10-22 01:49:38,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:49:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2394 transitions. [2020-10-22 01:49:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:49:38,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:38,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:38,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 01:49:38,235 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:38,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2142257583, now seen corresponding path program 2 times [2020-10-22 01:49:38,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:38,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716835120] [2020-10-22 01:49:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:38,385 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 01:49:38,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716835120] [2020-10-22 01:49:38,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:38,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:49:38,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831875535] [2020-10-22 01:49:38,386 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:38,388 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:38,393 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 41 transitions. [2020-10-22 01:49:38,394 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:38,413 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-10-22 01:49:38,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,415 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 01:49:38,415 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:38,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,422 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 01:49:38,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,428 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:38,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:38,448 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:38,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,458 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:38,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,481 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:38,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,486 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,521 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:49:38,522 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 01:49:38,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,539 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:38,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,749 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:38,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,837 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:38,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,858 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:38,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,884 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,940 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:38,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:38,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:39,029 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:39,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:39,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:39,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,137 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,156 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:39,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:39,453 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 01:49:39,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,455 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 01:49:39,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:39,463 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:39,700 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 26 [2020-10-22 01:49:39,958 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 26 [2020-10-22 01:49:40,112 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-10-22 01:49:40,400 WARN L193 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 26 [2020-10-22 01:49:40,808 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 26 [2020-10-22 01:49:40,809 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [16053#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= (mod ~x$r_buff0_thd3~0 256) 0) (not (= 2 ~x$w_buff1~0)) (not (= ~x~0 ~x$w_buff0~0))), 16054#(and (or (and (= 0 ~x$r_buff0_thd3~0) (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0)) (= (mod ~x$r_buff1_thd0~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0)) (or (and (not (= (mod ~x$w_buff1_used~0 256) 0)) (not (= (mod ~x$r_buff1_thd0~0 256) 0))) (and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0))))] [2020-10-22 01:49:40,810 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 01:49:40,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 01:49:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:49:40,812 INFO L87 Difference]: Start difference. First operand 780 states and 2394 transitions. Second operand 8 states. [2020-10-22 01:49:40,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:40,969 INFO L93 Difference]: Finished difference Result 850 states and 2630 transitions. [2020-10-22 01:49:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:49:40,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-22 01:49:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:40,976 INFO L225 Difference]: With dead ends: 850 [2020-10-22 01:49:40,976 INFO L226 Difference]: Without dead ends: 850 [2020-10-22 01:49:40,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-22 01:49:40,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2020-10-22 01:49:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 778. [2020-10-22 01:49:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-10-22 01:49:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2402 transitions. [2020-10-22 01:49:41,010 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2402 transitions. Word has length 15 [2020-10-22 01:49:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:41,010 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 2402 transitions. [2020-10-22 01:49:41,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 01:49:41,011 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2402 transitions. [2020-10-22 01:49:41,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:49:41,012 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:41,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:41,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 01:49:41,013 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:41,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:41,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2074641561, now seen corresponding path program 1 times [2020-10-22 01:49:41,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:41,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250034508] [2020-10-22 01:49:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:41,094 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 01:49:41,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250034508] [2020-10-22 01:49:41,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:41,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:49:41,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422851066] [2020-10-22 01:49:41,095 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:41,098 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:41,105 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 35 transitions. [2020-10-22 01:49:41,105 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:41,241 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:41,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:49:41,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:41,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:49:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:49:41,243 INFO L87 Difference]: Start difference. First operand 778 states and 2402 transitions. Second operand 4 states. [2020-10-22 01:49:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:41,278 INFO L93 Difference]: Finished difference Result 1078 states and 3262 transitions. [2020-10-22 01:49:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:49:41,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 01:49:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:41,285 INFO L225 Difference]: With dead ends: 1078 [2020-10-22 01:49:41,285 INFO L226 Difference]: Without dead ends: 808 [2020-10-22 01:49:41,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:49:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2020-10-22 01:49:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 778. [2020-10-22 01:49:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-10-22 01:49:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 2312 transitions. [2020-10-22 01:49:41,310 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 2312 transitions. Word has length 15 [2020-10-22 01:49:41,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:41,310 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 2312 transitions. [2020-10-22 01:49:41,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:49:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 2312 transitions. [2020-10-22 01:49:41,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 01:49:41,312 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:41,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:41,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 01:49:41,313 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:41,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:41,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1078495143, now seen corresponding path program 2 times [2020-10-22 01:49:41,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:41,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419805931] [2020-10-22 01:49:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:41,449 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 01:49:41,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419805931] [2020-10-22 01:49:41,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:41,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:49:41,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1910537190] [2020-10-22 01:49:41,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:41,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:41,457 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 19 transitions. [2020-10-22 01:49:41,457 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:41,489 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:41,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:49:41,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:49:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:49:41,490 INFO L87 Difference]: Start difference. First operand 778 states and 2312 transitions. Second operand 4 states. [2020-10-22 01:49:41,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:41,527 INFO L93 Difference]: Finished difference Result 728 states and 1923 transitions. [2020-10-22 01:49:41,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:49:41,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 01:49:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:41,532 INFO L225 Difference]: With dead ends: 728 [2020-10-22 01:49:41,532 INFO L226 Difference]: Without dead ends: 516 [2020-10-22 01:49:41,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:49:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2020-10-22 01:49:41,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2020-10-22 01:49:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2020-10-22 01:49:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1304 transitions. [2020-10-22 01:49:41,547 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 1304 transitions. Word has length 15 [2020-10-22 01:49:41,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:41,547 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 1304 transitions. [2020-10-22 01:49:41,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:49:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 1304 transitions. [2020-10-22 01:49:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 01:49:41,548 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:41,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:41,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 01:49:41,549 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash -901968416, now seen corresponding path program 1 times [2020-10-22 01:49:41,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:41,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272969651] [2020-10-22 01:49:41,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:41,655 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 01:49:41,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272969651] [2020-10-22 01:49:41,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:41,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 01:49:41,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [668897958] [2020-10-22 01:49:41,656 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:41,658 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:41,664 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 52 transitions. [2020-10-22 01:49:41,664 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:41,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:42,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [22873#(not (= 3 ~__unbuffered_cnt~0)), 22874#(not (= ~__unbuffered_cnt~0 2))] [2020-10-22 01:49:42,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 01:49:42,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 01:49:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 01:49:42,027 INFO L87 Difference]: Start difference. First operand 516 states and 1304 transitions. Second operand 7 states. [2020-10-22 01:49:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:42,111 INFO L93 Difference]: Finished difference Result 388 states and 952 transitions. [2020-10-22 01:49:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 01:49:42,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-22 01:49:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:42,113 INFO L225 Difference]: With dead ends: 388 [2020-10-22 01:49:42,113 INFO L226 Difference]: Without dead ends: 210 [2020-10-22 01:49:42,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 01:49:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-22 01:49:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 180. [2020-10-22 01:49:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-10-22 01:49:42,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 415 transitions. [2020-10-22 01:49:42,120 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 415 transitions. Word has length 16 [2020-10-22 01:49:42,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:42,120 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 415 transitions. [2020-10-22 01:49:42,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 01:49:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 415 transitions. [2020-10-22 01:49:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 01:49:42,121 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:42,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:42,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 01:49:42,121 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:42,122 INFO L82 PathProgramCache]: Analyzing trace with hash -939884904, now seen corresponding path program 1 times [2020-10-22 01:49:42,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:42,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324248087] [2020-10-22 01:49:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:42,178 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 01:49:42,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324248087] [2020-10-22 01:49:42,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:42,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 01:49:42,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [40183787] [2020-10-22 01:49:42,179 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:42,183 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:42,204 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 138 transitions. [2020-10-22 01:49:42,204 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:43,209 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 01:49:43,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 01:49:43,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:43,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 01:49:43,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 01:49:43,211 INFO L87 Difference]: Start difference. First operand 180 states and 415 transitions. Second operand 4 states. [2020-10-22 01:49:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:43,231 INFO L93 Difference]: Finished difference Result 218 states and 492 transitions. [2020-10-22 01:49:43,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 01:49:43,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-10-22 01:49:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:43,234 INFO L225 Difference]: With dead ends: 218 [2020-10-22 01:49:43,234 INFO L226 Difference]: Without dead ends: 76 [2020-10-22 01:49:43,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 01:49:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-22 01:49:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-22 01:49:43,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-22 01:49:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 143 transitions. [2020-10-22 01:49:43,242 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 143 transitions. Word has length 23 [2020-10-22 01:49:43,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:43,243 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 143 transitions. [2020-10-22 01:49:43,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 01:49:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 143 transitions. [2020-10-22 01:49:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 01:49:43,244 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:43,244 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:43,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 01:49:43,244 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:43,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:43,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2082788086, now seen corresponding path program 2 times [2020-10-22 01:49:43,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:43,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102744697] [2020-10-22 01:49:43,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 01:49:43,783 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 01:49:43,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102744697] [2020-10-22 01:49:43,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 01:49:43,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 01:49:43,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1559549911] [2020-10-22 01:49:43,784 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 01:49:43,789 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 01:49:43,802 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 65 transitions. [2020-10-22 01:49:43,803 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 01:49:43,986 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 96 [2020-10-22 01:49:44,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:44,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:44,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,009 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:44,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,023 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:44,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,029 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,037 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,046 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:44,051 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:44,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,365 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 125 [2020-10-22 01:49:44,381 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:44,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:44,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,386 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:44,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,411 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:44,416 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,427 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:44,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,443 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:44,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,706 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 99 [2020-10-22 01:49:44,720 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-10-22 01:49:44,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,732 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,734 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:44,734 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,736 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 6, 3, 3, 2, 3, 2, 1] term [2020-10-22 01:49:44,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,737 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 01:49:44,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,742 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,742 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,759 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:44,773 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:44,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,785 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 01:49:44,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,787 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,796 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,806 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 3 conjuncts [2020-10-22 01:49:44,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:44,808 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,827 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,832 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:44,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:44,848 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:44,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,857 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:44,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:44,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:44,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:44,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,069 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:45,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:45,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,072 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,079 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,093 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:45,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,101 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,108 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:45,112 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,113 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,115 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,128 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:45,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,254 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2020-10-22 01:49:45,387 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2020-10-22 01:49:45,395 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:45,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:45,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,398 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:45,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,402 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,408 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,417 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:45,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,435 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:45,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,450 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:45,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:45,569 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,570 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:45,570 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,587 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,592 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,593 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:45,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,597 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,604 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,609 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:45,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,617 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:45,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,787 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2020-10-22 01:49:45,796 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 01:49:45,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,798 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 5, 3, 3, 2, 2, 1] term [2020-10-22 01:49:45,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,800 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 01:49:45,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 01:49:45,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,805 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 01:49:45,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,825 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:45,826 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 01:49:45,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,841 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 01:49:45,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 01:49:45,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 01:49:45,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 01:49:45,886 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [24012#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$w_buff1_used~0 0) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))))] [2020-10-22 01:49:45,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 01:49:45,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 01:49:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 01:49:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-22 01:49:45,887 INFO L87 Difference]: Start difference. First operand 76 states and 143 transitions. Second operand 10 states. [2020-10-22 01:49:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 01:49:46,075 INFO L93 Difference]: Finished difference Result 96 states and 178 transitions. [2020-10-22 01:49:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 01:49:46,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2020-10-22 01:49:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 01:49:46,078 INFO L225 Difference]: With dead ends: 96 [2020-10-22 01:49:46,078 INFO L226 Difference]: Without dead ends: 54 [2020-10-22 01:49:46,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-22 01:49:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-22 01:49:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2020-10-22 01:49:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-22 01:49:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 91 transitions. [2020-10-22 01:49:46,082 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 91 transitions. Word has length 23 [2020-10-22 01:49:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 01:49:46,082 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 91 transitions. [2020-10-22 01:49:46,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 01:49:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 91 transitions. [2020-10-22 01:49:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 01:49:46,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 01:49:46,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 01:49:46,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 01:49:46,084 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 01:49:46,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 01:49:46,085 INFO L82 PathProgramCache]: Analyzing trace with hash -784784998, now seen corresponding path program 3 times [2020-10-22 01:49:46,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 01:49:46,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303081758] [2020-10-22 01:49:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 01:49:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:49:46,207 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:49:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 01:49:46,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 01:49:46,388 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 01:49:46,388 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 01:49:46,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 01:49:46,391 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 01:49:46,416 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1073] [1073] L2-->L856: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In377693410 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In377693410 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In377693410 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In377693410 256) 0))) (let ((.cse3 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (or (and (or (and .cse0 (= ~x$w_buff1~0_In377693410 ~x~0_Out377693410) .cse1) (and .cse2 (= ~x~0_In377693410 ~x~0_Out377693410))) .cse3) (and .cse4 .cse5 (= ~x$w_buff0~0_In377693410 ~x~0_Out377693410))) (= ~x$r_buff1_thd0~0_Out377693410 ~x$r_buff1_thd0~0_In377693410) (or (and (= ~x$w_buff0_used~0_In377693410 ~x$w_buff0_used~0_Out377693410) .cse3) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out377693410 0))) (= ~x$r_buff0_thd0~0_Out377693410 ~x$r_buff0_thd0~0_In377693410) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In377693410| ULTIMATE.start_assume_abort_if_not_~cond_Out377693410) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out377693410 0)) (or (and .cse0 (= ~x$w_buff1_used~0_Out377693410 0) .cse1) (and .cse2 (= ~x$w_buff1_used~0_In377693410 ~x$w_buff1_used~0_Out377693410)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In377693410, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In377693410, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In377693410|, ~x$w_buff1~0=~x$w_buff1~0_In377693410, ~x$w_buff1_used~0=~x$w_buff1_used~0_In377693410, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In377693410, ~x~0=~x~0_In377693410, ~x$w_buff0_used~0=~x$w_buff0_used~0_In377693410} OutVars{~x$w_buff0~0=~x$w_buff0~0_In377693410, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out377693410, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out377693410|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out377693410|, ~x$w_buff1~0=~x$w_buff1~0_In377693410, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out377693410, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out377693410|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out377693410|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out377693410|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out377693410, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out377693410, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In377693410|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out377693410|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out377693410, ~x~0=~x~0_Out377693410} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-22 01:49:46,436 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 01:49:46,437 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [770] [2020-10-22 01:49:46,438 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 01:49:46,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,439 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 01:49:46,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,439 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 01:49:46,439 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,439 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 01:49:46,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,440 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 01:49:46,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,440 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 01:49:46,440 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,441 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 01:49:46,441 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,442 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 01:49:46,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,442 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 01:49:46,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,442 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 01:49:46,442 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,443 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 01:49:46,443 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,445 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 01:49:46,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,445 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 01:49:46,445 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,446 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 01:49:46,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,446 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 01:49:46,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,446 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 01:49:46,446 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,447 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 01:49:46,447 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,455 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 01:49:46,455 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,456 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 01:49:46,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,456 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 01:49:46,456 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,457 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 01:49:46,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,457 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 01:49:46,457 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,458 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 01:49:46,458 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,459 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 01:49:46,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,459 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 01:49:46,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,460 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 01:49:46,460 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,460 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 01:49:46,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,461 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 01:49:46,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,461 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 01:49:46,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,462 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 01:49:46,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,462 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 01:49:46,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 01:49:46,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 01:49:46 BasicIcfg [2020-10-22 01:49:46,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 01:49:46,597 INFO L168 Benchmark]: Toolchain (without parser) took 26550.28 ms. Allocated memory was 140.0 MB in the beginning and 478.2 MB in the end (delta: 338.2 MB). Free memory was 101.4 MB in the beginning and 396.0 MB in the end (delta: -294.6 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,598 INFO L168 Benchmark]: CDTParser took 3.11 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.06 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 155.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 205.0 MB. Free memory was 155.4 MB in the beginning and 151.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,604 INFO L168 Benchmark]: Boogie Preprocessor took 42.32 ms. Allocated memory is still 205.0 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,605 INFO L168 Benchmark]: RCFGBuilder took 2206.02 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 149.2 MB in the beginning and 160.4 MB in the end (delta: -11.2 MB). Peak memory consumption was 98.7 MB. Max. memory is 7.1 GB. [2020-10-22 01:49:46,610 INFO L168 Benchmark]: TraceAbstraction took 23466.07 ms. Allocated memory was 247.5 MB in the beginning and 478.2 MB in the end (delta: 230.7 MB). Free memory was 158.6 MB in the beginning and 396.0 MB in the end (delta: -237.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-22 01:49:46,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.11 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 759.06 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 155.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.70 ms. Allocated memory is still 205.0 MB. Free memory was 155.4 MB in the beginning and 151.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.32 ms. Allocated memory is still 205.0 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2206.02 ms. Allocated memory was 205.0 MB in the beginning and 247.5 MB in the end (delta: 42.5 MB). Free memory was 149.2 MB in the beginning and 160.4 MB in the end (delta: -11.2 MB). Peak memory consumption was 98.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23466.07 ms. Allocated memory was 247.5 MB in the beginning and 478.2 MB in the end (delta: 230.7 MB). Free memory was 158.6 MB in the beginning and 396.0 MB in the end (delta: -237.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1176 VarBasedMoverChecksPositive, 50 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 98 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.9s, 117 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 28 TransitionsAfterwards, 2250 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 6120 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 108 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.9s, HoareTripleCheckerStatistics: 339 SDtfs, 347 SDslu, 660 SDs, 0 SdLazy, 328 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 32 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 186 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 163 ConstructedInterpolants, 0 QuantifiedInterpolants, 21187 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...