/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 21:57:51,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 21:57:51,462 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 21:57:51,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 21:57:51,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 21:57:51,511 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 21:57:51,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 21:57:51,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 21:57:51,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 21:57:51,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 21:57:51,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 21:57:51,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 21:57:51,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 21:57:51,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 21:57:51,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 21:57:51,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 21:57:51,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 21:57:51,534 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 21:57:51,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 21:57:51,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 21:57:51,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 21:57:51,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 21:57:51,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 21:57:51,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 21:57:51,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 21:57:51,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 21:57:51,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 21:57:51,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 21:57:51,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 21:57:51,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 21:57:51,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 21:57:51,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 21:57:51,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 21:57:51,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 21:57:51,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 21:57:51,574 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 21:57:51,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 21:57:51,575 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 21:57:51,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 21:57:51,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 21:57:51,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 21:57:51,580 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 21:57:51,617 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 21:57:51,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 21:57:51,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 21:57:51,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 21:57:51,619 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 21:57:51,619 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 21:57:51,620 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 21:57:51,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 21:57:51,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 21:57:51,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 21:57:51,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 21:57:51,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 21:57:51,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 21:57:51,622 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 21:57:51,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 21:57:51,623 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 21:57:51,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 21:57:51,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 21:57:51,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 21:57:51,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 21:57:51,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 21:57:51,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:57:51,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 21:57:51,625 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 21:57:51,625 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 21:57:51,625 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 21:57:51,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 21:57:51,626 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 21:57:51,626 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 21:57:51,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 21:57:51,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 21:57:51,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 21:57:51,963 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 21:57:51,963 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 21:57:51,964 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2020-10-15 21:57:52,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98db61b8d/fd77ef272aed4b66afbcf10fc7c1d027/FLAG2e31a00e8 [2020-10-15 21:57:52,509 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 21:57:52,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_pso.oepc.i [2020-10-15 21:57:52,529 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98db61b8d/fd77ef272aed4b66afbcf10fc7c1d027/FLAG2e31a00e8 [2020-10-15 21:57:52,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98db61b8d/fd77ef272aed4b66afbcf10fc7c1d027 [2020-10-15 21:57:52,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 21:57:52,828 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 21:57:52,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 21:57:52,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 21:57:52,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 21:57:52,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:57:52" (1/1) ... [2020-10-15 21:57:52,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d94b118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:52, skipping insertion in model container [2020-10-15 21:57:52,837 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:57:52" (1/1) ... [2020-10-15 21:57:52,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 21:57:52,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 21:57:53,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:57:53,435 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 21:57:53,497 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 21:57:53,587 INFO L208 MainTranslator]: Completed translation [2020-10-15 21:57:53,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53 WrapperNode [2020-10-15 21:57:53,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 21:57:53,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 21:57:53,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 21:57:53,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 21:57:53,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 21:57:53,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 21:57:53,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 21:57:53,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 21:57:53,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... [2020-10-15 21:57:53,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 21:57:53,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 21:57:53,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 21:57:53,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 21:57:53,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 21:57:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 21:57:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 21:57:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 21:57:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 21:57:53,767 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 21:57:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 21:57:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 21:57:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 21:57:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 21:57:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 21:57:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 21:57:53,771 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 21:57:55,557 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 21:57:55,558 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 21:57:55,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:57:55 BoogieIcfgContainer [2020-10-15 21:57:55,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 21:57:55,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 21:57:55,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 21:57:55,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 21:57:55,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:57:52" (1/3) ... [2020-10-15 21:57:55,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e400c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:57:55, skipping insertion in model container [2020-10-15 21:57:55,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:57:53" (2/3) ... [2020-10-15 21:57:55,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e400c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:57:55, skipping insertion in model container [2020-10-15 21:57:55,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:57:55" (3/3) ... [2020-10-15 21:57:55,569 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_pso.oepc.i [2020-10-15 21:57:55,580 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 21:57:55,581 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 21:57:55,591 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 21:57:55,592 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 21:57:55,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,635 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,635 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,639 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,639 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,640 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,644 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,662 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,663 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,663 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 21:57:55,689 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 21:57:55,711 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 21:57:55,712 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 21:57:55,712 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 21:57:55,712 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 21:57:55,712 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 21:57:55,712 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 21:57:55,712 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 21:57:55,713 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 21:57:55,730 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 21:57:55,733 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 79 transitions, 168 flow [2020-10-15 21:57:55,735 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 79 transitions, 168 flow [2020-10-15 21:57:55,738 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2020-10-15 21:57:55,778 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2020-10-15 21:57:55,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 21:57:55,783 INFO L80 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2020-10-15 21:57:55,785 INFO L117 LiptonReduction]: Number of co-enabled transitions 1024 [2020-10-15 21:57:55,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:57:55,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:55,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:55,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:55,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:55,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:55,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:55,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:55,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:55,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:55,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:55,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:55,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:55,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:55,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:55,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:57:56,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:56,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:57:56,365 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:56,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:56,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:56,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:56,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:56,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:56,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:56,791 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 21:57:56,906 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 21:57:56,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:56,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:56,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:56,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:56,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,298 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2020-10-15 21:57:57,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:57:57,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:57,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:57,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:57:57,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-15 21:57:57,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:57,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:57,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:57,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:57,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:57,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:57,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:58,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,053 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 21:57:58,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 21:57:58,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:58,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:58,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 21:57:58,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:58,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 21:57:58,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 21:57:58,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:57:58,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 21:57:58,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 21:57:58,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 21:57:58,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 21:57:58,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:58,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 21:57:58,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 21:57:59,314 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-15 21:57:59,424 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-15 21:57:59,431 INFO L132 LiptonReduction]: Checked pairs total: 2787 [2020-10-15 21:57:59,431 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-15 21:57:59,438 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2020-10-15 21:57:59,460 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 230 states. [2020-10-15 21:57:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states. [2020-10-15 21:57:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 21:57:59,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:57:59,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 21:57:59,470 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:57:59,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:57:59,476 INFO L82 PathProgramCache]: Analyzing trace with hash 910326, now seen corresponding path program 1 times [2020-10-15 21:57:59,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:57:59,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805866806] [2020-10-15 21:57:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:57:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:57:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:57:59,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805866806] [2020-10-15 21:57:59,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:57:59,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 21:57:59,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411011064] [2020-10-15 21:57:59,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 21:57:59,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:57:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 21:57:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:57:59,716 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 3 states. [2020-10-15 21:57:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:57:59,789 INFO L93 Difference]: Finished difference Result 192 states and 464 transitions. [2020-10-15 21:57:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 21:57:59,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 21:57:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:57:59,804 INFO L225 Difference]: With dead ends: 192 [2020-10-15 21:57:59,804 INFO L226 Difference]: Without dead ends: 162 [2020-10-15 21:57:59,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 21:57:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2020-10-15 21:57:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2020-10-15 21:57:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-15 21:57:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2020-10-15 21:57:59,860 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 3 [2020-10-15 21:57:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:57:59,860 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2020-10-15 21:57:59,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 21:57:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2020-10-15 21:57:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 21:57:59,861 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:57:59,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:57:59,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 21:57:59,862 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:57:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:57:59,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1326908720, now seen corresponding path program 1 times [2020-10-15 21:57:59,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:57:59,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665122668] [2020-10-15 21:57:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:57:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:58:00,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665122668] [2020-10-15 21:58:00,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:58:00,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259440429] [2020-10-15 21:58:00,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:58:00,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:58:00,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:58:00,006 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2020-10-15 21:58:00,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,044 INFO L93 Difference]: Finished difference Result 188 states and 424 transitions. [2020-10-15 21:58:00,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:58:00,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-15 21:58:00,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,047 INFO L225 Difference]: With dead ends: 188 [2020-10-15 21:58:00,047 INFO L226 Difference]: Without dead ends: 158 [2020-10-15 21:58:00,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:58:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-15 21:58:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-10-15 21:58:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-10-15 21:58:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 373 transitions. [2020-10-15 21:58:00,062 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 373 transitions. Word has length 8 [2020-10-15 21:58:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,063 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 373 transitions. [2020-10-15 21:58:00,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:58:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 373 transitions. [2020-10-15 21:58:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 21:58:00,064 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 21:58:00,064 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1815483139, now seen corresponding path program 1 times [2020-10-15 21:58:00,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327506296] [2020-10-15 21:58:00,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,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-10-15 21:58:00,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327506296] [2020-10-15 21:58:00,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 21:58:00,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647320797] [2020-10-15 21:58:00,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:58:00,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:58:00,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:58:00,187 INFO L87 Difference]: Start difference. First operand 158 states and 373 transitions. Second operand 4 states. [2020-10-15 21:58:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,212 INFO L93 Difference]: Finished difference Result 170 states and 382 transitions. [2020-10-15 21:58:00,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:58:00,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-15 21:58:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,214 INFO L225 Difference]: With dead ends: 170 [2020-10-15 21:58:00,214 INFO L226 Difference]: Without dead ends: 142 [2020-10-15 21:58:00,214 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:58:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-15 21:58:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-10-15 21:58:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-10-15 21:58:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2020-10-15 21:58:00,224 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 9 [2020-10-15 21:58:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,225 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2020-10-15 21:58:00,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:58:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2020-10-15 21:58:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 21:58:00,226 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,226 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 21:58:00,227 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash -445440620, now seen corresponding path program 1 times [2020-10-15 21:58:00,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334462309] [2020-10-15 21:58:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:58:00,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334462309] [2020-10-15 21:58:00,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:58:00,311 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534248753] [2020-10-15 21:58:00,311 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:58:00,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:58:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:58:00,312 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 4 states. [2020-10-15 21:58:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,340 INFO L93 Difference]: Finished difference Result 108 states and 206 transitions. [2020-10-15 21:58:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 21:58:00,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 21:58:00,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,342 INFO L225 Difference]: With dead ends: 108 [2020-10-15 21:58:00,342 INFO L226 Difference]: Without dead ends: 78 [2020-10-15 21:58:00,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:58:00,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-15 21:58:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-10-15 21:58:00,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-15 21:58:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 137 transitions. [2020-10-15 21:58:00,349 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 137 transitions. Word has length 10 [2020-10-15 21:58:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,349 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 137 transitions. [2020-10-15 21:58:00,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:58:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2020-10-15 21:58:00,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 21:58:00,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 21:58:00,351 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1812777298, now seen corresponding path program 1 times [2020-10-15 21:58:00,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287428598] [2020-10-15 21:58:00,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:58:00,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287428598] [2020-10-15 21:58:00,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 21:58:00,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729360273] [2020-10-15 21:58:00,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 21:58:00,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 21:58:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:58:00,498 INFO L87 Difference]: Start difference. First operand 78 states and 137 transitions. Second operand 5 states. [2020-10-15 21:58:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,543 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2020-10-15 21:58:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 21:58:00,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 21:58:00,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,544 INFO L225 Difference]: With dead ends: 56 [2020-10-15 21:58:00,544 INFO L226 Difference]: Without dead ends: 46 [2020-10-15 21:58:00,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 21:58:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-15 21:58:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-10-15 21:58:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-15 21:58:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-10-15 21:58:00,548 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 13 [2020-10-15 21:58:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,548 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2020-10-15 21:58:00,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 21:58:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2020-10-15 21:58:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:58:00,550 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 21:58:00,550 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1017140544, now seen corresponding path program 1 times [2020-10-15 21:58:00,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677131630] [2020-10-15 21:58:00,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:58:00,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677131630] [2020-10-15 21:58:00,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 21:58:00,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673874474] [2020-10-15 21:58:00,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 21:58:00,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 21:58:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 21:58:00,667 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 4 states. [2020-10-15 21:58:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,689 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2020-10-15 21:58:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 21:58:00,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 21:58:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,690 INFO L225 Difference]: With dead ends: 64 [2020-10-15 21:58:00,690 INFO L226 Difference]: Without dead ends: 36 [2020-10-15 21:58:00,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 21:58:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-15 21:58:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-15 21:58:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-15 21:58:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-15 21:58:00,693 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2020-10-15 21:58:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,693 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-15 21:58:00,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 21:58:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-15 21:58:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:58:00,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 21:58:00,695 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1654369168, now seen corresponding path program 2 times [2020-10-15 21:58:00,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234972735] [2020-10-15 21:58:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 21:58:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 21:58:00,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234972735] [2020-10-15 21:58:00,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 21:58:00,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 21:58:00,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524485268] [2020-10-15 21:58:00,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 21:58:00,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 21:58:00,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 21:58:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 21:58:00,844 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 7 states. [2020-10-15 21:58:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 21:58:00,954 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2020-10-15 21:58:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 21:58:00,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-10-15 21:58:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 21:58:00,955 INFO L225 Difference]: With dead ends: 45 [2020-10-15 21:58:00,955 INFO L226 Difference]: Without dead ends: 26 [2020-10-15 21:58:00,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-15 21:58:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-10-15 21:58:00,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-10-15 21:58:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-15 21:58:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-10-15 21:58:00,958 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2020-10-15 21:58:00,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 21:58:00,958 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-10-15 21:58:00,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 21:58:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-10-15 21:58:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 21:58:00,959 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 21:58:00,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 21:58:00,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 21:58:00,960 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 21:58:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 21:58:00,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1455185480, now seen corresponding path program 3 times [2020-10-15 21:58:00,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 21:58:00,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006903375] [2020-10-15 21:58:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 21:58:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:58:01,004 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:58:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 21:58:01,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 21:58:01,085 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 21:58:01,085 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 21:58:01,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 21:58:01,102 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,103 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,104 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,105 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,106 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,106 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,107 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,107 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,107 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,108 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,108 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,108 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,109 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,109 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,109 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,110 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,110 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,110 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,110 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,111 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,111 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,111 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,112 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,112 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,113 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,113 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,113 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,114 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,115 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,116 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,116 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,116 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,117 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 21:58:01,117 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 21:58:01,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:58:01 BasicIcfg [2020-10-15 21:58:01,162 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 21:58:01,164 INFO L168 Benchmark]: Toolchain (without parser) took 8336.78 ms. Allocated memory was 254.8 MB in the beginning and 512.2 MB in the end (delta: 257.4 MB). Free memory was 210.0 MB in the beginning and 323.2 MB in the end (delta: -113.3 MB). Peak memory consumption was 144.2 MB. Max. memory is 14.2 GB. [2020-10-15 21:58:01,164 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:58:01,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.60 ms. Allocated memory was 254.8 MB in the beginning and 324.5 MB in the end (delta: 69.7 MB). Free memory was 210.0 MB in the beginning and 274.8 MB in the end (delta: -64.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. [2020-10-15 21:58:01,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.44 ms. Allocated memory is still 324.5 MB. Free memory was 274.8 MB in the beginning and 272.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:58:01,167 INFO L168 Benchmark]: Boogie Preprocessor took 46.61 ms. Allocated memory is still 324.5 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 21:58:01,168 INFO L168 Benchmark]: RCFGBuilder took 1866.72 ms. Allocated memory was 324.5 MB in the beginning and 363.3 MB in the end (delta: 38.8 MB). Free memory was 272.3 MB in the beginning and 225.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. [2020-10-15 21:58:01,168 INFO L168 Benchmark]: TraceAbstraction took 5600.98 ms. Allocated memory was 363.3 MB in the beginning and 512.2 MB in the end (delta: 148.9 MB). Free memory was 225.8 MB in the beginning and 323.2 MB in the end (delta: -97.4 MB). Peak memory consumption was 51.5 MB. Max. memory is 14.2 GB. [2020-10-15 21:58:01,172 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 254.8 MB. Free memory is still 231.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 760.60 ms. Allocated memory was 254.8 MB in the beginning and 324.5 MB in the end (delta: 69.7 MB). Free memory was 210.0 MB in the beginning and 274.8 MB in the end (delta: -64.9 MB). Peak memory consumption was 33.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 56.44 ms. Allocated memory is still 324.5 MB. Free memory was 274.8 MB in the beginning and 272.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.61 ms. Allocated memory is still 324.5 MB. Free memory is still 272.3 MB. There was no memory consumed. Max. memory is 14.2 GB. * RCFGBuilder took 1866.72 ms. Allocated memory was 324.5 MB in the beginning and 363.3 MB in the end (delta: 38.8 MB). Free memory was 272.3 MB in the beginning and 225.8 MB in the end (delta: 46.5 MB). Peak memory consumption was 101.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5600.98 ms. Allocated memory was 363.3 MB in the beginning and 512.2 MB in the end (delta: 148.9 MB). Free memory was 225.8 MB in the beginning and 323.2 MB in the end (delta: -97.4 MB). Peak memory consumption was 51.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 675 VarBasedMoverChecksPositive, 51 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 74 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.6s, 84 PlacesBefore, 28 PlacesAfterwards, 79 TransitionsBefore, 22 TransitionsAfterwards, 1024 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2787 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L701] 0 int __unbuffered_p1_EBX = 0; [L702] 0 _Bool main$tmp_guard0; [L703] 0 _Bool main$tmp_guard1; [L705] 0 int x = 0; [L707] 0 int y = 0; [L709] 0 int z = 0; [L710] 0 _Bool z$flush_delayed; [L711] 0 int z$mem_tmp; [L712] 0 _Bool z$r_buff0_thd0; [L713] 0 _Bool z$r_buff0_thd1; [L714] 0 _Bool z$r_buff0_thd2; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$read_delayed; [L719] 0 int *z$read_delayed_var; [L720] 0 int z$w_buff0; [L721] 0 _Bool z$w_buff0_used; [L722] 0 int z$w_buff1; [L723] 0 _Bool z$w_buff1_used; [L724] 0 _Bool weak$$choice0; [L725] 0 _Bool weak$$choice2; [L804] 0 pthread_t t1093; [L805] FCALL, FORK 0 pthread_create(&t1093, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 0 pthread_t t1094; [L807] FCALL, FORK 0 pthread_create(&t1094, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 1 z$w_buff1 = z$w_buff0 [L730] 1 z$w_buff0 = 1 [L731] 1 z$w_buff1_used = z$w_buff0_used [L732] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 x = 2 [L760] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L776] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z [L778] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L778] 2 z = z$flush_delayed ? z$mem_tmp : z [L779] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L747] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L786] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L752] 1 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L817] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 148 SDtfs, 127 SDslu, 236 SDs, 0 SdLazy, 100 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 3256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...