/usr/bin/java -Xmx16000000000 -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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 21:54:52,900 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 21:54:52,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 21:54:52,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 21:54:52,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 21:54:52,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 21:54:52,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 21:54:52,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 21:54:52,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 21:54:52,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 21:54:52,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 21:54:52,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 21:54:52,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 21:54:52,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 21:54:52,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 21:54:52,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 21:54:52,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 21:54:52,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 21:54:52,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 21:54:52,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 21:54:52,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 21:54:52,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 21:54:52,985 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 21:54:52,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 21:54:52,997 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 21:54:52,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 21:54:52,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 21:54:53,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 21:54:53,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 21:54:53,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 21:54:53,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 21:54:53,003 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 21:54:53,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 21:54:53,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 21:54:53,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 21:54:53,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 21:54:53,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 21:54:53,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 21:54:53,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 21:54:53,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 21:54:53,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 21:54:53,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 21:54:53,040 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 21:54:53,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 21:54:53,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 21:54:53,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 21:54:53,042 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 21:54:53,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 21:54:53,042 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 21:54:53,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 21:54:53,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 21:54:53,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 21:54:53,043 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 21:54:53,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 21:54:53,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 21:54:53,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 21:54:53,044 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 21:54:53,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 21:54:53,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:54:53,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 21:54:53,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 21:54:53,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 21:54:53,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 21:54:53,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 21:54:53,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 21:54:53,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 21:54:53,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 21:54:53,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 21:54:53,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 21:54:53,361 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 21:54:53,361 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 21:54:53,362 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-15 21:54:53,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cefc99d/4b6bb39baaca46ac874694746ee5f96d/FLAG1ffaa5ca5 [2020-10-15 21:54:53,982 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 21:54:53,983 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2020-10-15 21:54:53,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cefc99d/4b6bb39baaca46ac874694746ee5f96d/FLAG1ffaa5ca5 [2020-10-15 21:54:54,214 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14cefc99d/4b6bb39baaca46ac874694746ee5f96d [2020-10-15 21:54:54,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 21:54:54,225 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 21:54:54,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 21:54:54,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 21:54:54,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 21:54:54,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:54,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3f833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54, skipping insertion in model container [2020-10-15 21:54:54,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:54,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 21:54:54,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 21:54:54,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:54:54,812 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 21:54:54,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:54:54,954 INFO L208 MainTranslator]: Completed translation [2020-10-15 21:54:54,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54 WrapperNode [2020-10-15 21:54:54,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 21:54:54,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 21:54:54,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 21:54:54,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 21:54:54,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:54,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 21:54:55,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 21:54:55,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 21:54:55,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 21:54:55,040 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (1/1) ... [2020-10-15 21:54:55,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 21:54:55,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 21:54:55,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 21:54:55,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 21:54:55,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (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-15 21:54:55,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 21:54:55,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 21:54:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 21:54:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 21:54:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 21:54:55,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 21:54:55,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 21:54:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 21:54:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 21:54:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 21:54:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 21:54:55,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 21:54:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 21:54:55,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 21:54:55,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 21:54:55,154 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 21:54:57,136 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 21:54:57,137 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 21:54:57,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:54:57 BoogieIcfgContainer [2020-10-15 21:54:57,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 21:54:57,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 21:54:57,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 21:54:57,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 21:54:57,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:54:54" (1/3) ... [2020-10-15 21:54:57,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d12843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:54:57, skipping insertion in model container [2020-10-15 21:54:57,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:54:54" (2/3) ... [2020-10-15 21:54:57,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d12843b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:54:57, skipping insertion in model container [2020-10-15 21:54:57,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:54:57" (3/3) ... [2020-10-15 21:54:57,149 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2020-10-15 21:54:57,161 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 21:54:57,162 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 21:54:57,169 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 21:54:57,171 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 21:54:57,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,214 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,214 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,214 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,215 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,216 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,217 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,221 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,222 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,222 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,223 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,223 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,230 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,231 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,237 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:54:57,255 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 21:54:57,277 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 21:54:57,278 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 21:54:57,278 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 21:54:57,278 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 21:54:57,278 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 21:54:57,278 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 21:54:57,279 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 21:54:57,279 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 21:54:57,294 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 21:54:57,297 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 21:54:57,300 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 240 flow [2020-10-15 21:54:57,303 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 240 flow [2020-10-15 21:54:57,395 INFO L129 PetriNetUnfolder]: 2/106 cut-off events. [2020-10-15 21:54:57,395 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 21:54:57,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-15 21:54:57,406 INFO L117 LiptonReduction]: Number of co-enabled transitions 2572 [2020-10-15 21:54:57,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:54:57,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:54:57,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:54:57,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:57,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:54:57,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:57,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-15 21:54:57,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:57,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:54:57,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:58,807 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-15 21:54:58,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-15 21:54:58,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:58,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-15 21:54:58,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:54:59,705 WARN L193 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 127 [2020-10-15 21:54:59,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:54:59,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:54:59,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:54:59,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:54:59,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:54:59,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:54:59,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:54:59,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:54:59,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:54:59,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:54:59,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:54:59,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:54:59,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:54:59,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:54:59,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:54:59,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,387 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 21:55:00,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:00,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:00,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:00,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:00,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:55:01,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,744 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 21:55:01,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:01,931 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:01,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:01,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:01,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:01,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:01,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,228 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:55:02,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:55:02,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:55:02,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:02,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:55:02,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:55:03,644 WARN L193 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 111 [2020-10-15 21:55:03,960 WARN L193 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-15 21:55:04,728 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-15 21:55:04,855 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-15 21:55:05,971 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 146 DAG size of output: 137 [2020-10-15 21:55:06,511 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-15 21:55:06,620 INFO L132 LiptonReduction]: Checked pairs total: 7693 [2020-10-15 21:55:06,620 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-15 21:55:06,627 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-10-15 21:55:06,883 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-10-15 21:55:06,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-10-15 21:55:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 21:55:06,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:06,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:06,945 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:06,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1030616479, now seen corresponding path program 1 times [2020-10-15 21:55:06,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:06,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402376838] [2020-10-15 21:55:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:07,304 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-15 21:55:07,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402376838] [2020-10-15 21:55:07,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:07,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:55:07,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656372305] [2020-10-15 21:55:07,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:07,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:07,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:07,330 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-10-15 21:55:07,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:07,493 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-15 21:55:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:07,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 21:55:07,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:07,544 INFO L225 Difference]: With dead ends: 3250 [2020-10-15 21:55:07,544 INFO L226 Difference]: Without dead ends: 2650 [2020-10-15 21:55:07,546 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-15 21:55:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-15 21:55:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-15 21:55:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-15 21:55:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-15 21:55:07,749 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-10-15 21:55:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:07,750 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-15 21:55:07,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:07,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-15 21:55:07,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 21:55:07,756 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:07,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:07,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 21:55:07,757 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:07,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1072761819, now seen corresponding path program 1 times [2020-10-15 21:55:07,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:07,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293005473] [2020-10-15 21:55:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:07,916 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-15 21:55:07,917 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293005473] [2020-10-15 21:55:07,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:07,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:55:07,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088216931] [2020-10-15 21:55:07,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:07,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:07,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:07,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:07,920 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-15 21:55:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:07,994 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-10-15 21:55:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:07,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-15 21:55:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:08,018 INFO L225 Difference]: With dead ends: 2610 [2020-10-15 21:55:08,019 INFO L226 Difference]: Without dead ends: 2610 [2020-10-15 21:55:08,020 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-15 21:55:08,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-15 21:55:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-15 21:55:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-15 21:55:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-10-15 21:55:08,121 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-10-15 21:55:08,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:08,121 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-10-15 21:55:08,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-10-15 21:55:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 21:55:08,124 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:08,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:08,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 21:55:08,125 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash -121033002, now seen corresponding path program 1 times [2020-10-15 21:55:08,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:08,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194339682] [2020-10-15 21:55:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:08,314 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-15 21:55:08,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194339682] [2020-10-15 21:55:08,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:08,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:55:08,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157840080] [2020-10-15 21:55:08,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:55:08,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:08,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:55:08,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:08,316 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 5 states. [2020-10-15 21:55:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:08,442 INFO L93 Difference]: Finished difference Result 2578 states and 9894 transitions. [2020-10-15 21:55:08,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:55:08,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 21:55:08,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:08,465 INFO L225 Difference]: With dead ends: 2578 [2020-10-15 21:55:08,465 INFO L226 Difference]: Without dead ends: 2578 [2020-10-15 21:55:08,465 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2020-10-15 21:55:08,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2578. [2020-10-15 21:55:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2020-10-15 21:55:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 9894 transitions. [2020-10-15 21:55:08,562 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 9894 transitions. Word has length 12 [2020-10-15 21:55:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:08,563 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 9894 transitions. [2020-10-15 21:55:08,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:55:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 9894 transitions. [2020-10-15 21:55:08,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 21:55:08,565 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:08,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:08,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 21:55:08,566 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:08,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:08,566 INFO L82 PathProgramCache]: Analyzing trace with hash -131988125, now seen corresponding path program 1 times [2020-10-15 21:55:08,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:08,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662234149] [2020-10-15 21:55:08,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:55:08,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662234149] [2020-10-15 21:55:08,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:08,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:55:08,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533404235] [2020-10-15 21:55:08,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:08,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:08,623 INFO L87 Difference]: Start difference. First operand 2578 states and 9894 transitions. Second operand 3 states. [2020-10-15 21:55:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:08,677 INFO L93 Difference]: Finished difference Result 2570 states and 9856 transitions. [2020-10-15 21:55:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:08,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-15 21:55:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:08,702 INFO L225 Difference]: With dead ends: 2570 [2020-10-15 21:55:08,702 INFO L226 Difference]: Without dead ends: 2570 [2020-10-15 21:55:08,703 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-15 21:55:08,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2020-10-15 21:55:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2020-10-15 21:55:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2020-10-15 21:55:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 9856 transitions. [2020-10-15 21:55:08,809 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 9856 transitions. Word has length 13 [2020-10-15 21:55:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:08,809 INFO L481 AbstractCegarLoop]: Abstraction has 2570 states and 9856 transitions. [2020-10-15 21:55:08,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 9856 transitions. [2020-10-15 21:55:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 21:55:08,812 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:08,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:08,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 21:55:08,812 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:08,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:08,812 INFO L82 PathProgramCache]: Analyzing trace with hash 721681424, now seen corresponding path program 1 times [2020-10-15 21:55:08,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:08,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128296569] [2020-10-15 21:55:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:08,853 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-15 21:55:08,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128296569] [2020-10-15 21:55:08,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:08,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:55:08,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605248648] [2020-10-15 21:55:08,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:08,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:08,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:08,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:08,855 INFO L87 Difference]: Start difference. First operand 2570 states and 9856 transitions. Second operand 3 states. [2020-10-15 21:55:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:08,878 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-10-15 21:55:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:08,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-15 21:55:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:08,899 INFO L225 Difference]: With dead ends: 2442 [2020-10-15 21:55:08,899 INFO L226 Difference]: Without dead ends: 2442 [2020-10-15 21:55:08,900 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-15 21:55:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-10-15 21:55:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-10-15 21:55:08,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-10-15 21:55:08,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-10-15 21:55:08,992 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 14 [2020-10-15 21:55:08,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:08,993 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-10-15 21:55:08,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:08,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-10-15 21:55:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 21:55:08,996 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:08,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:08,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 21:55:08,996 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1786313371, now seen corresponding path program 1 times [2020-10-15 21:55:08,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:08,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813365262] [2020-10-15 21:55:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:09,136 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-15 21:55:09,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813365262] [2020-10-15 21:55:09,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:09,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:55:09,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852295501] [2020-10-15 21:55:09,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:55:09,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:55:09,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:55:09,139 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states. [2020-10-15 21:55:09,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:09,211 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-10-15 21:55:09,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:09,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 21:55:09,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:09,240 INFO L225 Difference]: With dead ends: 2418 [2020-10-15 21:55:09,241 INFO L226 Difference]: Without dead ends: 2418 [2020-10-15 21:55:09,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:55:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-10-15 21:55:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-10-15 21:55:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-10-15 21:55:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-10-15 21:55:09,324 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-10-15 21:55:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:09,324 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-10-15 21:55:09,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:55:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-10-15 21:55:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 21:55:09,328 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:09,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:09,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 21:55:09,328 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:09,329 INFO L82 PathProgramCache]: Analyzing trace with hash -348629036, now seen corresponding path program 1 times [2020-10-15 21:55:09,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:09,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755581118] [2020-10-15 21:55:09,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:09,381 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-15 21:55:09,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755581118] [2020-10-15 21:55:09,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:09,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:55:09,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621649926] [2020-10-15 21:55:09,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:09,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:09,384 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 3 states. [2020-10-15 21:55:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:09,409 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-10-15 21:55:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:09,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-10-15 21:55:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:09,421 INFO L225 Difference]: With dead ends: 2386 [2020-10-15 21:55:09,421 INFO L226 Difference]: Without dead ends: 2386 [2020-10-15 21:55:09,422 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-15 21:55:09,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-10-15 21:55:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-10-15 21:55:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-10-15 21:55:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-10-15 21:55:09,517 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-10-15 21:55:09,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:09,518 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-10-15 21:55:09,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-10-15 21:55:09,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:55:09,521 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:09,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:09,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 21:55:09,522 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:09,522 INFO L82 PathProgramCache]: Analyzing trace with hash 222355305, now seen corresponding path program 1 times [2020-10-15 21:55:09,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:09,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132577696] [2020-10-15 21:55:09,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:09,614 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-15 21:55:09,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132577696] [2020-10-15 21:55:09,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:09,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:55:09,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503756126] [2020-10-15 21:55:09,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:55:09,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:09,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:55:09,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:09,617 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-10-15 21:55:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:09,691 INFO L93 Difference]: Finished difference Result 2378 states and 9024 transitions. [2020-10-15 21:55:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:55:09,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 21:55:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:09,703 INFO L225 Difference]: With dead ends: 2378 [2020-10-15 21:55:09,703 INFO L226 Difference]: Without dead ends: 2378 [2020-10-15 21:55:09,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2378 states. [2020-10-15 21:55:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2378 to 2338. [2020-10-15 21:55:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-10-15 21:55:09,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 8870 transitions. [2020-10-15 21:55:09,778 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 8870 transitions. Word has length 15 [2020-10-15 21:55:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:09,779 INFO L481 AbstractCegarLoop]: Abstraction has 2338 states and 8870 transitions. [2020-10-15 21:55:09,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:55:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 8870 transitions. [2020-10-15 21:55:09,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 21:55:09,782 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:09,782 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:09,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 21:55:09,783 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:09,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:09,783 INFO L82 PathProgramCache]: Analyzing trace with hash -93104110, now seen corresponding path program 1 times [2020-10-15 21:55:09,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:09,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132481564] [2020-10-15 21:55:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:09,952 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-15 21:55:09,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132481564] [2020-10-15 21:55:09,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:09,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:55:09,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375260912] [2020-10-15 21:55:09,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:55:09,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:55:09,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:09,957 INFO L87 Difference]: Start difference. First operand 2338 states and 8870 transitions. Second operand 5 states. [2020-10-15 21:55:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:10,069 INFO L93 Difference]: Finished difference Result 2410 states and 9134 transitions. [2020-10-15 21:55:10,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:55:10,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-15 21:55:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:10,081 INFO L225 Difference]: With dead ends: 2410 [2020-10-15 21:55:10,081 INFO L226 Difference]: Without dead ends: 2410 [2020-10-15 21:55:10,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2020-10-15 21:55:10,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2410. [2020-10-15 21:55:10,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-10-15 21:55:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-10-15 21:55:10,165 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-10-15 21:55:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:10,166 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-10-15 21:55:10,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:55:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-10-15 21:55:10,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 21:55:10,171 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:10,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:10,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 21:55:10,171 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:10,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:10,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2046082702, now seen corresponding path program 1 times [2020-10-15 21:55:10,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:10,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234191597] [2020-10-15 21:55:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:55:10,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234191597] [2020-10-15 21:55:10,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:10,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:55:10,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144381031] [2020-10-15 21:55:10,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:55:10,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:10,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:55:10,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:10,328 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-10-15 21:55:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:10,458 INFO L93 Difference]: Finished difference Result 2610 states and 9960 transitions. [2020-10-15 21:55:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:55:10,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-15 21:55:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:10,472 INFO L225 Difference]: With dead ends: 2610 [2020-10-15 21:55:10,472 INFO L226 Difference]: Without dead ends: 2610 [2020-10-15 21:55:10,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-10-15 21:55:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-10-15 21:55:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-10-15 21:55:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 9960 transitions. [2020-10-15 21:55:10,562 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 9960 transitions. Word has length 16 [2020-10-15 21:55:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:10,564 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 9960 transitions. [2020-10-15 21:55:10,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:55:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 9960 transitions. [2020-10-15 21:55:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 21:55:10,569 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:10,569 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:10,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 21:55:10,570 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:10,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:10,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1696833598, now seen corresponding path program 2 times [2020-10-15 21:55:10,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:10,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263840971] [2020-10-15 21:55:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:10,947 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-15 21:55:10,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263840971] [2020-10-15 21:55:10,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:10,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:55:10,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857056612] [2020-10-15 21:55:10,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:55:10,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:10,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:55:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:10,949 INFO L87 Difference]: Start difference. First operand 2610 states and 9960 transitions. Second operand 6 states. [2020-10-15 21:55:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:11,122 INFO L93 Difference]: Finished difference Result 2970 states and 11282 transitions. [2020-10-15 21:55:11,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:55:11,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-15 21:55:11,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:11,133 INFO L225 Difference]: With dead ends: 2970 [2020-10-15 21:55:11,133 INFO L226 Difference]: Without dead ends: 2970 [2020-10-15 21:55:11,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:55:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-10-15 21:55:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2762. [2020-10-15 21:55:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-15 21:55:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 10430 transitions. [2020-10-15 21:55:11,232 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 10430 transitions. Word has length 16 [2020-10-15 21:55:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:11,232 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 10430 transitions. [2020-10-15 21:55:11,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:55:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 10430 transitions. [2020-10-15 21:55:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:55:11,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:11,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:11,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 21:55:11,242 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -112806921, now seen corresponding path program 1 times [2020-10-15 21:55:11,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:11,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363941954] [2020-10-15 21:55:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:11,646 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-15 21:55:11,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363941954] [2020-10-15 21:55:11,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:11,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:55:11,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778004686] [2020-10-15 21:55:11,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:55:11,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:55:11,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:55:11,648 INFO L87 Difference]: Start difference. First operand 2762 states and 10430 transitions. Second operand 7 states. [2020-10-15 21:55:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:11,887 INFO L93 Difference]: Finished difference Result 2898 states and 10904 transitions. [2020-10-15 21:55:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 21:55:11,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 21:55:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:11,897 INFO L225 Difference]: With dead ends: 2898 [2020-10-15 21:55:11,897 INFO L226 Difference]: Without dead ends: 2898 [2020-10-15 21:55:11,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-15 21:55:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2020-10-15 21:55:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2578. [2020-10-15 21:55:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2020-10-15 21:55:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 9720 transitions. [2020-10-15 21:55:11,975 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 9720 transitions. Word has length 17 [2020-10-15 21:55:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:11,976 INFO L481 AbstractCegarLoop]: Abstraction has 2578 states and 9720 transitions. [2020-10-15 21:55:11,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:55:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 9720 transitions. [2020-10-15 21:55:11,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:55:11,981 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:11,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:11,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 21:55:11,982 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:11,982 INFO L82 PathProgramCache]: Analyzing trace with hash 207234097, now seen corresponding path program 1 times [2020-10-15 21:55:11,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:11,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386085535] [2020-10-15 21:55:11,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,040 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-15 21:55:12,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386085535] [2020-10-15 21:55:12,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:55:12,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253891974] [2020-10-15 21:55:12,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:55:12,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:55:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:55:12,042 INFO L87 Difference]: Start difference. First operand 2578 states and 9720 transitions. Second operand 4 states. [2020-10-15 21:55:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:12,091 INFO L93 Difference]: Finished difference Result 2686 states and 9245 transitions. [2020-10-15 21:55:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:55:12,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 21:55:12,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:12,100 INFO L225 Difference]: With dead ends: 2686 [2020-10-15 21:55:12,100 INFO L226 Difference]: Without dead ends: 1982 [2020-10-15 21:55:12,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2020-10-15 21:55:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2020-10-15 21:55:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2020-10-15 21:55:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 6740 transitions. [2020-10-15 21:55:12,152 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 6740 transitions. Word has length 17 [2020-10-15 21:55:12,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:12,152 INFO L481 AbstractCegarLoop]: Abstraction has 1982 states and 6740 transitions. [2020-10-15 21:55:12,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:55:12,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 6740 transitions. [2020-10-15 21:55:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 21:55:12,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:12,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:12,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 21:55:12,157 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:12,158 INFO L82 PathProgramCache]: Analyzing trace with hash -791241669, now seen corresponding path program 1 times [2020-10-15 21:55:12,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:12,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614357547] [2020-10-15 21:55:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,219 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-15 21:55:12,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614357547] [2020-10-15 21:55:12,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:55:12,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676760042] [2020-10-15 21:55:12,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:55:12,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:55:12,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:12,222 INFO L87 Difference]: Start difference. First operand 1982 states and 6740 transitions. Second operand 5 states. [2020-10-15 21:55:12,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:12,286 INFO L93 Difference]: Finished difference Result 1722 states and 5414 transitions. [2020-10-15 21:55:12,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:55:12,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-15 21:55:12,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:12,291 INFO L225 Difference]: With dead ends: 1722 [2020-10-15 21:55:12,291 INFO L226 Difference]: Without dead ends: 1291 [2020-10-15 21:55:12,292 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:12,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2020-10-15 21:55:12,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2020-10-15 21:55:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2020-10-15 21:55:12,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 3976 transitions. [2020-10-15 21:55:12,323 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 3976 transitions. Word has length 18 [2020-10-15 21:55:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:12,323 INFO L481 AbstractCegarLoop]: Abstraction has 1291 states and 3976 transitions. [2020-10-15 21:55:12,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:55:12,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 3976 transitions. [2020-10-15 21:55:12,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 21:55:12,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:12,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:12,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 21:55:12,327 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:12,327 INFO L82 PathProgramCache]: Analyzing trace with hash 694225450, now seen corresponding path program 1 times [2020-10-15 21:55:12,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:12,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567462838] [2020-10-15 21:55:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,364 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-15 21:55:12,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567462838] [2020-10-15 21:55:12,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:55:12,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001368288] [2020-10-15 21:55:12,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:55:12,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:55:12,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:55:12,366 INFO L87 Difference]: Start difference. First operand 1291 states and 3976 transitions. Second operand 3 states. [2020-10-15 21:55:12,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:12,383 INFO L93 Difference]: Finished difference Result 1859 states and 5571 transitions. [2020-10-15 21:55:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:55:12,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-10-15 21:55:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:12,388 INFO L225 Difference]: With dead ends: 1859 [2020-10-15 21:55:12,388 INFO L226 Difference]: Without dead ends: 1303 [2020-10-15 21:55:12,388 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-15 21:55:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2020-10-15 21:55:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1267. [2020-10-15 21:55:12,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1267 states. [2020-10-15 21:55:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 3685 transitions. [2020-10-15 21:55:12,417 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 3685 transitions. Word has length 20 [2020-10-15 21:55:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:12,418 INFO L481 AbstractCegarLoop]: Abstraction has 1267 states and 3685 transitions. [2020-10-15 21:55:12,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:55:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 3685 transitions. [2020-10-15 21:55:12,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 21:55:12,421 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:12,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:12,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 21:55:12,422 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash -905674660, now seen corresponding path program 1 times [2020-10-15 21:55:12,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:12,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949220904] [2020-10-15 21:55:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,489 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-15 21:55:12,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949220904] [2020-10-15 21:55:12,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:55:12,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555877527] [2020-10-15 21:55:12,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:55:12,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:55:12,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:12,491 INFO L87 Difference]: Start difference. First operand 1267 states and 3685 transitions. Second operand 6 states. [2020-10-15 21:55:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:12,552 INFO L93 Difference]: Finished difference Result 1122 states and 3224 transitions. [2020-10-15 21:55:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 21:55:12,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-15 21:55:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:12,556 INFO L225 Difference]: With dead ends: 1122 [2020-10-15 21:55:12,556 INFO L226 Difference]: Without dead ends: 989 [2020-10-15 21:55:12,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:55:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2020-10-15 21:55:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 929. [2020-10-15 21:55:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2020-10-15 21:55:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2703 transitions. [2020-10-15 21:55:12,577 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2703 transitions. Word has length 21 [2020-10-15 21:55:12,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:12,578 INFO L481 AbstractCegarLoop]: Abstraction has 929 states and 2703 transitions. [2020-10-15 21:55:12,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:55:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2703 transitions. [2020-10-15 21:55:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-15 21:55:12,581 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:12,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:12,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 21:55:12,582 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:12,582 INFO L82 PathProgramCache]: Analyzing trace with hash -730235590, now seen corresponding path program 1 times [2020-10-15 21:55:12,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:12,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493972570] [2020-10-15 21:55:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,688 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-15 21:55:12,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493972570] [2020-10-15 21:55:12,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 21:55:12,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650164571] [2020-10-15 21:55:12,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:55:12,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:55:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:55:12,690 INFO L87 Difference]: Start difference. First operand 929 states and 2703 transitions. Second operand 7 states. [2020-10-15 21:55:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:12,812 INFO L93 Difference]: Finished difference Result 900 states and 2644 transitions. [2020-10-15 21:55:12,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:55:12,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-15 21:55:12,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:12,815 INFO L225 Difference]: With dead ends: 900 [2020-10-15 21:55:12,815 INFO L226 Difference]: Without dead ends: 545 [2020-10-15 21:55:12,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 21:55:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-10-15 21:55:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2020-10-15 21:55:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-15 21:55:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-10-15 21:55:12,826 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 24 [2020-10-15 21:55:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:12,826 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-10-15 21:55:12,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:55:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-10-15 21:55:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 21:55:12,828 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:12,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:12,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-15 21:55:12,829 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:12,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash -126296697, now seen corresponding path program 1 times [2020-10-15 21:55:12,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:12,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177412165] [2020-10-15 21:55:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:55:12,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177412165] [2020-10-15 21:55:12,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:12,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:55:12,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719000928] [2020-10-15 21:55:12,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 21:55:12,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:12,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 21:55:12,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:55:12,917 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 6 states. [2020-10-15 21:55:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:13,032 INFO L93 Difference]: Finished difference Result 1006 states and 2857 transitions. [2020-10-15 21:55:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:55:13,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-10-15 21:55:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:13,035 INFO L225 Difference]: With dead ends: 1006 [2020-10-15 21:55:13,035 INFO L226 Difference]: Without dead ends: 652 [2020-10-15 21:55:13,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:55:13,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-10-15 21:55:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 517. [2020-10-15 21:55:13,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-15 21:55:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1422 transitions. [2020-10-15 21:55:13,047 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1422 transitions. Word has length 27 [2020-10-15 21:55:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:13,048 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1422 transitions. [2020-10-15 21:55:13,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 21:55:13,048 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1422 transitions. [2020-10-15 21:55:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 21:55:13,050 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:13,050 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:13,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-15 21:55:13,050 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:13,050 INFO L82 PathProgramCache]: Analyzing trace with hash -931966079, now seen corresponding path program 2 times [2020-10-15 21:55:13,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:13,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530239825] [2020-10-15 21:55:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:13,100 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-15 21:55:13,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530239825] [2020-10-15 21:55:13,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:13,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:55:13,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332176488] [2020-10-15 21:55:13,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:55:13,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:13,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:55:13,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:55:13,102 INFO L87 Difference]: Start difference. First operand 517 states and 1422 transitions. Second operand 4 states. [2020-10-15 21:55:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:13,120 INFO L93 Difference]: Finished difference Result 684 states and 1876 transitions. [2020-10-15 21:55:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:55:13,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-10-15 21:55:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:13,122 INFO L225 Difference]: With dead ends: 684 [2020-10-15 21:55:13,122 INFO L226 Difference]: Without dead ends: 214 [2020-10-15 21:55:13,122 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:55:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-10-15 21:55:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2020-10-15 21:55:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-10-15 21:55:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 543 transitions. [2020-10-15 21:55:13,127 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 543 transitions. Word has length 27 [2020-10-15 21:55:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:13,127 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 543 transitions. [2020-10-15 21:55:13,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:55:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 543 transitions. [2020-10-15 21:55:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 21:55:13,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:13,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:13,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-15 21:55:13,129 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:13,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -666194943, now seen corresponding path program 3 times [2020-10-15 21:55:13,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:13,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119913465] [2020-10-15 21:55:13,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:55:13,593 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-15 21:55:13,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119913465] [2020-10-15 21:55:13,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:55:13,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-15 21:55:13,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062821631] [2020-10-15 21:55:13,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-15 21:55:13,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:55:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-15 21:55:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-15 21:55:13,595 INFO L87 Difference]: Start difference. First operand 214 states and 543 transitions. Second operand 9 states. [2020-10-15 21:55:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:55:13,989 INFO L93 Difference]: Finished difference Result 340 states and 834 transitions. [2020-10-15 21:55:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:55:13,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-10-15 21:55:13,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:55:13,991 INFO L225 Difference]: With dead ends: 340 [2020-10-15 21:55:13,991 INFO L226 Difference]: Without dead ends: 231 [2020-10-15 21:55:13,992 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2020-10-15 21:55:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-10-15 21:55:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 168. [2020-10-15 21:55:13,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-15 21:55:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-10-15 21:55:13,997 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-10-15 21:55:13,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:55:13,997 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-10-15 21:55:13,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-15 21:55:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-10-15 21:55:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-15 21:55:13,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:55:13,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:55:13,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-15 21:55:13,998 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:55:13,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:55:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1540373759, now seen corresponding path program 4 times [2020-10-15 21:55:13,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:55:13,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361135378] [2020-10-15 21:55:13,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:55:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:55:14,055 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:55:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:55:14,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:55:14,193 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 21:55:14,194 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 21:55:14,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-15 21:55:14,195 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 21:55:14,211 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1065] [1065] L2-->L851: Formula: (let ((.cse6 (= (mod ~y$w_buff1_used~0_In1243221728 256) 0)) (.cse7 (= (mod ~y$r_buff1_thd0~0_In1243221728 256) 0)) (.cse9 (= 0 (mod ~y$w_buff0_used~0_In1243221728 256))) (.cse8 (= (mod ~y$r_buff0_thd0~0_In1243221728 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse2 (not .cse7)) (.cse3 (not .cse6)) (.cse1 (or .cse6 .cse7))) (and (or (and .cse0 (or (and (= ~y~0_Out1243221728 ~y~0_In1243221728) .cse1) (and .cse2 .cse3 (= ~y~0_Out1243221728 ~y$w_buff1~0_In1243221728)))) (and .cse4 (= ~y~0_Out1243221728 ~y$w_buff0~0_In1243221728) .cse5)) (or (and .cse0 (= ~y$w_buff0_used~0_In1243221728 ~y$w_buff0_used~0_Out1243221728)) (and (= ~y$w_buff0_used~0_Out1243221728 0) .cse4 .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1243221728 0)) (= ~y$r_buff0_thd0~0_In1243221728 ~y$r_buff0_thd0~0_Out1243221728) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1243221728 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1243221728|) (or (and (= ~y$w_buff1_used~0_Out1243221728 0) .cse2 .cse3) (and .cse1 (= ~y$w_buff1_used~0_In1243221728 ~y$w_buff1_used~0_Out1243221728))) (= ~y$r_buff1_thd0~0_Out1243221728 ~y$r_buff1_thd0~0_In1243221728)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1243221728|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1243221728, ~y$w_buff1~0=~y$w_buff1~0_In1243221728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1243221728, ~y$w_buff0~0=~y$w_buff0~0_In1243221728, ~y~0=~y~0_In1243221728, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1243221728, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1243221728} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1243221728, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1243221728|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1243221728|, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1243221728|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1243221728|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1243221728|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1243221728|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1243221728|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1243221728, ~y$w_buff1~0=~y$w_buff1~0_In1243221728, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1243221728, ~y$w_buff0~0=~y$w_buff0~0_In1243221728, ~y~0=~y~0_Out1243221728, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1243221728, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1243221728} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-15 21:55:14,224 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-15 21:55:14,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,226 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-15 21:55:14,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,226 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-15 21:55:14,226 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,226 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-15 21:55:14,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,227 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-15 21:55:14,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,227 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-15 21:55:14,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,227 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-15 21:55:14,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,230 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-15 21:55:14,230 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,230 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-15 21:55:14,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,231 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-15 21:55:14,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,231 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-15 21:55:14,231 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,231 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-15 21:55:14,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,232 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-15 21:55:14,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,232 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-15 21:55:14,232 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,232 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-15 21:55:14,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,233 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-15 21:55:14,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,233 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-15 21:55:14,233 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,233 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-15 21:55:14,234 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,239 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-15 21:55:14,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,240 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-15 21:55:14,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,240 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-15 21:55:14,240 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,241 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-15 21:55:14,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,241 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-15 21:55:14,241 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,242 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-15 21:55:14,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,242 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-15 21:55:14,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,242 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-15 21:55:14,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,243 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-15 21:55:14,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,243 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-15 21:55:14,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,243 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-15 21:55:14,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,244 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-15 21:55:14,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,244 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-15 21:55:14,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:55:14,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:55:14 BasicIcfg [2020-10-15 21:55:14,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 21:55:14,346 INFO L168 Benchmark]: Toolchain (without parser) took 20121.63 ms. Allocated memory was 253.2 MB in the beginning and 627.6 MB in the end (delta: 374.3 MB). Free memory was 208.6 MB in the beginning and 317.3 MB in the end (delta: -108.7 MB). Peak memory consumption was 265.7 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,347 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:55:14,347 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.49 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.6 MB in the beginning and 270.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.52 ms. Allocated memory is still 319.8 MB. Free memory was 270.0 MB in the beginning and 267.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,348 INFO L168 Benchmark]: Boogie Preprocessor took 44.48 ms. Allocated memory is still 319.8 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,349 INFO L168 Benchmark]: RCFGBuilder took 2067.61 ms. Allocated memory was 319.8 MB in the beginning and 361.2 MB in the end (delta: 41.4 MB). Free memory was 265.0 MB in the beginning and 182.1 MB in the end (delta: 82.9 MB). Peak memory consumption was 124.3 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,350 INFO L168 Benchmark]: TraceAbstraction took 17203.75 ms. Allocated memory was 361.2 MB in the beginning and 627.6 MB in the end (delta: 266.3 MB). Free memory was 182.1 MB in the beginning and 317.3 MB in the end (delta: -135.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 14.2 GB. [2020-10-15 21:55:14,356 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 728.49 ms. Allocated memory was 253.2 MB in the beginning and 319.8 MB in the end (delta: 66.6 MB). Free memory was 208.6 MB in the beginning and 270.0 MB in the end (delta: -61.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 71.52 ms. Allocated memory is still 319.8 MB. Free memory was 270.0 MB in the beginning and 267.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 44.48 ms. Allocated memory is still 319.8 MB. Free memory was 267.5 MB in the beginning and 265.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2067.61 ms. Allocated memory was 319.8 MB in the beginning and 361.2 MB in the end (delta: 41.4 MB). Free memory was 265.0 MB in the beginning and 182.1 MB in the end (delta: 82.9 MB). Peak memory consumption was 124.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17203.75 ms. Allocated memory was 361.2 MB in the beginning and 627.6 MB in the end (delta: 266.3 MB). Free memory was 182.1 MB in the beginning and 317.3 MB in the end (delta: -135.2 MB). Peak memory consumption was 131.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1880 VarBasedMoverChecksPositive, 110 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 254 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.3s, 121 PlacesBefore, 46 PlacesAfterwards, 110 TransitionsBefore, 34 TransitionsAfterwards, 2572 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 7693 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff0_thd4; [L719] 0 _Bool y$r_buff1_thd0; [L720] 0 _Bool y$r_buff1_thd1; [L721] 0 _Bool y$r_buff1_thd2; [L722] 0 _Bool y$r_buff1_thd3; [L723] 0 _Bool y$r_buff1_thd4; [L724] 0 _Bool y$read_delayed; [L725] 0 int *y$read_delayed_var; [L726] 0 int y$w_buff0; [L727] 0 _Bool y$w_buff0_used; [L728] 0 int y$w_buff1; [L729] 0 _Bool y$w_buff1_used; [L731] 0 int z = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t813; [L834] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t814; [L836] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t815; [L838] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 3 y$w_buff1 = y$w_buff0 [L773] 3 y$w_buff0 = 2 [L774] 3 y$w_buff1_used = y$w_buff0_used [L775] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L777] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L778] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L779] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L780] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L781] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L782] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 pthread_t t816; [L840] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L811] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L811] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L812] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L812] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L813] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L814] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L815] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L815] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L737] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L762] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L788] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L789] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L790] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L792] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L765] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 2 return 0; [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] 0 y$mem_tmp = y [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L858] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L859] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L860] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L863] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L865] 0 y = y$flush_delayed ? y$mem_tmp : y [L866] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 109 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 675 SDtfs, 806 SDslu, 1154 SDs, 0 SdLazy, 535 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 890 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 57082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...