/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:45:02,015 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:45:02,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:45:02,082 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:45:02,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:45:02,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:45:02,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:45:02,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:45:02,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:45:02,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:45:02,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:45:02,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:45:02,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:45:02,122 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:45:02,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:45:02,125 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:45:02,126 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:45:02,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:45:02,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:45:02,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:45:02,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:45:02,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:45:02,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:45:02,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:45:02,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:45:02,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:45:02,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:45:02,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:45:02,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:45:02,147 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:45:02,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:45:02,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:45:02,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:45:02,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:45:02,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:45:02,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:45:02,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:45:02,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:45:02,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:45:02,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:45:02,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:45:02,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:45:02,184 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:45:02,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:45:02,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:45:02,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:45:02,186 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:45:02,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:45:02,187 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:45:02,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:45:02,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:45:02,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:45:02,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:45:02,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:45:02,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:45:02,189 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:45:02,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:45:02,189 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:45:02,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:45:02,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:45:02,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:45:02,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:45:02,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:45:02,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:45:02,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:45:02,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:45:02,191 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:45:02,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:45:02,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:45:02,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:45:02,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:45:02,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 12:45:02,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:45:02,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:45:02,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:45:02,611 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:45:02,612 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:45:02,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-11-09 12:45:02,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e6fd18/1444053798c54b7fa0365ce73c2e7e01/FLAG71fa4818f [2020-11-09 12:45:03,511 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:45:03,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2020-11-09 12:45:03,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e6fd18/1444053798c54b7fa0365ce73c2e7e01/FLAG71fa4818f [2020-11-09 12:45:03,737 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e6fd18/1444053798c54b7fa0365ce73c2e7e01 [2020-11-09 12:45:03,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:45:03,756 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:45:03,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:45:03,760 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:45:03,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:45:03,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:45:03" (1/1) ... [2020-11-09 12:45:03,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420c295a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:03, skipping insertion in model container [2020-11-09 12:45:03,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:45:03" (1/1) ... [2020-11-09 12:45:03,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:45:03,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:45:04,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:45:04,483 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:45:04,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:45:04,782 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:45:04,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04 WrapperNode [2020-11-09 12:45:04,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:45:04,784 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:45:04,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:45:04,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:45:04,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:45:04,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:45:04,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:45:04,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:45:04,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (1/1) ... [2020-11-09 12:45:04,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:45:04,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:45:04,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:45:04,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:45:04,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (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-11-09 12:45:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:45:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:45:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:45:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:45:05,036 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:45:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:45:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:45:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:45:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:45:05,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:45:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:45:05,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:45:05,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:45:05,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:45:05,041 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:45:07,424 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:45:07,425 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:45:07,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:45:07 BoogieIcfgContainer [2020-11-09 12:45:07,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:45:07,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:45:07,429 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:45:07,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:45:07,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:45:03" (1/3) ... [2020-11-09 12:45:07,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32574dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:45:07, skipping insertion in model container [2020-11-09 12:45:07,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:45:04" (2/3) ... [2020-11-09 12:45:07,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32574dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:45:07, skipping insertion in model container [2020-11-09 12:45:07,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:45:07" (3/3) ... [2020-11-09 12:45:07,436 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2020-11-09 12:45:07,453 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:45:07,453 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:45:07,456 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:45:07,457 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:45:07,506 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,507 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,508 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,509 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,511 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,516 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,516 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,517 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,517 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,519 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,522 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,525 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,529 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,533 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,534 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,534 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,535 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,537 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,537 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,538 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:45:07,540 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:45:07,552 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 12:45:07,576 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:45:07,576 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:45:07,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:45:07,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:45:07,576 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:45:07,603 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:45:07,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:45:07,606 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:45:07,619 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:45:07,622 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 12:45:07,625 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-11-09 12:45:07,627 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-11-09 12:45:07,675 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-11-09 12:45:07,675 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:45:07,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-11-09 12:45:07,683 INFO L116 LiptonReduction]: Number of co-enabled transitions 1870 [2020-11-09 12:45:07,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:45:07,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:07,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:07,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:45:07,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:07,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:07,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:07,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:07,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:07,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:07,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:07,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:07,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:07,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:07,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:07,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:07,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:07,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:07,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:07,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:08,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:08,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:08,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:08,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:08,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:08,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:08,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:08,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:45:08,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:08,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:08,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:45:08,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:08,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:08,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:08,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:08,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:08,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:08,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:08,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:08,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:08,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:08,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:08,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:08,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:08,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:08,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:08,757 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 12:45:08,861 WARN L194 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 12:45:09,009 WARN L194 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 12:45:09,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:09,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:09,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:09,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:09,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:09,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:09,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:09,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:09,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:09,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:09,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:09,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:45:09,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:09,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 12:45:09,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:09,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:09,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:09,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:09,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:09,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:09,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:09,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:09,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-09 12:45:09,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 12:45:09,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:09,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:09,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:09,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-09 12:45:09,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 12:45:09,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:11,609 WARN L194 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-11-09 12:45:11,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-11-09 12:45:11,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:11,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 12:45:11,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:12,489 WARN L194 SmtUtils]: Spent 846.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-11-09 12:45:14,638 WARN L194 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 310 DAG size of output: 265 [2020-11-09 12:45:14,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:45:14,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:45:14,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:45:14,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:45:14,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:14,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:14,684 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-09 12:45:14,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 12:45:14,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,698 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-11-09 12:45:14,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 12:45:14,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:45:14,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:14,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:45:14,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:14,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:45:14,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,524 WARN L194 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 355 DAG size of output: 269 [2020-11-09 12:45:18,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:18,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:18,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:18,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:18,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:19,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:45:19,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:19,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:19,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 4, 3, 1] term [2020-11-09 12:45:19,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-09 12:45:19,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:19,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:19,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:19,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:19,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:19,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:45:19,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:20,196 WARN L194 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 12:45:20,319 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:45:20,886 WARN L194 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 12:45:20,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:45:20,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,334 WARN L194 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 12:45:21,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:21,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:21,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:21,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:21,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:21,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:21,844 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:21,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:21,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:21,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:21,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:45:22,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:45:22,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:45:22,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:22,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:45:22,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:45:23,007 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 12:45:23,203 WARN L194 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-11-09 12:45:24,400 WARN L194 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 12:45:24,596 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 12:45:25,060 WARN L194 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-11-09 12:45:25,271 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-11-09 12:45:25,283 INFO L131 LiptonReduction]: Checked pairs total: 4899 [2020-11-09 12:45:25,284 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-11-09 12:45:25,293 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2020-11-09 12:45:25,407 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2020-11-09 12:45:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2020-11-09 12:45:25,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-09 12:45:25,415 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:25,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-09 12:45:25,418 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:25,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1090369, now seen corresponding path program 1 times [2020-11-09 12:45:25,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:25,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807887483] [2020-11-09 12:45:25,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:25,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807887483] [2020-11-09 12:45:25,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:25,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:45:25,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034415487] [2020-11-09 12:45:25,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:45:25,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:25,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:45:25,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:45:25,727 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2020-11-09 12:45:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:25,842 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-11-09 12:45:25,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:45:25,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-09 12:45:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:25,875 INFO L225 Difference]: With dead ends: 812 [2020-11-09 12:45:25,876 INFO L226 Difference]: Without dead ends: 687 [2020-11-09 12:45:25,877 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-11-09 12:45:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2020-11-09 12:45:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2020-11-09 12:45:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2020-11-09 12:45:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2020-11-09 12:45:25,981 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2020-11-09 12:45:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:25,982 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2020-11-09 12:45:25,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:45:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2020-11-09 12:45:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 12:45:25,984 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:25,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:25,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:45:25,985 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:25,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:25,986 INFO L82 PathProgramCache]: Analyzing trace with hash -369742601, now seen corresponding path program 1 times [2020-11-09 12:45:25,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:25,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061511710] [2020-11-09 12:45:25,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:26,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:26,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061511710] [2020-11-09 12:45:26,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:26,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:45:26,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466881654] [2020-11-09 12:45:26,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:45:26,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:45:26,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:45:26,188 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2020-11-09 12:45:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:26,235 INFO L93 Difference]: Finished difference Result 762 states and 2295 transitions. [2020-11-09 12:45:26,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:45:26,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-11-09 12:45:26,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:26,243 INFO L225 Difference]: With dead ends: 762 [2020-11-09 12:45:26,243 INFO L226 Difference]: Without dead ends: 637 [2020-11-09 12:45:26,244 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-11-09 12:45:26,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2020-11-09 12:45:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2020-11-09 12:45:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2020-11-09 12:45:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2020-11-09 12:45:26,282 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 10 [2020-11-09 12:45:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:26,283 INFO L481 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2020-11-09 12:45:26,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:45:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2020-11-09 12:45:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:45:26,289 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:26,289 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:26,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:45:26,290 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:26,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:26,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1422878312, now seen corresponding path program 1 times [2020-11-09 12:45:26,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:26,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228800263] [2020-11-09 12:45:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:26,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228800263] [2020-11-09 12:45:26,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:26,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:45:26,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946415641] [2020-11-09 12:45:26,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:45:26,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:45:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:45:26,488 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand 5 states. [2020-11-09 12:45:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:26,573 INFO L93 Difference]: Finished difference Result 837 states and 2540 transitions. [2020-11-09 12:45:26,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:26,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 12:45:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:26,577 INFO L225 Difference]: With dead ends: 837 [2020-11-09 12:45:26,577 INFO L226 Difference]: Without dead ends: 437 [2020-11-09 12:45:26,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:45:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-11-09 12:45:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-11-09 12:45:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-11-09 12:45:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1270 transitions. [2020-11-09 12:45:26,594 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1270 transitions. Word has length 11 [2020-11-09 12:45:26,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:26,595 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1270 transitions. [2020-11-09 12:45:26,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:45:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1270 transitions. [2020-11-09 12:45:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:45:26,599 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:26,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:26,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:45:26,600 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:26,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1591368352, now seen corresponding path program 1 times [2020-11-09 12:45:26,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:26,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21180962] [2020-11-09 12:45:26,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:26,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21180962] [2020-11-09 12:45:26,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:26,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:45:26,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349331509] [2020-11-09 12:45:26,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:45:26,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:26,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:45:26,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:45:26,785 INFO L87 Difference]: Start difference. First operand 437 states and 1270 transitions. Second operand 4 states. [2020-11-09 12:45:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:26,887 INFO L93 Difference]: Finished difference Result 491 states and 1384 transitions. [2020-11-09 12:45:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:45:26,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 12:45:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:26,894 INFO L225 Difference]: With dead ends: 491 [2020-11-09 12:45:26,895 INFO L226 Difference]: Without dead ends: 431 [2020-11-09 12:45:26,895 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-11-09 12:45:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2020-11-09 12:45:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2020-11-09 12:45:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2020-11-09 12:45:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2020-11-09 12:45:26,910 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2020-11-09 12:45:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:26,911 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2020-11-09 12:45:26,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:45:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2020-11-09 12:45:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:45:26,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:26,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:26,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:45:26,913 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:26,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:26,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1726102075, now seen corresponding path program 1 times [2020-11-09 12:45:26,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:26,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835459941] [2020-11-09 12:45:26,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:27,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835459941] [2020-11-09 12:45:27,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:27,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:45:27,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595550556] [2020-11-09 12:45:27,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:45:27,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:45:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:45:27,229 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 6 states. [2020-11-09 12:45:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:27,437 INFO L93 Difference]: Finished difference Result 493 states and 1398 transitions. [2020-11-09 12:45:27,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:27,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 12:45:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:27,442 INFO L225 Difference]: With dead ends: 493 [2020-11-09 12:45:27,442 INFO L226 Difference]: Without dead ends: 445 [2020-11-09 12:45:27,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-11-09 12:45:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-11-09 12:45:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-11-09 12:45:27,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1290 transitions. [2020-11-09 12:45:27,457 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1290 transitions. Word has length 14 [2020-11-09 12:45:27,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:27,458 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1290 transitions. [2020-11-09 12:45:27,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:45:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1290 transitions. [2020-11-09 12:45:27,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:45:27,459 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:27,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:27,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:45:27,459 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:27,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1422304353, now seen corresponding path program 2 times [2020-11-09 12:45:27,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:27,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653789393] [2020-11-09 12:45:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:27,697 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653789393] [2020-11-09 12:45:27,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:27,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:45:27,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467069466] [2020-11-09 12:45:27,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:45:27,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:45:27,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:45:27,699 INFO L87 Difference]: Start difference. First operand 445 states and 1290 transitions. Second operand 6 states. [2020-11-09 12:45:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:27,831 INFO L93 Difference]: Finished difference Result 525 states and 1490 transitions. [2020-11-09 12:45:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:27,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 12:45:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:27,839 INFO L225 Difference]: With dead ends: 525 [2020-11-09 12:45:27,840 INFO L226 Difference]: Without dead ends: 473 [2020-11-09 12:45:27,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:27,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2020-11-09 12:45:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2020-11-09 12:45:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2020-11-09 12:45:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1370 transitions. [2020-11-09 12:45:27,879 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 1370 transitions. Word has length 14 [2020-11-09 12:45:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:27,880 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 1370 transitions. [2020-11-09 12:45:27,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:45:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 1370 transitions. [2020-11-09 12:45:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:45:27,881 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:27,882 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:27,882 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:45:27,882 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2087735349, now seen corresponding path program 1 times [2020-11-09 12:45:27,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:27,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28994208] [2020-11-09 12:45:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:28,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:28,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28994208] [2020-11-09 12:45:28,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:28,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:45:28,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761642617] [2020-11-09 12:45:28,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:45:28,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:28,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:45:28,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:45:28,016 INFO L87 Difference]: Start difference. First operand 473 states and 1370 transitions. Second operand 5 states. [2020-11-09 12:45:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:28,149 INFO L93 Difference]: Finished difference Result 525 states and 1491 transitions. [2020-11-09 12:45:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:28,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 12:45:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:28,155 INFO L225 Difference]: With dead ends: 525 [2020-11-09 12:45:28,155 INFO L226 Difference]: Without dead ends: 480 [2020-11-09 12:45:28,156 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-11-09 12:45:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2020-11-09 12:45:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2020-11-09 12:45:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2020-11-09 12:45:28,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1378 transitions. [2020-11-09 12:45:28,177 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1378 transitions. Word has length 14 [2020-11-09 12:45:28,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:28,178 INFO L481 AbstractCegarLoop]: Abstraction has 476 states and 1378 transitions. [2020-11-09 12:45:28,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:45:28,178 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1378 transitions. [2020-11-09 12:45:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:45:28,179 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:28,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:28,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:45:28,180 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:28,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1733371513, now seen corresponding path program 2 times [2020-11-09 12:45:28,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:28,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890943363] [2020-11-09 12:45:28,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:28,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890943363] [2020-11-09 12:45:28,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:28,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:45:28,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103243160] [2020-11-09 12:45:28,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:45:28,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:28,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:45:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:45:28,328 INFO L87 Difference]: Start difference. First operand 476 states and 1378 transitions. Second operand 6 states. [2020-11-09 12:45:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:28,492 INFO L93 Difference]: Finished difference Result 507 states and 1437 transitions. [2020-11-09 12:45:28,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:28,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 12:45:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:28,497 INFO L225 Difference]: With dead ends: 507 [2020-11-09 12:45:28,497 INFO L226 Difference]: Without dead ends: 462 [2020-11-09 12:45:28,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2020-11-09 12:45:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 455. [2020-11-09 12:45:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2020-11-09 12:45:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 1310 transitions. [2020-11-09 12:45:28,519 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 1310 transitions. Word has length 14 [2020-11-09 12:45:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:28,519 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 1310 transitions. [2020-11-09 12:45:28,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:45:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 1310 transitions. [2020-11-09 12:45:28,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:45:28,520 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:28,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:28,521 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:45:28,521 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:28,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1970989686, now seen corresponding path program 1 times [2020-11-09 12:45:28,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:28,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020384980] [2020-11-09 12:45:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:28,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020384980] [2020-11-09 12:45:28,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:28,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:28,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818449884] [2020-11-09 12:45:28,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:45:28,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:45:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:28,938 INFO L87 Difference]: Start difference. First operand 455 states and 1310 transitions. Second operand 7 states. [2020-11-09 12:45:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:29,141 INFO L93 Difference]: Finished difference Result 479 states and 1350 transitions. [2020-11-09 12:45:29,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:29,142 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 12:45:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:29,147 INFO L225 Difference]: With dead ends: 479 [2020-11-09 12:45:29,147 INFO L226 Difference]: Without dead ends: 447 [2020-11-09 12:45:29,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:45:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2020-11-09 12:45:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 415. [2020-11-09 12:45:29,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-11-09 12:45:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1186 transitions. [2020-11-09 12:45:29,168 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1186 transitions. Word has length 15 [2020-11-09 12:45:29,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:29,168 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 1186 transitions. [2020-11-09 12:45:29,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:45:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1186 transitions. [2020-11-09 12:45:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:45:29,170 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:29,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:29,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:45:29,170 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1141718676, now seen corresponding path program 1 times [2020-11-09 12:45:29,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:29,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784036432] [2020-11-09 12:45:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:29,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784036432] [2020-11-09 12:45:29,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:29,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:29,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394133663] [2020-11-09 12:45:29,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:45:29,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:29,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:45:29,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:29,365 INFO L87 Difference]: Start difference. First operand 415 states and 1186 transitions. Second operand 7 states. [2020-11-09 12:45:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:29,677 INFO L93 Difference]: Finished difference Result 505 states and 1423 transitions. [2020-11-09 12:45:29,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:45:29,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 12:45:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:29,684 INFO L225 Difference]: With dead ends: 505 [2020-11-09 12:45:29,684 INFO L226 Difference]: Without dead ends: 459 [2020-11-09 12:45:29,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:45:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2020-11-09 12:45:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 437. [2020-11-09 12:45:29,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-11-09 12:45:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1255 transitions. [2020-11-09 12:45:29,708 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1255 transitions. Word has length 15 [2020-11-09 12:45:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:29,708 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1255 transitions. [2020-11-09 12:45:29,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:45:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1255 transitions. [2020-11-09 12:45:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:45:29,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:29,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:29,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:45:29,710 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:29,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:29,711 INFO L82 PathProgramCache]: Analyzing trace with hash 295266136, now seen corresponding path program 2 times [2020-11-09 12:45:29,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:29,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997417505] [2020-11-09 12:45:29,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:29,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997417505] [2020-11-09 12:45:29,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:29,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:29,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722906202] [2020-11-09 12:45:29,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:45:29,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:29,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:45:29,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:29,896 INFO L87 Difference]: Start difference. First operand 437 states and 1255 transitions. Second operand 7 states. [2020-11-09 12:45:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:30,164 INFO L93 Difference]: Finished difference Result 522 states and 1473 transitions. [2020-11-09 12:45:30,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:45:30,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 12:45:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:30,171 INFO L225 Difference]: With dead ends: 522 [2020-11-09 12:45:30,171 INFO L226 Difference]: Without dead ends: 482 [2020-11-09 12:45:30,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-11-09 12:45:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-09 12:45:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 440. [2020-11-09 12:45:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-09 12:45:30,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1261 transitions. [2020-11-09 12:45:30,189 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1261 transitions. Word has length 15 [2020-11-09 12:45:30,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:30,190 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1261 transitions. [2020-11-09 12:45:30,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:45:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1261 transitions. [2020-11-09 12:45:30,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:45:30,191 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:30,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:30,191 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:45:30,192 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:30,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:30,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2100078188, now seen corresponding path program 3 times [2020-11-09 12:45:30,192 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:30,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826775422] [2020-11-09 12:45:30,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:30,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:30,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826775422] [2020-11-09 12:45:30,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:30,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:30,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659214827] [2020-11-09 12:45:30,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:45:30,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:30,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:45:30,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:30,394 INFO L87 Difference]: Start difference. First operand 440 states and 1261 transitions. Second operand 7 states. [2020-11-09 12:45:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:30,683 INFO L93 Difference]: Finished difference Result 582 states and 1653 transitions. [2020-11-09 12:45:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:45:30,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 12:45:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:30,688 INFO L225 Difference]: With dead ends: 582 [2020-11-09 12:45:30,688 INFO L226 Difference]: Without dead ends: 530 [2020-11-09 12:45:30,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:45:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-09 12:45:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 463. [2020-11-09 12:45:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2020-11-09 12:45:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1319 transitions. [2020-11-09 12:45:30,705 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 1319 transitions. Word has length 15 [2020-11-09 12:45:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:30,706 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 1319 transitions. [2020-11-09 12:45:30,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:45:30,706 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 1319 transitions. [2020-11-09 12:45:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:45:30,707 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:30,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:30,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:45:30,707 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:30,708 INFO L82 PathProgramCache]: Analyzing trace with hash -928109409, now seen corresponding path program 1 times [2020-11-09 12:45:30,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:30,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651879226] [2020-11-09 12:45:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:31,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651879226] [2020-11-09 12:45:31,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:31,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:45:31,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875149535] [2020-11-09 12:45:31,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:45:31,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:31,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:45:31,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:45:31,071 INFO L87 Difference]: Start difference. First operand 463 states and 1319 transitions. Second operand 8 states. [2020-11-09 12:45:31,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:31,430 INFO L93 Difference]: Finished difference Result 828 states and 2316 transitions. [2020-11-09 12:45:31,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:45:31,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-09 12:45:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:31,437 INFO L225 Difference]: With dead ends: 828 [2020-11-09 12:45:31,437 INFO L226 Difference]: Without dead ends: 800 [2020-11-09 12:45:31,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:45:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2020-11-09 12:45:31,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 487. [2020-11-09 12:45:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2020-11-09 12:45:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 1384 transitions. [2020-11-09 12:45:31,461 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 1384 transitions. Word has length 16 [2020-11-09 12:45:31,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:31,462 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 1384 transitions. [2020-11-09 12:45:31,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:45:31,462 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 1384 transitions. [2020-11-09 12:45:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:45:31,463 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:31,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:31,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:45:31,463 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash -928102682, now seen corresponding path program 1 times [2020-11-09 12:45:31,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:31,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111331647] [2020-11-09 12:45:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:31,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111331647] [2020-11-09 12:45:31,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:31,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:45:31,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905784257] [2020-11-09 12:45:31,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:45:31,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:31,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:45:31,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:45:31,961 INFO L87 Difference]: Start difference. First operand 487 states and 1384 transitions. Second operand 8 states. [2020-11-09 12:45:32,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:32,252 INFO L93 Difference]: Finished difference Result 893 states and 2461 transitions. [2020-11-09 12:45:32,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:45:32,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-09 12:45:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:32,259 INFO L225 Difference]: With dead ends: 893 [2020-11-09 12:45:32,259 INFO L226 Difference]: Without dead ends: 813 [2020-11-09 12:45:32,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:45:32,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2020-11-09 12:45:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 575. [2020-11-09 12:45:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-11-09 12:45:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1622 transitions. [2020-11-09 12:45:32,282 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1622 transitions. Word has length 16 [2020-11-09 12:45:32,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:32,282 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 1622 transitions. [2020-11-09 12:45:32,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:45:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1622 transitions. [2020-11-09 12:45:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:45:32,284 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:32,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:32,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:45:32,285 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash -928533210, now seen corresponding path program 1 times [2020-11-09 12:45:32,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:32,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117541367] [2020-11-09 12:45:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:32,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117541367] [2020-11-09 12:45:32,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:32,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:32,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869937807] [2020-11-09 12:45:32,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:45:32,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:45:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:45:32,458 INFO L87 Difference]: Start difference. First operand 575 states and 1622 transitions. Second operand 7 states. [2020-11-09 12:45:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:32,729 INFO L93 Difference]: Finished difference Result 1045 states and 2888 transitions. [2020-11-09 12:45:32,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:45:32,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 12:45:32,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:32,739 INFO L225 Difference]: With dead ends: 1045 [2020-11-09 12:45:32,739 INFO L226 Difference]: Without dead ends: 767 [2020-11-09 12:45:32,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-09 12:45:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-11-09 12:45:32,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 577. [2020-11-09 12:45:32,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2020-11-09 12:45:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1581 transitions. [2020-11-09 12:45:32,762 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1581 transitions. Word has length 16 [2020-11-09 12:45:32,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:32,764 INFO L481 AbstractCegarLoop]: Abstraction has 577 states and 1581 transitions. [2020-11-09 12:45:32,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:45:32,764 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1581 transitions. [2020-11-09 12:45:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:45:32,766 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:32,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:32,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:45:32,766 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:32,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:32,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1171739132, now seen corresponding path program 2 times [2020-11-09 12:45:32,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:32,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053791907] [2020-11-09 12:45:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:32,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053791907] [2020-11-09 12:45:32,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:32,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:45:32,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734056937] [2020-11-09 12:45:32,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:45:32,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:32,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:45:32,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:45:32,853 INFO L87 Difference]: Start difference. First operand 577 states and 1581 transitions. Second operand 4 states. [2020-11-09 12:45:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:32,892 INFO L93 Difference]: Finished difference Result 552 states and 1345 transitions. [2020-11-09 12:45:32,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:45:32,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-09 12:45:32,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:32,896 INFO L225 Difference]: With dead ends: 552 [2020-11-09 12:45:32,896 INFO L226 Difference]: Without dead ends: 417 [2020-11-09 12:45:32,897 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-11-09 12:45:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-11-09 12:45:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2020-11-09 12:45:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2020-11-09 12:45:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1004 transitions. [2020-11-09 12:45:32,911 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 1004 transitions. Word has length 16 [2020-11-09 12:45:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:32,911 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 1004 transitions. [2020-11-09 12:45:32,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:45:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 1004 transitions. [2020-11-09 12:45:32,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 12:45:32,912 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:32,912 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:32,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:45:32,913 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:32,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:32,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1009884994, now seen corresponding path program 1 times [2020-11-09 12:45:32,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:32,913 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944446897] [2020-11-09 12:45:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:32,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944446897] [2020-11-09 12:45:32,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:32,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:45:32,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399747375] [2020-11-09 12:45:32,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:45:32,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:45:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:45:32,996 INFO L87 Difference]: Start difference. First operand 417 states and 1004 transitions. Second operand 5 states. [2020-11-09 12:45:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:33,049 INFO L93 Difference]: Finished difference Result 339 states and 735 transitions. [2020-11-09 12:45:33,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:45:33,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-09 12:45:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:33,052 INFO L225 Difference]: With dead ends: 339 [2020-11-09 12:45:33,052 INFO L226 Difference]: Without dead ends: 263 [2020-11-09 12:45:33,053 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-11-09 12:45:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2020-11-09 12:45:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2020-11-09 12:45:33,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2020-11-09 12:45:33,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 531 transitions. [2020-11-09 12:45:33,061 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 531 transitions. Word has length 17 [2020-11-09 12:45:33,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:33,061 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 531 transitions. [2020-11-09 12:45:33,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:45:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 531 transitions. [2020-11-09 12:45:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:45:33,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:33,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:33,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 12:45:33,063 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash 461994248, now seen corresponding path program 1 times [2020-11-09 12:45:33,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:33,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96036086] [2020-11-09 12:45:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:33,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96036086] [2020-11-09 12:45:33,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:33,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:45:33,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14003286] [2020-11-09 12:45:33,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:45:33,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:45:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:45:33,659 INFO L87 Difference]: Start difference. First operand 254 states and 531 transitions. Second operand 9 states. [2020-11-09 12:45:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:34,036 INFO L93 Difference]: Finished difference Result 280 states and 568 transitions. [2020-11-09 12:45:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 12:45:34,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2020-11-09 12:45:34,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:34,040 INFO L225 Difference]: With dead ends: 280 [2020-11-09 12:45:34,054 INFO L226 Difference]: Without dead ends: 224 [2020-11-09 12:45:34,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-11-09 12:45:34,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-09 12:45:34,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 176. [2020-11-09 12:45:34,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-11-09 12:45:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-11-09 12:45:34,060 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 19 [2020-11-09 12:45:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:34,061 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-11-09 12:45:34,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:45:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-11-09 12:45:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-09 12:45:34,062 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:34,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:34,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 12:45:34,062 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash -660289219, now seen corresponding path program 1 times [2020-11-09 12:45:34,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:34,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879323499] [2020-11-09 12:45:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:45:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:45:34,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879323499] [2020-11-09 12:45:34,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:45:34,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:45:34,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922563151] [2020-11-09 12:45:34,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:45:34,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:45:34,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:45:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:45:34,153 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-11-09 12:45:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:45:34,210 INFO L93 Difference]: Finished difference Result 155 states and 325 transitions. [2020-11-09 12:45:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:45:34,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-09 12:45:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:45:34,212 INFO L225 Difference]: With dead ends: 155 [2020-11-09 12:45:34,212 INFO L226 Difference]: Without dead ends: 104 [2020-11-09 12:45:34,212 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-11-09 12:45:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-09 12:45:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-11-09 12:45:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-11-09 12:45:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 208 transitions. [2020-11-09 12:45:34,215 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 208 transitions. Word has length 19 [2020-11-09 12:45:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:45:34,216 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 208 transitions. [2020-11-09 12:45:34,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:45:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 208 transitions. [2020-11-09 12:45:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-09 12:45:34,216 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:45:34,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:45:34,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 12:45:34,217 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:45:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:45:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2015795615, now seen corresponding path program 1 times [2020-11-09 12:45:34,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:45:34,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946989995] [2020-11-09 12:45:34,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:45:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:45:34,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:45:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:45:34,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:45:34,374 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:45:34,375 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:45:34,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-09 12:45:34,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:45:34 BasicIcfg [2020-11-09 12:45:34,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:45:34,510 INFO L168 Benchmark]: Toolchain (without parser) took 30763.78 ms. Allocated memory was 151.0 MB in the beginning and 396.4 MB in the end (delta: 245.4 MB). Free memory was 124.5 MB in the beginning and 303.1 MB in the end (delta: -178.5 MB). Peak memory consumption was 67.6 MB. Max. memory is 8.0 GB. [2020-11-09 12:45:34,511 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 122.8 MB in the end (delta: 77.4 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:45:34,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1024.51 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 124.4 MB in the end (delta: -468.1 kB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. [2020-11-09 12:45:34,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 121.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:45:34,512 INFO L168 Benchmark]: Boogie Preprocessor took 82.89 ms. Allocated memory is still 151.0 MB. Free memory was 121.3 MB in the beginning and 119.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:45:34,513 INFO L168 Benchmark]: RCFGBuilder took 2481.17 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 119.2 MB in the beginning and 80.6 MB in the end (delta: 38.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 8.0 GB. [2020-11-09 12:45:34,513 INFO L168 Benchmark]: TraceAbstraction took 27077.40 ms. Allocated memory was 181.4 MB in the beginning and 396.4 MB in the end (delta: 215.0 MB). Free memory was 80.1 MB in the beginning and 303.1 MB in the end (delta: -223.0 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:45:34,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 151.0 MB. Free memory was 122.9 MB in the beginning and 122.8 MB in the end (delta: 77.4 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1024.51 ms. Allocated memory is still 151.0 MB. Free memory was 124.0 MB in the beginning and 124.4 MB in the end (delta: -468.1 kB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 77.19 ms. Allocated memory is still 151.0 MB. Free memory was 124.4 MB in the beginning and 121.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 82.89 ms. Allocated memory is still 151.0 MB. Free memory was 121.3 MB in the beginning and 119.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2481.17 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 119.2 MB in the beginning and 80.6 MB in the end (delta: 38.6 MB). Peak memory consumption was 79.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27077.40 ms. Allocated memory was 181.4 MB in the beginning and 396.4 MB in the end (delta: 215.0 MB). Free memory was 80.1 MB in the beginning and 303.1 MB in the end (delta: -223.0 MB). There was no memory consumed. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1325 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 170 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.6s, 108 PlacesBefore, 37 PlacesAfterwards, 101 TransitionsBefore, 28 TransitionsAfterwards, 1870 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 89 TotalNumberOfCompositions, 4899 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2031; [L819] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2032; [L821] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2033; [L823] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L793] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe011_pso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 26.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.8s, HoareTripleCheckerStatistics: 540 SDtfs, 784 SDslu, 1301 SDs, 0 SdLazy, 811 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 972 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 56285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...