/usr/bin/java -Xmx16000000000 -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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 06:15:32,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 06:15:32,868 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 06:15:32,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 06:15:32,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 06:15:32,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 06:15:32,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 06:15:32,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 06:15:32,929 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 06:15:32,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 06:15:32,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 06:15:32,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 06:15:32,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 06:15:32,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 06:15:32,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 06:15:32,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 06:15:32,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 06:15:32,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 06:15:32,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 06:15:32,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 06:15:32,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 06:15:32,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 06:15:32,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 06:15:32,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 06:15:32,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 06:15:32,956 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 06:15:32,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 06:15:32,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 06:15:32,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 06:15:32,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 06:15:32,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 06:15:32,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 06:15:32,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 06:15:32,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 06:15:32,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 06:15:32,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 06:15:32,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 06:15:32,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 06:15:32,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 06:15:32,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 06:15:32,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 06:15:32,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2020-11-12 06:15:33,023 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 06:15:33,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 06:15:33,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 06:15:33,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 06:15:33,029 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 06:15:33,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 06:15:33,030 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 06:15:33,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 06:15:33,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 06:15:33,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 06:15:33,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 06:15:33,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 06:15:33,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 06:15:33,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 06:15:33,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 06:15:33,033 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 06:15:33,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 06:15:33,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 06:15:33,033 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 06:15:33,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 06:15:33,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 06:15:33,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 06:15:33,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 06:15:33,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 06:15:33,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 06:15:33,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 06:15:33,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 06:15:33,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-12 06:15:33,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 06:15:33,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-12 06:15:33,039 INFO L138 SettingsManager]: * Sleep set reduction in concurrent analysis=DELAY_SET 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-12 06:15:33,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 06:15:33,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 06:15:33,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 06:15:33,533 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 06:15:33,534 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 06:15:33,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-11-12 06:15:33,640 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c051140a2/7d4e28cd44214f7abef40518808efff8/FLAG306a898ef [2020-11-12 06:15:34,491 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 06:15:34,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2020-11-12 06:15:34,514 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c051140a2/7d4e28cd44214f7abef40518808efff8/FLAG306a898ef [2020-11-12 06:15:34,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c051140a2/7d4e28cd44214f7abef40518808efff8 [2020-11-12 06:15:34,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 06:15:34,769 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 06:15:34,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 06:15:34,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 06:15:34,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 06:15:34,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:15:34" (1/1) ... [2020-11-12 06:15:34,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e73ab71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:34, skipping insertion in model container [2020-11-12 06:15:34,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:15:34" (1/1) ... [2020-11-12 06:15:34,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 06:15:34,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 06:15:35,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 06:15:35,390 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 06:15:35,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 06:15:35,558 INFO L208 MainTranslator]: Completed translation [2020-11-12 06:15:35,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35 WrapperNode [2020-11-12 06:15:35,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 06:15:35,560 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 06:15:35,560 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 06:15:35,560 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 06:15:35,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 06:15:35,630 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 06:15:35,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 06:15:35,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 06:15:35,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (1/1) ... [2020-11-12 06:15:35,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 06:15:35,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 06:15:35,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 06:15:35,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 06:15:35,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (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-12 06:15:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 06:15:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 06:15:35,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 06:15:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 06:15:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 06:15:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 06:15:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 06:15:35,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 06:15:35,776 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-12 06:15:35,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-12 06:15:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 06:15:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 06:15:35,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 06:15:35,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 06:15:35,779 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-12 06:15:38,342 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 06:15:38,343 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 06:15:38,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:15:38 BoogieIcfgContainer [2020-11-12 06:15:38,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 06:15:38,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 06:15:38,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 06:15:38,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 06:15:38,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:15:34" (1/3) ... [2020-11-12 06:15:38,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a31655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:15:38, skipping insertion in model container [2020-11-12 06:15:38,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:15:35" (2/3) ... [2020-11-12 06:15:38,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49a31655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:15:38, skipping insertion in model container [2020-11-12 06:15:38,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:15:38" (3/3) ... [2020-11-12 06:15:38,355 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2020-11-12 06:15:38,417 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 06:15:38,417 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 06:15:38,423 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 06:15:38,424 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 06:15:38,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,478 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,498 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,508 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,510 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,515 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,522 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,525 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,525 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,526 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,527 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,529 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,530 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 06:15:38,534 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 06:15:38,547 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-12 06:15:38,583 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 06:15:38,583 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 06:15:38,583 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 06:15:38,583 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 06:15:38,583 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 06:15:38,584 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 06:15:38,584 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 06:15:38,584 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 06:15:38,600 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 101 transitions, 217 flow [2020-11-12 06:15:40,175 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 17065 states, 17061 states have (on average 3.6830783658636657) internal successors, (62837), 17064 states have internal predecessors, (62837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:40,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-12 06:15:40,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-11-12 06:15:40,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:40,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:40,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:40,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:40,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:40,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:40,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:40,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:40,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,838 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-12 06:15:40,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,840 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-12 06:15:40,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:40,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:40,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:40,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:40,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,932 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-12 06:15:40,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,935 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-12 06:15:40,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:40,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:40,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:40,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:41,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:41,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-12 06:15:41,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:41,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-11-12 06:15:41,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:41,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:41,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:41,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:41,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:41,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:41,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,869 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-12 06:15:41,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,872 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-12 06:15:41,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:41,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:41,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:41,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:41,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,994 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-12 06:15:41,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:41,996 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-12 06:15:41,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:42,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:42,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 06:15:42,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-12 06:15:42,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-12 06:15:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-12 06:15:42,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-11-12 06:15:42,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,835 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:42,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:42,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:42,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:42,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:42,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:42,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:42,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:42,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:42,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:42,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:42,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:42,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:42,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:42,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,966 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-12 06:15:42,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:42,968 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-12 06:15:42,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:43,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:43,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 06:15:43,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:43,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,053 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-12 06:15:43,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,055 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-12 06:15:43,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 06:15:43,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-12 06:15:43,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-11-12 06:15:43,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 06:15:43,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 06:15:43,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 06:15:43,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 06:15:43,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 06:15:43,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 06:15:43,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 06:15:43,982 WARN L455 BasicCegarLoop]: Sleep Set Reduction Time: 3803ms [2020-11-12 06:15:44,019 WARN L456 BasicCegarLoop]: Sleep set: input automaton has 17065 states, 17061 states have (on average 3.6830783658636657) internal successors, (62837), 17064 states have internal predecessors, (62837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:44,052 WARN L457 BasicCegarLoop]: Sleep set: output automaton has 17065 states, 14944 states have (on average 2.5825080299785865) internal successors, (38593), 17064 states have internal predecessors, (38593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand has 17065 states, 14944 states have (on average 2.5825080299785865) internal successors, (38593), 17064 states have internal predecessors, (38593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-12 06:15:44,091 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:44,092 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:44,092 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-12 06:15:44,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:44,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2059157277, now seen corresponding path program 1 times [2020-11-12 06:15:44,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:44,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251376454] [2020-11-12 06:15:44,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:44,480 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-12 06:15:44,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251376454] [2020-11-12 06:15:44,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:44,482 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 06:15:44,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080856954] [2020-11-12 06:15:44,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 06:15:44,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 06:15:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 06:15:44,535 INFO L87 Difference]: Start difference. First operand has 17065 states, 14944 states have (on average 2.5825080299785865) internal successors, (38593), 17064 states have internal predecessors, (38593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:44,852 INFO L93 Difference]: Finished difference Result 14149 states and 30888 transitions. [2020-11-12 06:15:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 06:15:44,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2020-11-12 06:15:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:44,953 INFO L225 Difference]: With dead ends: 14149 [2020-11-12 06:15:44,954 INFO L226 Difference]: Without dead ends: 6088 [2020-11-12 06:15:44,956 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 06:15:45,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6088 states. [2020-11-12 06:15:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6088 to 6088. [2020-11-12 06:15:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6088 states, 6024 states have (on average 2.461487383798141) internal successors, (14828), 6087 states have internal predecessors, (14828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 14828 transitions. [2020-11-12 06:15:45,308 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 14828 transitions. Word has length 39 [2020-11-12 06:15:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:45,310 INFO L481 AbstractCegarLoop]: Abstraction has 6088 states and 14828 transitions. [2020-11-12 06:15:45,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 14828 transitions. [2020-11-12 06:15:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-12 06:15:45,329 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:45,330 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:45,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 06:15:45,330 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-12 06:15:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash 980563404, now seen corresponding path program 1 times [2020-11-12 06:15:45,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:45,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14908944] [2020-11-12 06:15:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:45,672 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-12 06:15:45,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14908944] [2020-11-12 06:15:45,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:45,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 06:15:45,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473184711] [2020-11-12 06:15:45,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 06:15:45,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:45,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 06:15:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 06:15:45,676 INFO L87 Difference]: Start difference. First operand 6088 states and 14828 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:45,871 INFO L93 Difference]: Finished difference Result 6600 states and 16748 transitions. [2020-11-12 06:15:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 06:15:45,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2020-11-12 06:15:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:45,906 INFO L225 Difference]: With dead ends: 6600 [2020-11-12 06:15:45,906 INFO L226 Difference]: Without dead ends: 5064 [2020-11-12 06:15:45,907 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:15:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5064 states. [2020-11-12 06:15:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5064 to 5064. [2020-11-12 06:15:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5064 states, 5000 states have (on average 2.5048) internal successors, (12524), 5063 states have internal predecessors, (12524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5064 states to 5064 states and 12524 transitions. [2020-11-12 06:15:46,098 INFO L78 Accepts]: Start accepts. Automaton has 5064 states and 12524 transitions. Word has length 60 [2020-11-12 06:15:46,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:46,099 INFO L481 AbstractCegarLoop]: Abstraction has 5064 states and 12524 transitions. [2020-11-12 06:15:46,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5064 states and 12524 transitions. [2020-11-12 06:15:46,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-12 06:15:46,112 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:46,112 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:46,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 06:15:46,113 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-12 06:15:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:46,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1923520659, now seen corresponding path program 1 times [2020-11-12 06:15:46,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:46,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914770495] [2020-11-12 06:15:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:46,469 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-12 06:15:46,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914770495] [2020-11-12 06:15:46,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:46,470 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 06:15:46,470 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482372863] [2020-11-12 06:15:46,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 06:15:46,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 06:15:46,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-12 06:15:46,472 INFO L87 Difference]: Start difference. First operand 5064 states and 12524 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:46,692 INFO L93 Difference]: Finished difference Result 6392 states and 16077 transitions. [2020-11-12 06:15:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 06:15:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2020-11-12 06:15:46,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:46,716 INFO L225 Difference]: With dead ends: 6392 [2020-11-12 06:15:46,716 INFO L226 Difference]: Without dead ends: 3328 [2020-11-12 06:15:46,717 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-11-12 06:15:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2020-11-12 06:15:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 3328. [2020-11-12 06:15:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3328 states, 3288 states have (on average 2.5717761557177616) internal successors, (8456), 3327 states have internal predecessors, (8456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3328 states to 3328 states and 8456 transitions. [2020-11-12 06:15:46,823 INFO L78 Accepts]: Start accepts. Automaton has 3328 states and 8456 transitions. Word has length 62 [2020-11-12 06:15:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:46,826 INFO L481 AbstractCegarLoop]: Abstraction has 3328 states and 8456 transitions. [2020-11-12 06:15:46,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3328 states and 8456 transitions. [2020-11-12 06:15:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-12 06:15:46,833 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:46,833 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:46,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 06:15:46,834 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-12 06:15:46,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:46,834 INFO L82 PathProgramCache]: Analyzing trace with hash -582606154, now seen corresponding path program 1 times [2020-11-12 06:15:46,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:46,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283588306] [2020-11-12 06:15:46,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:47,091 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-12 06:15:47,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283588306] [2020-11-12 06:15:47,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:47,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 06:15:47,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118024197] [2020-11-12 06:15:47,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 06:15:47,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 06:15:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 06:15:47,093 INFO L87 Difference]: Start difference. First operand 3328 states and 8456 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:47,476 INFO L93 Difference]: Finished difference Result 4114 states and 10650 transitions. [2020-11-12 06:15:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 06:15:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-11-12 06:15:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:47,519 INFO L225 Difference]: With dead ends: 4114 [2020-11-12 06:15:47,519 INFO L226 Difference]: Without dead ends: 3442 [2020-11-12 06:15:47,519 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-12 06:15:47,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2020-11-12 06:15:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3248. [2020-11-12 06:15:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3208 states have (on average 2.5536159600997506) internal successors, (8192), 3247 states have internal predecessors, (8192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:47,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 8192 transitions. [2020-11-12 06:15:47,674 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 8192 transitions. Word has length 65 [2020-11-12 06:15:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:47,677 INFO L481 AbstractCegarLoop]: Abstraction has 3248 states and 8192 transitions. [2020-11-12 06:15:47,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 8192 transitions. [2020-11-12 06:15:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-12 06:15:47,686 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:47,686 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:47,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 06:15:47,687 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-12 06:15:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash 949606969, now seen corresponding path program 1 times [2020-11-12 06:15:47,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:47,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619345517] [2020-11-12 06:15:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:47,978 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-12 06:15:47,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619345517] [2020-11-12 06:15:47,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:47,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 06:15:47,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113650114] [2020-11-12 06:15:47,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 06:15:47,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:47,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 06:15:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 06:15:47,981 INFO L87 Difference]: Start difference. First operand 3248 states and 8192 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:48,478 INFO L93 Difference]: Finished difference Result 3818 states and 9853 transitions. [2020-11-12 06:15:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:15:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-11-12 06:15:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:48,494 INFO L225 Difference]: With dead ends: 3818 [2020-11-12 06:15:48,495 INFO L226 Difference]: Without dead ends: 3306 [2020-11-12 06:15:48,495 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-11-12 06:15:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2020-11-12 06:15:48,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3258. [2020-11-12 06:15:48,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3258 states, 3218 states have (on average 2.552827843380982) internal successors, (8215), 3257 states have internal predecessors, (8215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3258 states to 3258 states and 8215 transitions. [2020-11-12 06:15:48,614 INFO L78 Accepts]: Start accepts. Automaton has 3258 states and 8215 transitions. Word has length 66 [2020-11-12 06:15:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:48,615 INFO L481 AbstractCegarLoop]: Abstraction has 3258 states and 8215 transitions. [2020-11-12 06:15:48,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3258 states and 8215 transitions. [2020-11-12 06:15:48,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-12 06:15:48,622 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:48,622 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:48,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 06:15:48,623 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-12 06:15:48,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:48,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1225985357, now seen corresponding path program 2 times [2020-11-12 06:15:48,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:48,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137738193] [2020-11-12 06:15:48,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 06:15:48,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137738193] [2020-11-12 06:15:48,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:48,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 06:15:48,883 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524452100] [2020-11-12 06:15:48,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 06:15:48,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:48,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 06:15:48,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-12 06:15:48,885 INFO L87 Difference]: Start difference. First operand 3258 states and 8215 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:49,395 INFO L93 Difference]: Finished difference Result 3810 states and 9815 transitions. [2020-11-12 06:15:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 06:15:49,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-11-12 06:15:49,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:49,407 INFO L225 Difference]: With dead ends: 3810 [2020-11-12 06:15:49,407 INFO L226 Difference]: Without dead ends: 3298 [2020-11-12 06:15:49,407 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 06:15:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2020-11-12 06:15:49,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3268. [2020-11-12 06:15:49,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 3228 states have (on average 2.550185873605948) internal successors, (8232), 3267 states have internal predecessors, (8232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 8232 transitions. [2020-11-12 06:15:49,525 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 8232 transitions. Word has length 66 [2020-11-12 06:15:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:49,526 INFO L481 AbstractCegarLoop]: Abstraction has 3268 states and 8232 transitions. [2020-11-12 06:15:49,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 8232 transitions. [2020-11-12 06:15:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-12 06:15:49,534 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:49,534 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:49,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 06:15:49,534 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-12 06:15:49,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash -836601584, now seen corresponding path program 1 times [2020-11-12 06:15:49,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:49,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606213580] [2020-11-12 06:15:49,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:49,932 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-12 06:15:49,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606213580] [2020-11-12 06:15:49,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:49,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 06:15:49,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052379665] [2020-11-12 06:15:49,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 06:15:49,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 06:15:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-12 06:15:49,935 INFO L87 Difference]: Start difference. First operand 3268 states and 8232 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:50,289 INFO L93 Difference]: Finished difference Result 3472 states and 8896 transitions. [2020-11-12 06:15:50,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 06:15:50,292 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-11-12 06:15:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:50,302 INFO L225 Difference]: With dead ends: 3472 [2020-11-12 06:15:50,302 INFO L226 Difference]: Without dead ends: 2780 [2020-11-12 06:15:50,303 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2020-11-12 06:15:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2020-11-12 06:15:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2762. [2020-11-12 06:15:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2732 states have (on average 2.5823572474377747) internal successors, (7055), 2761 states have internal predecessors, (7055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 7055 transitions. [2020-11-12 06:15:50,403 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 7055 transitions. Word has length 67 [2020-11-12 06:15:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:50,403 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 7055 transitions. [2020-11-12 06:15:50,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 7055 transitions. [2020-11-12 06:15:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-12 06:15:50,411 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:50,411 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:50,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 06:15:50,411 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-12 06:15:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1256242002, now seen corresponding path program 1 times [2020-11-12 06:15:50,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:50,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808332087] [2020-11-12 06:15:50,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:50,710 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-12 06:15:50,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808332087] [2020-11-12 06:15:50,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:50,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-12 06:15:50,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484119746] [2020-11-12 06:15:50,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-12 06:15:50,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:50,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-12 06:15:50,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-11-12 06:15:50,713 INFO L87 Difference]: Start difference. First operand 2762 states and 7055 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:51,105 INFO L93 Difference]: Finished difference Result 3442 states and 8973 transitions. [2020-11-12 06:15:51,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:15:51,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-11-12 06:15:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:51,116 INFO L225 Difference]: With dead ends: 3442 [2020-11-12 06:15:51,116 INFO L226 Difference]: Without dead ends: 2930 [2020-11-12 06:15:51,116 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-12 06:15:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2020-11-12 06:15:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2882. [2020-11-12 06:15:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2852 states have (on average 2.555049088359046) internal successors, (7287), 2881 states have internal predecessors, (7287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 7287 transitions. [2020-11-12 06:15:51,211 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 7287 transitions. Word has length 67 [2020-11-12 06:15:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:51,212 INFO L481 AbstractCegarLoop]: Abstraction has 2882 states and 7287 transitions. [2020-11-12 06:15:51,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 7287 transitions. [2020-11-12 06:15:51,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-12 06:15:51,226 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:51,226 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:51,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 06:15:51,226 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-12 06:15:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:51,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1149018687, now seen corresponding path program 1 times [2020-11-12 06:15:51,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:51,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165635644] [2020-11-12 06:15:51,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:51,536 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-12 06:15:51,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165635644] [2020-11-12 06:15:51,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:51,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-12 06:15:51,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403320759] [2020-11-12 06:15:51,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-12 06:15:51,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-12 06:15:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-12 06:15:51,544 INFO L87 Difference]: Start difference. First operand 2882 states and 7287 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:51,992 INFO L93 Difference]: Finished difference Result 3361 states and 8738 transitions. [2020-11-12 06:15:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-12 06:15:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-11-12 06:15:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:52,003 INFO L225 Difference]: With dead ends: 3361 [2020-11-12 06:15:52,004 INFO L226 Difference]: Without dead ends: 2969 [2020-11-12 06:15:52,004 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-11-12 06:15:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2020-11-12 06:15:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2931. [2020-11-12 06:15:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2901 states have (on average 2.5646328852119957) internal successors, (7440), 2930 states have internal predecessors, (7440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 7440 transitions. [2020-11-12 06:15:52,112 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 7440 transitions. Word has length 68 [2020-11-12 06:15:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:52,113 INFO L481 AbstractCegarLoop]: Abstraction has 2931 states and 7440 transitions. [2020-11-12 06:15:52,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 7440 transitions. [2020-11-12 06:15:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-12 06:15:52,121 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:52,121 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:52,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 06:15:52,121 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-12 06:15:52,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:52,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1573803527, now seen corresponding path program 1 times [2020-11-12 06:15:52,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:52,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9155214] [2020-11-12 06:15:52,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:52,623 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-12 06:15:52,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9155214] [2020-11-12 06:15:52,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:52,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 06:15:52,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448137373] [2020-11-12 06:15:52,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 06:15:52,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 06:15:52,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-12 06:15:52,626 INFO L87 Difference]: Start difference. First operand 2931 states and 7440 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:53,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:53,153 INFO L93 Difference]: Finished difference Result 3251 states and 8392 transitions. [2020-11-12 06:15:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 06:15:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-11-12 06:15:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:53,165 INFO L225 Difference]: With dead ends: 3251 [2020-11-12 06:15:53,166 INFO L226 Difference]: Without dead ends: 2867 [2020-11-12 06:15:53,166 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2020-11-12 06:15:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2867 states. [2020-11-12 06:15:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2867 to 2731. [2020-11-12 06:15:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2731 states, 2701 states have (on average 2.5560903369122547) internal successors, (6904), 2730 states have internal predecessors, (6904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 6904 transitions. [2020-11-12 06:15:53,257 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 6904 transitions. Word has length 68 [2020-11-12 06:15:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:53,257 INFO L481 AbstractCegarLoop]: Abstraction has 2731 states and 6904 transitions. [2020-11-12 06:15:53,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:53,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 6904 transitions. [2020-11-12 06:15:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-11-12 06:15:53,264 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:53,265 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:53,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 06:15:53,265 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-12 06:15:53,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:53,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2119324957, now seen corresponding path program 2 times [2020-11-12 06:15:53,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:53,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803349708] [2020-11-12 06:15:53,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:53,567 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-12 06:15:53,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803349708] [2020-11-12 06:15:53,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:53,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 06:15:53,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283538862] [2020-11-12 06:15:53,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 06:15:53,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 06:15:53,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-12 06:15:53,570 INFO L87 Difference]: Start difference. First operand 2731 states and 6904 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:54,057 INFO L93 Difference]: Finished difference Result 3565 states and 9512 transitions. [2020-11-12 06:15:54,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 06:15:54,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-11-12 06:15:54,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:54,067 INFO L225 Difference]: With dead ends: 3565 [2020-11-12 06:15:54,067 INFO L226 Difference]: Without dead ends: 3093 [2020-11-12 06:15:54,067 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2020-11-12 06:15:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3093 states. [2020-11-12 06:15:54,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3093 to 2830. [2020-11-12 06:15:54,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2830 states, 2800 states have (on average 2.5735714285714284) internal successors, (7206), 2829 states have internal predecessors, (7206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 7206 transitions. [2020-11-12 06:15:54,148 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 7206 transitions. Word has length 68 [2020-11-12 06:15:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:54,149 INFO L481 AbstractCegarLoop]: Abstraction has 2830 states and 7206 transitions. [2020-11-12 06:15:54,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 7206 transitions. [2020-11-12 06:15:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:54,155 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:54,156 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:54,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 06:15:54,156 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-12 06:15:54,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:54,157 INFO L82 PathProgramCache]: Analyzing trace with hash 144079254, now seen corresponding path program 1 times [2020-11-12 06:15:54,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:54,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010574942] [2020-11-12 06:15:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:54,569 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-12 06:15:54,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010574942] [2020-11-12 06:15:54,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:54,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 06:15:54,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822644281] [2020-11-12 06:15:54,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 06:15:54,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:54,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 06:15:54,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-12 06:15:54,572 INFO L87 Difference]: Start difference. First operand 2830 states and 7206 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:55,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:55,011 INFO L93 Difference]: Finished difference Result 3212 states and 8352 transitions. [2020-11-12 06:15:55,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 06:15:55,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:55,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:55,019 INFO L225 Difference]: With dead ends: 3212 [2020-11-12 06:15:55,019 INFO L226 Difference]: Without dead ends: 2924 [2020-11-12 06:15:55,019 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2020-11-12 06:15:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2020-11-12 06:15:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2818. [2020-11-12 06:15:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2788 states have (on average 2.5724533715925393) internal successors, (7172), 2817 states have internal predecessors, (7172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 7172 transitions. [2020-11-12 06:15:55,096 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 7172 transitions. Word has length 69 [2020-11-12 06:15:55,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:55,096 INFO L481 AbstractCegarLoop]: Abstraction has 2818 states and 7172 transitions. [2020-11-12 06:15:55,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 7172 transitions. [2020-11-12 06:15:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:55,103 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:55,103 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:55,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-12 06:15:55,103 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-12 06:15:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1469487480, now seen corresponding path program 2 times [2020-11-12 06:15:55,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:55,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026880559] [2020-11-12 06:15:55,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:55,527 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-12 06:15:55,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026880559] [2020-11-12 06:15:55,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:55,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 06:15:55,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013519616] [2020-11-12 06:15:55,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 06:15:55,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:55,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 06:15:55,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-11-12 06:15:55,529 INFO L87 Difference]: Start difference. First operand 2818 states and 7172 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:56,112 INFO L93 Difference]: Finished difference Result 3195 states and 8278 transitions. [2020-11-12 06:15:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:15:56,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:56,119 INFO L225 Difference]: With dead ends: 3195 [2020-11-12 06:15:56,120 INFO L226 Difference]: Without dead ends: 2907 [2020-11-12 06:15:56,120 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2020-11-12 06:15:56,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2020-11-12 06:15:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2821. [2020-11-12 06:15:56,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2791 states have (on average 2.5729129344321033) internal successors, (7181), 2820 states have internal predecessors, (7181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 7181 transitions. [2020-11-12 06:15:56,192 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 7181 transitions. Word has length 69 [2020-11-12 06:15:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:56,193 INFO L481 AbstractCegarLoop]: Abstraction has 2821 states and 7181 transitions. [2020-11-12 06:15:56,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 7181 transitions. [2020-11-12 06:15:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:56,199 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:56,199 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:56,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-12 06:15:56,199 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-12 06:15:56,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:56,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1236766833, now seen corresponding path program 1 times [2020-11-12 06:15:56,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:56,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055445033] [2020-11-12 06:15:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:56,533 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-12 06:15:56,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055445033] [2020-11-12 06:15:56,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:56,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 06:15:56,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600716982] [2020-11-12 06:15:56,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 06:15:56,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:56,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 06:15:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:15:56,537 INFO L87 Difference]: Start difference. First operand 2821 states and 7181 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:56,865 INFO L93 Difference]: Finished difference Result 3255 states and 8370 transitions. [2020-11-12 06:15:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 06:15:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:56,877 INFO L225 Difference]: With dead ends: 3255 [2020-11-12 06:15:56,877 INFO L226 Difference]: Without dead ends: 3015 [2020-11-12 06:15:56,878 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-11-12 06:15:56,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2020-11-12 06:15:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2853. [2020-11-12 06:15:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2823 states have (on average 2.5717321997874603) internal successors, (7260), 2852 states have internal predecessors, (7260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 7260 transitions. [2020-11-12 06:15:56,952 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 7260 transitions. Word has length 69 [2020-11-12 06:15:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:56,953 INFO L481 AbstractCegarLoop]: Abstraction has 2853 states and 7260 transitions. [2020-11-12 06:15:56,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 7260 transitions. [2020-11-12 06:15:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:56,959 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:56,959 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:56,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-12 06:15:56,959 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-12 06:15:56,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1231515281, now seen corresponding path program 2 times [2020-11-12 06:15:56,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:56,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289110373] [2020-11-12 06:15:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:57,281 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-12 06:15:57,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289110373] [2020-11-12 06:15:57,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:57,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 06:15:57,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642838695] [2020-11-12 06:15:57,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 06:15:57,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:57,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 06:15:57,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:15:57,284 INFO L87 Difference]: Start difference. First operand 2853 states and 7260 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:57,884 INFO L93 Difference]: Finished difference Result 3669 states and 9549 transitions. [2020-11-12 06:15:57,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 06:15:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:57,889 INFO L225 Difference]: With dead ends: 3669 [2020-11-12 06:15:57,889 INFO L226 Difference]: Without dead ends: 3365 [2020-11-12 06:15:57,890 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-11-12 06:15:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2020-11-12 06:15:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3025. [2020-11-12 06:15:57,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3025 states, 2995 states have (on average 2.562270450751252) internal successors, (7674), 3024 states have internal predecessors, (7674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3025 states to 3025 states and 7674 transitions. [2020-11-12 06:15:57,966 INFO L78 Accepts]: Start accepts. Automaton has 3025 states and 7674 transitions. Word has length 69 [2020-11-12 06:15:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:57,966 INFO L481 AbstractCegarLoop]: Abstraction has 3025 states and 7674 transitions. [2020-11-12 06:15:57,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3025 states and 7674 transitions. [2020-11-12 06:15:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:57,973 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:57,973 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:57,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-12 06:15:57,973 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-12 06:15:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1064917676, now seen corresponding path program 3 times [2020-11-12 06:15:57,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:57,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071341634] [2020-11-12 06:15:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:58,327 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-12 06:15:58,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071341634] [2020-11-12 06:15:58,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:58,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 06:15:58,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765733997] [2020-11-12 06:15:58,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 06:15:58,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 06:15:58,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:15:58,329 INFO L87 Difference]: Start difference. First operand 3025 states and 7674 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:58,768 INFO L93 Difference]: Finished difference Result 3753 states and 9948 transitions. [2020-11-12 06:15:58,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:15:58,769 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:58,774 INFO L225 Difference]: With dead ends: 3753 [2020-11-12 06:15:58,774 INFO L226 Difference]: Without dead ends: 3401 [2020-11-12 06:15:58,774 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 06:15:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2020-11-12 06:15:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3037. [2020-11-12 06:15:58,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3007 states have (on average 2.562354506152311) internal successors, (7705), 3036 states have internal predecessors, (7705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 7705 transitions. [2020-11-12 06:15:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 7705 transitions. Word has length 69 [2020-11-12 06:15:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:58,857 INFO L481 AbstractCegarLoop]: Abstraction has 3037 states and 7705 transitions. [2020-11-12 06:15:58,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 7705 transitions. [2020-11-12 06:15:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:58,863 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:58,863 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:58,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-12 06:15:58,864 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-12 06:15:58,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:58,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1297638323, now seen corresponding path program 3 times [2020-11-12 06:15:58,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:58,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442905176] [2020-11-12 06:15:58,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:59,258 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-12 06:15:59,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442905176] [2020-11-12 06:15:59,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:59,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-12 06:15:59,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520012829] [2020-11-12 06:15:59,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-12 06:15:59,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-12 06:15:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:15:59,262 INFO L87 Difference]: Start difference. First operand 3037 states and 7705 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:15:59,747 INFO L93 Difference]: Finished difference Result 4585 states and 12083 transitions. [2020-11-12 06:15:59,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:15:59,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:15:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:15:59,755 INFO L225 Difference]: With dead ends: 4585 [2020-11-12 06:15:59,755 INFO L226 Difference]: Without dead ends: 3689 [2020-11-12 06:15:59,756 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2020-11-12 06:15:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2020-11-12 06:15:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3019. [2020-11-12 06:15:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2989 states have (on average 2.5617263298762127) internal successors, (7657), 3018 states have internal predecessors, (7657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 7657 transitions. [2020-11-12 06:15:59,836 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 7657 transitions. Word has length 69 [2020-11-12 06:15:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:15:59,836 INFO L481 AbstractCegarLoop]: Abstraction has 3019 states and 7657 transitions. [2020-11-12 06:15:59,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:15:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 7657 transitions. [2020-11-12 06:15:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:15:59,842 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:15:59,842 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:15:59,842 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-12 06:15:59,843 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-12 06:15:59,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:15:59,843 INFO L82 PathProgramCache]: Analyzing trace with hash -449805837, now seen corresponding path program 1 times [2020-11-12 06:15:59,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:15:59,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169668432] [2020-11-12 06:15:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:15:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:15:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 06:15:59,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169668432] [2020-11-12 06:15:59,942 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:15:59,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 06:15:59,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935971688] [2020-11-12 06:15:59,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 06:15:59,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:15:59,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 06:15:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 06:15:59,946 INFO L87 Difference]: Start difference. First operand 3019 states and 7657 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:00,055 INFO L93 Difference]: Finished difference Result 5264 states and 13615 transitions. [2020-11-12 06:16:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 06:16:00,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:16:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:00,063 INFO L225 Difference]: With dead ends: 5264 [2020-11-12 06:16:00,063 INFO L226 Difference]: Without dead ends: 3342 [2020-11-12 06:16:00,064 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-12 06:16:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3342 states. [2020-11-12 06:16:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3342 to 2782. [2020-11-12 06:16:00,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2752 states have (on average 2.5505087209302326) internal successors, (7019), 2781 states have internal predecessors, (7019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 7019 transitions. [2020-11-12 06:16:00,139 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 7019 transitions. Word has length 69 [2020-11-12 06:16:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:00,140 INFO L481 AbstractCegarLoop]: Abstraction has 2782 states and 7019 transitions. [2020-11-12 06:16:00,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 7019 transitions. [2020-11-12 06:16:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:16:00,145 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:00,146 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:00,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-12 06:16:00,146 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-12 06:16:00,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:00,146 INFO L82 PathProgramCache]: Analyzing trace with hash -417596158, now seen corresponding path program 4 times [2020-11-12 06:16:00,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:00,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268796733] [2020-11-12 06:16:00,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:00,458 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-12 06:16:00,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268796733] [2020-11-12 06:16:00,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:00,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-12 06:16:00,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111084724] [2020-11-12 06:16:00,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-12 06:16:00,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:00,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-12 06:16:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-12 06:16:00,462 INFO L87 Difference]: Start difference. First operand 2782 states and 7019 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:00,909 INFO L93 Difference]: Finished difference Result 3107 states and 7965 transitions. [2020-11-12 06:16:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-12 06:16:00,910 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:16:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:00,915 INFO L225 Difference]: With dead ends: 3107 [2020-11-12 06:16:00,915 INFO L226 Difference]: Without dead ends: 2819 [2020-11-12 06:16:00,916 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-11-12 06:16:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2020-11-12 06:16:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2768. [2020-11-12 06:16:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2738 states have (on average 2.5504017531044556) internal successors, (6983), 2767 states have internal predecessors, (6983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6983 transitions. [2020-11-12 06:16:00,981 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6983 transitions. Word has length 69 [2020-11-12 06:16:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:00,982 INFO L481 AbstractCegarLoop]: Abstraction has 2768 states and 6983 transitions. [2020-11-12 06:16:00,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6983 transitions. [2020-11-12 06:16:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:16:00,988 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:00,988 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:00,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-12 06:16:00,988 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-12 06:16:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:00,989 INFO L82 PathProgramCache]: Analyzing trace with hash -564639614, now seen corresponding path program 5 times [2020-11-12 06:16:00,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:00,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409889204] [2020-11-12 06:16:00,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:01,379 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-12 06:16:01,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409889204] [2020-11-12 06:16:01,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:01,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 06:16:01,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707450578] [2020-11-12 06:16:01,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 06:16:01,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 06:16:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-11-12 06:16:01,382 INFO L87 Difference]: Start difference. First operand 2768 states and 6983 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:02,088 INFO L93 Difference]: Finished difference Result 3185 states and 8234 transitions. [2020-11-12 06:16:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 06:16:02,089 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:16:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:02,093 INFO L225 Difference]: With dead ends: 3185 [2020-11-12 06:16:02,093 INFO L226 Difference]: Without dead ends: 2897 [2020-11-12 06:16:02,093 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2020-11-12 06:16:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2020-11-12 06:16:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2700. [2020-11-12 06:16:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2670 states have (on average 2.5243445692883895) internal successors, (6740), 2699 states have internal predecessors, (6740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 6740 transitions. [2020-11-12 06:16:02,161 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 6740 transitions. Word has length 69 [2020-11-12 06:16:02,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:02,161 INFO L481 AbstractCegarLoop]: Abstraction has 2700 states and 6740 transitions. [2020-11-12 06:16:02,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 6740 transitions. [2020-11-12 06:16:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:16:02,167 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:02,167 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:02,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-12 06:16:02,167 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:02,168 INFO L82 PathProgramCache]: Analyzing trace with hash -331918967, now seen corresponding path program 4 times [2020-11-12 06:16:02,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:02,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202843173] [2020-11-12 06:16:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:02,585 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-12 06:16:02,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202843173] [2020-11-12 06:16:02,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:02,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-12 06:16:02,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328179270] [2020-11-12 06:16:02,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-12 06:16:02,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:02,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-12 06:16:02,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-11-12 06:16:02,589 INFO L87 Difference]: Start difference. First operand 2700 states and 6740 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:03,191 INFO L93 Difference]: Finished difference Result 3067 states and 7702 transitions. [2020-11-12 06:16:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 06:16:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:16:03,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:03,196 INFO L225 Difference]: With dead ends: 3067 [2020-11-12 06:16:03,196 INFO L226 Difference]: Without dead ends: 2467 [2020-11-12 06:16:03,197 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2020-11-12 06:16:03,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2020-11-12 06:16:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2446. [2020-11-12 06:16:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2418 states have (on average 2.5401157981803144) internal successors, (6142), 2445 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 6142 transitions. [2020-11-12 06:16:03,255 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 6142 transitions. Word has length 69 [2020-11-12 06:16:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:03,255 INFO L481 AbstractCegarLoop]: Abstraction has 2446 states and 6142 transitions. [2020-11-12 06:16:03,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 6142 transitions. [2020-11-12 06:16:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-12 06:16:03,263 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:03,263 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:03,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-12 06:16:03,264 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:03,264 INFO L82 PathProgramCache]: Analyzing trace with hash -134445355, now seen corresponding path program 2 times [2020-11-12 06:16:03,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:03,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679821774] [2020-11-12 06:16:03,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:03,391 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-12 06:16:03,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679821774] [2020-11-12 06:16:03,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:03,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-12 06:16:03,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843340437] [2020-11-12 06:16:03,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 06:16:03,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:03,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 06:16:03,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-12 06:16:03,397 INFO L87 Difference]: Start difference. First operand 2446 states and 6142 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:03,535 INFO L93 Difference]: Finished difference Result 2948 states and 7142 transitions. [2020-11-12 06:16:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-12 06:16:03,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-12 06:16:03,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:03,541 INFO L225 Difference]: With dead ends: 2948 [2020-11-12 06:16:03,541 INFO L226 Difference]: Without dead ends: 2112 [2020-11-12 06:16:03,542 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-12 06:16:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2020-11-12 06:16:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2112. [2020-11-12 06:16:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 2084 states have (on average 2.5398272552783108) internal successors, (5293), 2111 states have internal predecessors, (5293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 5293 transitions. [2020-11-12 06:16:03,603 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 5293 transitions. Word has length 69 [2020-11-12 06:16:03,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:03,603 INFO L481 AbstractCegarLoop]: Abstraction has 2112 states and 5293 transitions. [2020-11-12 06:16:03,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 5293 transitions. [2020-11-12 06:16:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-12 06:16:03,610 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:03,610 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:03,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-12 06:16:03,611 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -498571218, now seen corresponding path program 1 times [2020-11-12 06:16:03,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:03,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819617061] [2020-11-12 06:16:03,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:03,767 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-12 06:16:03,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819617061] [2020-11-12 06:16:03,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:03,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-12 06:16:03,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007240151] [2020-11-12 06:16:03,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 06:16:03,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:03,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 06:16:03,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-12 06:16:03,772 INFO L87 Difference]: Start difference. First operand 2112 states and 5293 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:03,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:03,982 INFO L93 Difference]: Finished difference Result 1886 states and 4299 transitions. [2020-11-12 06:16:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-12 06:16:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2020-11-12 06:16:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:03,986 INFO L225 Difference]: With dead ends: 1886 [2020-11-12 06:16:03,986 INFO L226 Difference]: Without dead ends: 1202 [2020-11-12 06:16:03,987 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-12 06:16:03,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-11-12 06:16:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1202. [2020-11-12 06:16:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1178 states have (on average 2.331918505942275) internal successors, (2747), 1201 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 2747 transitions. [2020-11-12 06:16:04,011 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 2747 transitions. Word has length 70 [2020-11-12 06:16:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:04,011 INFO L481 AbstractCegarLoop]: Abstraction has 1202 states and 2747 transitions. [2020-11-12 06:16:04,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 2747 transitions. [2020-11-12 06:16:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-12 06:16:04,014 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:04,014 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:04,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-12 06:16:04,014 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:04,015 INFO L82 PathProgramCache]: Analyzing trace with hash -601655327, now seen corresponding path program 1 times [2020-11-12 06:16:04,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:04,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286735842] [2020-11-12 06:16:04,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:04,363 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-12 06:16:04,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286735842] [2020-11-12 06:16:04,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:04,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-11-12 06:16:04,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477485956] [2020-11-12 06:16:04,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-12 06:16:04,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:04,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-12 06:16:04,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-11-12 06:16:04,368 INFO L87 Difference]: Start difference. First operand 1202 states and 2747 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:04,853 INFO L93 Difference]: Finished difference Result 1300 states and 2949 transitions. [2020-11-12 06:16:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-12 06:16:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2020-11-12 06:16:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:04,857 INFO L225 Difference]: With dead ends: 1300 [2020-11-12 06:16:04,857 INFO L226 Difference]: Without dead ends: 1189 [2020-11-12 06:16:04,857 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2020-11-12 06:16:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-11-12 06:16:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1189. [2020-11-12 06:16:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 1165 states have (on average 2.345922746781116) internal successors, (2733), 1188 states have internal predecessors, (2733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 2733 transitions. [2020-11-12 06:16:04,880 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 2733 transitions. Word has length 72 [2020-11-12 06:16:04,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:04,881 INFO L481 AbstractCegarLoop]: Abstraction has 1189 states and 2733 transitions. [2020-11-12 06:16:04,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 15 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 2733 transitions. [2020-11-12 06:16:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-12 06:16:04,883 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:04,884 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:04,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-12 06:16:04,884 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1890431143, now seen corresponding path program 2 times [2020-11-12 06:16:04,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:04,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493361167] [2020-11-12 06:16:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:05,208 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-12 06:16:05,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493361167] [2020-11-12 06:16:05,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:05,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-12 06:16:05,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126694546] [2020-11-12 06:16:05,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-12 06:16:05,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:05,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-12 06:16:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-11-12 06:16:05,210 INFO L87 Difference]: Start difference. First operand 1189 states and 2733 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:05,630 INFO L93 Difference]: Finished difference Result 1726 states and 4129 transitions. [2020-11-12 06:16:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-12 06:16:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2020-11-12 06:16:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:05,633 INFO L225 Difference]: With dead ends: 1726 [2020-11-12 06:16:05,633 INFO L226 Difference]: Without dead ends: 1242 [2020-11-12 06:16:05,633 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2020-11-12 06:16:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-11-12 06:16:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 979. [2020-11-12 06:16:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 961 states have (on average 2.3548387096774195) internal successors, (2263), 978 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2263 transitions. [2020-11-12 06:16:05,649 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2263 transitions. Word has length 72 [2020-11-12 06:16:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:05,649 INFO L481 AbstractCegarLoop]: Abstraction has 979 states and 2263 transitions. [2020-11-12 06:16:05,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2263 transitions. [2020-11-12 06:16:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-11-12 06:16:05,651 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:05,651 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:05,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-12 06:16:05,651 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -62879715, now seen corresponding path program 1 times [2020-11-12 06:16:05,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:05,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128430794] [2020-11-12 06:16:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 06:16:05,850 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-12 06:16:05,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128430794] [2020-11-12 06:16:05,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 06:16:05,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-12 06:16:05,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618292739] [2020-11-12 06:16:05,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-12 06:16:05,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 06:16:05,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-12 06:16:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-12 06:16:05,852 INFO L87 Difference]: Start difference. First operand 979 states and 2263 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 06:16:06,059 INFO L93 Difference]: Finished difference Result 607 states and 1156 transitions. [2020-11-12 06:16:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-12 06:16:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2020-11-12 06:16:06,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 06:16:06,061 INFO L225 Difference]: With dead ends: 607 [2020-11-12 06:16:06,061 INFO L226 Difference]: Without dead ends: 278 [2020-11-12 06:16:06,062 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-12 06:16:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2020-11-12 06:16:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2020-11-12 06:16:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 269 states have (on average 1.8921933085501859) internal successors, (509), 277 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 509 transitions. [2020-11-12 06:16:06,068 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 509 transitions. Word has length 72 [2020-11-12 06:16:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 06:16:06,068 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 509 transitions. [2020-11-12 06:16:06,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-12 06:16:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 509 transitions. [2020-11-12 06:16:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-12 06:16:06,069 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 06:16:06,070 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 06:16:06,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-12 06:16:06,070 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 06:16:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 06:16:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1673174653, now seen corresponding path program 1 times [2020-11-12 06:16:06,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 06:16:06,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733342721] [2020-11-12 06:16:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 06:16:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 06:16:06,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 06:16:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 06:16:06,217 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 06:16:06,292 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 06:16:06,292 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 06:16:06,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-12 06:16:06,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:16:06 BasicIcfg [2020-11-12 06:16:06,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 06:16:06,500 INFO L168 Benchmark]: Toolchain (without parser) took 31735.74 ms. Allocated memory was 302.0 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 275.2 MB in the beginning and 679.5 MB in the end (delta: -404.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,501 INFO L168 Benchmark]: CDTParser took 2.72 ms. Allocated memory is still 302.0 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 06:16:06,501 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.51 ms. Allocated memory is still 302.0 MB. Free memory was 274.6 MB in the beginning and 272.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,502 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.94 ms. Allocated memory is still 302.0 MB. Free memory was 272.5 MB in the beginning and 269.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,502 INFO L168 Benchmark]: Boogie Preprocessor took 63.13 ms. Allocated memory is still 302.0 MB. Free memory was 269.4 MB in the beginning and 267.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,503 INFO L168 Benchmark]: RCFGBuilder took 2651.38 ms. Allocated memory was 302.0 MB in the beginning and 364.9 MB in the end (delta: 62.9 MB). Free memory was 267.3 MB in the beginning and 209.6 MB in the end (delta: 57.7 MB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,503 INFO L168 Benchmark]: TraceAbstraction took 28150.36 ms. Allocated memory was 364.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 209.6 MB in the beginning and 679.5 MB in the end (delta: -469.9 MB). Peak memory consumption was 888.0 MB. Max. memory is 16.0 GB. [2020-11-12 06:16:06,506 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.72 ms. Allocated memory is still 302.0 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 786.51 ms. Allocated memory is still 302.0 MB. Free memory was 274.6 MB in the beginning and 272.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 69.94 ms. Allocated memory is still 302.0 MB. Free memory was 272.5 MB in the beginning and 269.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 63.13 ms. Allocated memory is still 302.0 MB. Free memory was 269.4 MB in the beginning and 267.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2651.38 ms. Allocated memory was 302.0 MB in the beginning and 364.9 MB in the end (delta: 62.9 MB). Free memory was 267.3 MB in the beginning and 209.6 MB in the end (delta: 57.7 MB). Peak memory consumption was 121.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 28150.36 ms. Allocated memory was 364.9 MB in the beginning and 1.7 GB in the end (delta: 1.4 GB). Free memory was 209.6 MB in the beginning and 679.5 MB in the end (delta: -469.9 MB). Peak memory consumption was 888.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L719] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L720] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L721] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L722] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L723] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L725] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L726] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L727] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L728] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L729] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L730] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L731] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L732] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L733] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L734] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L735] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L737] 0 _Bool weak$$choice2; 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] [L818] 0 pthread_t t2037; 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] [L819] FCALL, FORK 0 pthread_create(&t2037, ((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] [L820] 0 pthread_t t2038; 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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L821] FCALL, FORK 0 pthread_create(&t2038, ((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=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] [L822] 0 pthread_t t2039; 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=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}, 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}, 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 [L823] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) 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] [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 VAL [__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=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] [L793] 3 z = 1 VAL [__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 VAL [__unbuffered_cnt=2, __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=2, 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=0, z$w_buff1=0, z$w_buff1_used=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 VAL [__unbuffered_cnt=3, __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=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__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=0, weak$$choice2=0, x=2, y=1, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__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=0, weak$$choice2=0, x=2, y=1, z=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [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 VAL [__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] [L18] COND TRUE 0 !expression VAL [__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] [L17] COND FALSE 0 !(0) VAL [__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] [L17] 0 __assert_fail ("0", "safe011_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__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: 27.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 2966 SDtfs, 4732 SDslu, 13300 SDs, 0 SdLazy, 2616 SolverSat, 535 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 51 SyntacticMatches, 10 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17065occurred 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: 2.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 3595 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1816 NumberOfCodeBlocks, 1816 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1715 ConstructedInterpolants, 0 QuantifiedInterpolants, 728698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...