/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-12 00:09:48,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-12 00:09:48,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-12 00:09:48,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-12 00:09:48,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-12 00:09:48,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-12 00:09:48,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-12 00:09:48,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-12 00:09:48,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-12 00:09:48,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-12 00:09:48,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-12 00:09:48,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-12 00:09:48,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-12 00:09:48,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-12 00:09:48,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-12 00:09:48,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-12 00:09:48,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-12 00:09:48,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-12 00:09:48,483 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-12 00:09:48,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-12 00:09:48,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-12 00:09:48,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-12 00:09:48,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-12 00:09:48,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-12 00:09:48,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-12 00:09:48,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-12 00:09:48,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-12 00:09:48,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-12 00:09:48,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-12 00:09:48,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-12 00:09:48,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-12 00:09:48,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-12 00:09:48,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-12 00:09:48,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-12 00:09:48,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-12 00:09:48,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-12 00:09:48,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-12 00:09:48,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-12 00:09:48,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-12 00:09:48,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-12 00:09:48,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-12 00:09:48,519 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-11-12 00:09:48,577 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-12 00:09:48,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-12 00:09:48,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-12 00:09:48,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-12 00:09:48,581 INFO L138 SettingsManager]: * Use SBE=true [2020-11-12 00:09:48,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-12 00:09:48,582 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-12 00:09:48,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-12 00:09:48,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-12 00:09:48,583 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-12 00:09:48,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-12 00:09:48,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-12 00:09:48,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-12 00:09:48,584 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-12 00:09:48,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-12 00:09:48,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-12 00:09:48,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-12 00:09:48,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-12 00:09:48,585 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-12 00:09:48,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-12 00:09:48,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-12 00:09:48,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-12 00:09:48,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-12 00:09:48,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-12 00:09:48,587 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-12 00:09:48,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-12 00:09:48,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-12 00:09:48,588 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-12 00:09:48,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-12 00:09:48,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-12 00:09:49,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-12 00:09:49,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-12 00:09:49,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-12 00:09:49,021 INFO L275 PluginConnector]: CDTParser initialized [2020-11-12 00:09:49,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-11-12 00:09:49,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0ce2636/813e69dcf22f4986a0dade15b0add1f2/FLAG6f032cd26 [2020-11-12 00:09:49,782 INFO L306 CDTParser]: Found 1 translation units. [2020-11-12 00:09:49,783 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2020-11-12 00:09:49,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0ce2636/813e69dcf22f4986a0dade15b0add1f2/FLAG6f032cd26 [2020-11-12 00:09:49,991 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0ce2636/813e69dcf22f4986a0dade15b0add1f2 [2020-11-12 00:09:49,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-12 00:09:50,004 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-12 00:09:50,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-12 00:09:50,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-12 00:09:50,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-12 00:09:50,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:49" (1/1) ... [2020-11-12 00:09:50,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1701b0c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50, skipping insertion in model container [2020-11-12 00:09:50,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:09:49" (1/1) ... [2020-11-12 00:09:50,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-12 00:09:50,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-12 00:09:50,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:09:50,616 INFO L203 MainTranslator]: Completed pre-run [2020-11-12 00:09:50,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-12 00:09:50,832 INFO L208 MainTranslator]: Completed translation [2020-11-12 00:09:50,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50 WrapperNode [2020-11-12 00:09:50,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-12 00:09:50,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-12 00:09:50,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-12 00:09:50,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-12 00:09:50,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:50,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:50,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-12 00:09:50,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-12 00:09:50,950 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-12 00:09:50,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-12 00:09:50,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:50,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:50,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:50,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:51,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:51,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:51,016 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (1/1) ... [2020-11-12 00:09:51,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-12 00:09:51,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-12 00:09:51,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-12 00:09:51,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-12 00:09:51,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (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 00:09:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-12 00:09:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-12 00:09:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-12 00:09:51,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-12 00:09:51,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-12 00:09:51,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-12 00:09:51,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-12 00:09:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-12 00:09:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-12 00:09:51,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-12 00:09:51,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-12 00:09:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-12 00:09:51,134 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 00:09:53,359 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-12 00:09:53,359 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-12 00:09:53,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:53 BoogieIcfgContainer [2020-11-12 00:09:53,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-12 00:09:53,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-12 00:09:53,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-12 00:09:53,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-12 00:09:53,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:09:49" (1/3) ... [2020-11-12 00:09:53,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587da7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:53, skipping insertion in model container [2020-11-12 00:09:53,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:09:50" (2/3) ... [2020-11-12 00:09:53,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587da7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:09:53, skipping insertion in model container [2020-11-12 00:09:53,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:09:53" (3/3) ... [2020-11-12 00:09:53,370 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2020-11-12 00:09:53,386 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-12 00:09:53,386 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-12 00:09:53,390 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-12 00:09:53,391 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-12 00:09:53,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,426 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,432 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,434 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,450 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-12 00:09:53,453 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-12 00:09:53,466 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-11-12 00:09:53,489 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-12 00:09:53,489 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-12 00:09:53,489 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-12 00:09:53,489 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-12 00:09:53,490 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-12 00:09:53,490 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-12 00:09:53,490 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-12 00:09:53,490 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-12 00:09:53,502 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-12 00:09:53,504 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-12 00:09:53,507 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 176 flow [2020-11-12 00:09:53,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 176 flow [2020-11-12 00:09:53,552 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2020-11-12 00:09:53,552 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-12 00:09:53,556 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 3/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-11-12 00:09:53,559 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-11-12 00:09:54,190 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-12 00:09:54,420 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-12 00:09:55,045 WARN L193 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-12 00:09:55,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-12 00:09:55,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:55,570 WARN L193 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-12 00:09:55,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 00:09:55,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:55,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 00:09:55,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:55,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:55,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:55,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 00:09:55,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 00:09:55,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 00:09:55,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:56,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 00:09:56,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,439 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-12 00:09:56,544 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-12 00:09:56,812 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:56,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:56,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:56,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:56,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,916 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:56,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:09:56,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 00:09:56,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-11-12 00:09:56,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-12 00:09:56,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:56,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:56,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 00:09:56,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-12 00:09:56,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-12 00:09:56,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:57,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:57,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:57,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-12 00:09:57,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-11-12 00:09:57,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:57,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:57,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,884 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:57,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:57,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 00:09:57,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 00:09:57,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:57,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:57,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:57,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:57,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:57,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:57,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:58,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:58,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:58,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:58,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:58,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:58,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:09:58,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:09:58,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:58,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:09:58,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:09:58,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:58,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:58,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-12 00:09:58,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-12 00:09:58,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-12 00:09:58,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 2, 1] term [2020-11-12 00:09:58,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:09:58,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:09:58,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:00,109 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-11-12 00:10:00,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-12 00:10:00,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:00,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:10:00,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:00,975 WARN L193 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-11-12 00:10:03,449 WARN L193 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2020-11-12 00:10:03,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:03,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:03,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-12 00:10:03,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-12 00:10:03,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-12 00:10:03,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:03,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-12 00:10:03,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:03,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:03,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:10:03,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:03,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 2, 1] term [2020-11-12 00:10:03,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:03,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 1] term [2020-11-12 00:10:03,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:07,620 WARN L193 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 366 DAG size of output: 267 [2020-11-12 00:10:07,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:07,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:07,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:10:07,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:10:07,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:10:07,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:07,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:07,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-12 00:10:07,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:07,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-12 00:10:07,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:08,258 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-12 00:10:08,475 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-12 00:10:09,957 WARN L193 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 227 DAG size of output: 187 [2020-11-12 00:10:09,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-12 00:10:09,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:09,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-11-12 00:10:09,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:11,087 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 142 DAG size of output: 105 [2020-11-12 00:10:13,858 WARN L193 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 311 DAG size of output: 267 [2020-11-12 00:10:13,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-12 00:10:13,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-12 00:10:13,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2020-11-12 00:10:13,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-12 00:10:13,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-12 00:10:13,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-12 00:10:13,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:13,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:13,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:13,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-12 00:10:13,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-12 00:10:13,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-12 00:10:13,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:13,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-12 00:10:13,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-12 00:10:17,838 WARN L193 SmtUtils]: Spent 3.91 s on a formula simplification. DAG size of input: 364 DAG size of output: 241 [2020-11-12 00:10:19,783 WARN L193 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2020-11-12 00:10:20,206 WARN L193 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-12 00:10:23,943 WARN L193 SmtUtils]: Spent 3.73 s on a formula simplification. DAG size of input: 267 DAG size of output: 253 [2020-11-12 00:10:25,146 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 252 [2020-11-12 00:10:25,793 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-12 00:10:26,016 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-12 00:10:26,488 WARN L193 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2020-11-12 00:10:26,712 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-12 00:10:26,813 INFO L131 LiptonReduction]: Checked pairs total: 3077 [2020-11-12 00:10:26,813 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-11-12 00:10:26,821 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 20 transitions, 50 flow [2020-11-12 00:10:26,851 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 162 states, 158 states have (on average 2.6265822784810124) internal successors, (415), 161 states have internal predecessors, (415), 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 00:10:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 158 states have (on average 2.6265822784810124) internal successors, (415), 161 states have internal predecessors, (415), 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 00:10:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-12 00:10:26,863 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:26,864 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-12 00:10:26,864 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:26,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:26,875 INFO L82 PathProgramCache]: Analyzing trace with hash 910761025, now seen corresponding path program 1 times [2020-11-12 00:10:26,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:26,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246755403] [2020-11-12 00:10:26,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:27,158 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 00:10:27,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246755403] [2020-11-12 00:10:27,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:27,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:10:27,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578063089] [2020-11-12 00:10:27,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:10:27,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:27,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:10:27,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:27,184 INFO L87 Difference]: Start difference. First operand has 162 states, 158 states have (on average 2.6265822784810124) internal successors, (415), 161 states have internal predecessors, (415), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 00:10:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:27,269 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-11-12 00:10:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:10:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2020-11-12 00:10:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:27,281 INFO L225 Difference]: With dead ends: 137 [2020-11-12 00:10:27,281 INFO L226 Difference]: Without dead ends: 112 [2020-11-12 00:10:27,282 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-12 00:10:27,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-12 00:10:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.2972972972972974) internal successors, (255), 111 states have internal predecessors, (255), 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 00:10:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-11-12 00:10:27,329 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-11-12 00:10:27,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:27,329 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-11-12 00:10:27,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 00:10:27,329 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-11-12 00:10:27,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-12 00:10:27,330 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:27,330 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:27,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-12 00:10:27,331 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:27,331 INFO L82 PathProgramCache]: Analyzing trace with hash -931913313, now seen corresponding path program 1 times [2020-11-12 00:10:27,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:27,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796185419] [2020-11-12 00:10:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:27,428 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 00:10:27,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796185419] [2020-11-12 00:10:27,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:27,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:10:27,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960148712] [2020-11-12 00:10:27,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:10:27,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:10:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:27,434 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 00:10:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:27,481 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-11-12 00:10:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:10:27,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2020-11-12 00:10:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:27,488 INFO L225 Difference]: With dead ends: 111 [2020-11-12 00:10:27,488 INFO L226 Difference]: Without dead ends: 111 [2020-11-12 00:10:27,489 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-12 00:10:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-11-12 00:10:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.290909090909091) internal successors, (252), 110 states have internal predecessors, (252), 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 00:10:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-11-12 00:10:27,506 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-11-12 00:10:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:27,506 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-11-12 00:10:27,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 00:10:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-11-12 00:10:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-12 00:10:27,507 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:27,508 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:27,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-12 00:10:27,508 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:27,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash 643521171, now seen corresponding path program 1 times [2020-11-12 00:10:27,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:27,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133864282] [2020-11-12 00:10:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:27,671 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 00:10:27,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133864282] [2020-11-12 00:10:27,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:27,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-12 00:10:27,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88944511] [2020-11-12 00:10:27,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:10:27,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:10:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:27,674 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 00:10:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:27,725 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-11-12 00:10:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:10:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2020-11-12 00:10:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:27,728 INFO L225 Difference]: With dead ends: 107 [2020-11-12 00:10:27,729 INFO L226 Difference]: Without dead ends: 107 [2020-11-12 00:10:27,731 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 00:10:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-11-12 00:10:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-11-12 00:10:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.2735849056603774) internal successors, (241), 106 states have internal predecessors, (241), 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 00:10:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-11-12 00:10:27,750 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 8 [2020-11-12 00:10:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:27,750 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-11-12 00:10:27,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 00:10:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-11-12 00:10:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-12 00:10:27,752 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:27,752 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:27,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-12 00:10:27,752 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:27,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:27,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1174218045, now seen corresponding path program 1 times [2020-11-12 00:10:27,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:27,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318002065] [2020-11-12 00:10:27,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:27,891 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 00:10:27,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318002065] [2020-11-12 00:10:27,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:27,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:10:27,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707704208] [2020-11-12 00:10:27,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-12 00:10:27,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-12 00:10:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:10:27,894 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:10:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:27,968 INFO L93 Difference]: Finished difference Result 103 states and 230 transitions. [2020-11-12 00:10:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-12 00:10:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2020-11-12 00:10:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:27,971 INFO L225 Difference]: With dead ends: 103 [2020-11-12 00:10:27,971 INFO L226 Difference]: Without dead ends: 103 [2020-11-12 00:10:27,971 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:10:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-12 00:10:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-11-12 00:10:27,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 2.2549019607843137) internal successors, (230), 102 states have internal predecessors, (230), 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 00:10:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 230 transitions. [2020-11-12 00:10:27,979 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 230 transitions. Word has length 8 [2020-11-12 00:10:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:27,980 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 230 transitions. [2020-11-12 00:10:27,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 00:10:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 230 transitions. [2020-11-12 00:10:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-12 00:10:27,981 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:27,981 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:27,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-12 00:10:27,981 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:27,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1526920503, now seen corresponding path program 1 times [2020-11-12 00:10:27,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:27,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22182415] [2020-11-12 00:10:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:10:28,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22182415] [2020-11-12 00:10:28,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:28,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:10:28,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414633956] [2020-11-12 00:10:28,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:10:28,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:10:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:10:28,187 INFO L87 Difference]: Start difference. First operand 103 states and 230 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 00:10:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:28,306 INFO L93 Difference]: Finished difference Result 111 states and 244 transitions. [2020-11-12 00:10:28,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-12 00:10:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2020-11-12 00:10:28,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:28,310 INFO L225 Difference]: With dead ends: 111 [2020-11-12 00:10:28,310 INFO L226 Difference]: Without dead ends: 111 [2020-11-12 00:10:28,310 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-12 00:10:28,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-11-12 00:10:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-11-12 00:10:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.2181818181818183) internal successors, (244), 110 states have internal predecessors, (244), 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 00:10:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 244 transitions. [2020-11-12 00:10:28,319 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 244 transitions. Word has length 9 [2020-11-12 00:10:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:28,320 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 244 transitions. [2020-11-12 00:10:28,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 00:10:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 244 transitions. [2020-11-12 00:10:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-12 00:10:28,321 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:28,321 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:28,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-12 00:10:28,322 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1441858536, now seen corresponding path program 1 times [2020-11-12 00:10:28,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:28,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885384569] [2020-11-12 00:10:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:28,388 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 00:10:28,388 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885384569] [2020-11-12 00:10:28,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:28,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-12 00:10:28,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441399926] [2020-11-12 00:10:28,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-12 00:10:28,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-12 00:10:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-12 00:10:28,393 INFO L87 Difference]: Start difference. First operand 111 states and 244 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 00:10:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:28,411 INFO L93 Difference]: Finished difference Result 153 states and 326 transitions. [2020-11-12 00:10:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-12 00:10:28,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2020-11-12 00:10:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:28,414 INFO L225 Difference]: With dead ends: 153 [2020-11-12 00:10:28,414 INFO L226 Difference]: Without dead ends: 95 [2020-11-12 00:10:28,414 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 00:10:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-12 00:10:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89. [2020-11-12 00:10:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 2.0681818181818183) internal successors, (182), 88 states have internal predecessors, (182), 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 00:10:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 182 transitions. [2020-11-12 00:10:28,421 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 182 transitions. Word has length 11 [2020-11-12 00:10:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:28,422 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 182 transitions. [2020-11-12 00:10:28,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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 00:10:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 182 transitions. [2020-11-12 00:10:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-12 00:10:28,430 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:28,430 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:28,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-12 00:10:28,430 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:28,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:28,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1508155880, now seen corresponding path program 1 times [2020-11-12 00:10:28,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:28,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380409213] [2020-11-12 00:10:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-12 00:10:28,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380409213] [2020-11-12 00:10:28,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:28,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-12 00:10:28,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852225139] [2020-11-12 00:10:28,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-12 00:10:28,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-12 00:10:28,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-12 00:10:28,633 INFO L87 Difference]: Start difference. First operand 89 states and 182 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:10:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:28,782 INFO L93 Difference]: Finished difference Result 120 states and 230 transitions. [2020-11-12 00:10:28,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:10:28,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2020-11-12 00:10:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:28,785 INFO L225 Difference]: With dead ends: 120 [2020-11-12 00:10:28,785 INFO L226 Difference]: Without dead ends: 108 [2020-11-12 00:10:28,785 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-12 00:10:28,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-11-12 00:10:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2020-11-12 00:10:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.0) internal successors, (178), 89 states have internal predecessors, (178), 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 00:10:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 178 transitions. [2020-11-12 00:10:28,791 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 178 transitions. Word has length 11 [2020-11-12 00:10:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:28,791 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 178 transitions. [2020-11-12 00:10:28,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 00:10:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 178 transitions. [2020-11-12 00:10:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-12 00:10:28,792 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:28,792 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:28,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-12 00:10:28,792 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:28,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1506224270, now seen corresponding path program 2 times [2020-11-12 00:10:28,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:28,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900806896] [2020-11-12 00:10:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:29,014 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 00:10:29,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900806896] [2020-11-12 00:10:29,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:29,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-12 00:10:29,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325862956] [2020-11-12 00:10:29,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-12 00:10:29,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-12 00:10:29,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-12 00:10:29,017 INFO L87 Difference]: Start difference. First operand 90 states and 178 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 00:10:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:29,249 INFO L93 Difference]: Finished difference Result 110 states and 208 transitions. [2020-11-12 00:10:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-12 00:10:29,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2020-11-12 00:10:29,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:29,253 INFO L225 Difference]: With dead ends: 110 [2020-11-12 00:10:29,253 INFO L226 Difference]: Without dead ends: 72 [2020-11-12 00:10:29,253 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-11-12 00:10:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-12 00:10:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2020-11-12 00:10:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.967741935483871) internal successors, (122), 62 states have internal predecessors, (122), 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 00:10:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 122 transitions. [2020-11-12 00:10:29,266 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 122 transitions. Word has length 11 [2020-11-12 00:10:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:29,266 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 122 transitions. [2020-11-12 00:10:29,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 00:10:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 122 transitions. [2020-11-12 00:10:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-12 00:10:29,267 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:29,267 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:29,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-12 00:10:29,267 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash 858105690, now seen corresponding path program 2 times [2020-11-12 00:10:29,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:29,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509609003] [2020-11-12 00:10:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:29,365 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 00:10:29,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509609003] [2020-11-12 00:10:29,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:29,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-12 00:10:29,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550661951] [2020-11-12 00:10:29,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-12 00:10:29,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-12 00:10:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-12 00:10:29,367 INFO L87 Difference]: Start difference. First operand 63 states and 122 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 00:10:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:29,400 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2020-11-12 00:10:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-12 00:10:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2020-11-12 00:10:29,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:29,402 INFO L225 Difference]: With dead ends: 57 [2020-11-12 00:10:29,402 INFO L226 Difference]: Without dead ends: 40 [2020-11-12 00:10:29,403 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:10:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-12 00:10:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-12 00:10:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 39 states have internal predecessors, (59), 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 00:10:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2020-11-12 00:10:29,405 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 11 [2020-11-12 00:10:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:29,405 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2020-11-12 00:10:29,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 00:10:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2020-11-12 00:10:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-12 00:10:29,406 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:29,406 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:29,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-12 00:10:29,406 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:29,407 INFO L82 PathProgramCache]: Analyzing trace with hash 831036647, now seen corresponding path program 1 times [2020-11-12 00:10:29,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:29,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662475913] [2020-11-12 00:10:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-12 00:10:29,476 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 00:10:29,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662475913] [2020-11-12 00:10:29,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-12 00:10:29,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-12 00:10:29,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384847999] [2020-11-12 00:10:29,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-12 00:10:29,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-12 00:10:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-12 00:10:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-12 00:10:29,478 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 00:10:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-12 00:10:29,523 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2020-11-12 00:10:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-12 00:10:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2020-11-12 00:10:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-12 00:10:29,524 INFO L225 Difference]: With dead ends: 31 [2020-11-12 00:10:29,525 INFO L226 Difference]: Without dead ends: 20 [2020-11-12 00:10:29,525 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-12 00:10:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-11-12 00:10:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-11-12 00:10:29,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 00:10:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-12 00:10:29,527 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-11-12 00:10:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-12 00:10:29,527 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-12 00:10:29,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 00:10:29,527 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-12 00:10:29,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-12 00:10:29,527 INFO L486 BasicCegarLoop]: Found error trace [2020-11-12 00:10:29,528 INFO L494 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-12 00:10:29,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-12 00:10:29,528 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-12 00:10:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-12 00:10:29,528 INFO L82 PathProgramCache]: Analyzing trace with hash 350151708, now seen corresponding path program 1 times [2020-11-12 00:10:29,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-12 00:10:29,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845291775] [2020-11-12 00:10:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-12 00:10:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:10:29,594 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:10:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-12 00:10:29,633 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-12 00:10:29,666 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-12 00:10:29,666 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-12 00:10:29,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-12 00:10:29,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:10:29 BasicIcfg [2020-11-12 00:10:29,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-12 00:10:29,731 INFO L168 Benchmark]: Toolchain (without parser) took 39732.19 ms. Allocated memory was 302.0 MB in the beginning and 597.7 MB in the end (delta: 295.7 MB). Free memory was 275.8 MB in the beginning and 387.7 MB in the end (delta: -111.9 MB). Peak memory consumption was 185.7 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,731 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-12 00:10:29,732 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.11 ms. Allocated memory is still 302.0 MB. Free memory was 275.2 MB in the beginning and 273.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.40 ms. Allocated memory is still 302.0 MB. Free memory was 273.4 MB in the beginning and 270.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,733 INFO L168 Benchmark]: Boogie Preprocessor took 78.22 ms. Allocated memory is still 302.0 MB. Free memory was 270.3 MB in the beginning and 268.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,734 INFO L168 Benchmark]: RCFGBuilder took 2332.93 ms. Allocated memory is still 302.0 MB. Free memory was 268.2 MB in the beginning and 237.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,735 INFO L168 Benchmark]: TraceAbstraction took 36365.61 ms. Allocated memory was 302.0 MB in the beginning and 597.7 MB in the end (delta: 295.7 MB). Free memory was 237.8 MB in the beginning and 387.7 MB in the end (delta: -149.9 MB). Peak memory consumption was 144.7 MB. Max. memory is 16.0 GB. [2020-11-12 00:10:29,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 302.0 MB. Free memory is still 273.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 825.11 ms. Allocated memory is still 302.0 MB. Free memory was 275.2 MB in the beginning and 273.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 113.40 ms. Allocated memory is still 302.0 MB. Free memory was 273.4 MB in the beginning and 270.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 78.22 ms. Allocated memory is still 302.0 MB. Free memory was 270.3 MB in the beginning and 268.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2332.93 ms. Allocated memory is still 302.0 MB. Free memory was 268.2 MB in the beginning and 237.8 MB in the end (delta: 30.4 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 36365.61 ms. Allocated memory was 302.0 MB in the beginning and 597.7 MB in the end (delta: 295.7 MB). Free memory was 237.8 MB in the beginning and 387.7 MB in the end (delta: -149.9 MB). Peak memory consumption was 144.7 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 690 VarBasedMoverChecksPositive, 74 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 62 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 33.3s, 87 PlacesBefore, 26 PlacesAfterwards, 83 TransitionsBefore, 20 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3077 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe029_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 33.3s, HoareTripleCheckerStatistics: 142 SDtfs, 106 SDslu, 150 SDs, 0 SdLazy, 170 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 33 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 5761 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...