/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 14:22:59,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 14:22:59,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 14:22:59,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 14:22:59,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 14:22:59,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 14:22:59,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 14:22:59,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 14:22:59,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 14:22:59,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 14:22:59,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 14:22:59,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 14:22:59,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 14:22:59,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 14:22:59,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 14:22:59,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 14:22:59,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 14:22:59,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 14:22:59,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 14:22:59,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 14:22:59,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 14:22:59,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 14:22:59,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 14:22:59,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 14:22:59,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 14:22:59,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 14:22:59,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 14:22:59,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 14:22:59,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 14:22:59,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 14:22:59,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 14:22:59,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 14:22:59,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 14:22:59,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 14:22:59,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 14:22:59,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 14:22:59,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 14:22:59,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 14:22:59,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 14:22:59,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 14:22:59,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 14:22:59,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 14:22:59,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 14:22:59,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 14:22:59,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 14:22:59,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 14:22:59,584 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 14:22:59,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 14:22:59,585 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 14:22:59,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 14:22:59,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 14:22:59,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 14:22:59,586 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 14:22:59,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 14:22:59,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 14:22:59,587 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 14:22:59,587 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 14:22:59,587 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 14:22:59,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 14:22:59,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 14:22:59,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 14:22:59,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 14:22:59,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 14:22:59,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 14:22:59,590 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 14:22:59,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 14:22:59,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 14:22:59,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 14:22:59,911 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 14:22:59,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 14:22:59,917 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 14:22:59,917 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 14:22:59,918 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 14:22:59,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481c170a/c0c408464e7f4da5b4414fb26572a1c4/FLAGbc3193272 [2019-12-27 14:23:00,563 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 14:23:00,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2019-12-27 14:23:00,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481c170a/c0c408464e7f4da5b4414fb26572a1c4/FLAGbc3193272 [2019-12-27 14:23:00,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e481c170a/c0c408464e7f4da5b4414fb26572a1c4 [2019-12-27 14:23:00,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 14:23:00,851 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 14:23:00,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 14:23:00,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 14:23:00,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 14:23:00,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:00" (1/1) ... [2019-12-27 14:23:00,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:00, skipping insertion in model container [2019-12-27 14:23:00,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:23:00" (1/1) ... [2019-12-27 14:23:00,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 14:23:00,926 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 14:23:01,444 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:23:01,466 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 14:23:01,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 14:23:01,605 INFO L208 MainTranslator]: Completed translation [2019-12-27 14:23:01,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01 WrapperNode [2019-12-27 14:23:01,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 14:23:01,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 14:23:01,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 14:23:01,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 14:23:01,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 14:23:01,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 14:23:01,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 14:23:01,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 14:23:01,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (1/1) ... [2019-12-27 14:23:01,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 14:23:01,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 14:23:01,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 14:23:01,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 14:23:01,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (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 [2019-12-27 14:23:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 14:23:01,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 14:23:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 14:23:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 14:23:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 14:23:01,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 14:23:01,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 14:23:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 14:23:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 14:23:01,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 14:23:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 14:23:01,795 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 14:23:02,536 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 14:23:02,537 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 14:23:02,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:02 BoogieIcfgContainer [2019-12-27 14:23:02,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 14:23:02,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 14:23:02,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 14:23:02,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 14:23:02,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:23:00" (1/3) ... [2019-12-27 14:23:02,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a64ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:02, skipping insertion in model container [2019-12-27 14:23:02,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:23:01" (2/3) ... [2019-12-27 14:23:02,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a64ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:23:02, skipping insertion in model container [2019-12-27 14:23:02,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:23:02" (3/3) ... [2019-12-27 14:23:02,548 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2019-12-27 14:23:02,559 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 14:23:02,560 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 14:23:02,568 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 14:23:02,569 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 14:23:02,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,606 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,613 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,614 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,615 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,630 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,631 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,645 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 14:23:02,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 14:23:02,688 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 14:23:02,689 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 14:23:02,689 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 14:23:02,689 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 14:23:02,689 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 14:23:02,689 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 14:23:02,690 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 14:23:02,690 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 14:23:02,711 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-27 14:23:04,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-12-27 14:23:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-12-27 14:23:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 14:23:04,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:04,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:04,061 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash -641553760, now seen corresponding path program 1 times [2019-12-27 14:23:04,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:04,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731148736] [2019-12-27 14:23:04,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:04,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731148736] [2019-12-27 14:23:04,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:04,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777401740] [2019-12-27 14:23:04,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:04,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:04,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:04,365 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-12-27 14:23:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:05,021 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-12-27 14:23:05,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:23:05,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-27 14:23:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:05,283 INFO L225 Difference]: With dead ends: 23453 [2019-12-27 14:23:05,284 INFO L226 Difference]: Without dead ends: 21277 [2019-12-27 14:23:05,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-12-27 14:23:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-12-27 14:23:07,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-12-27 14:23:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-12-27 14:23:07,257 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-12-27 14:23:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:07,258 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-12-27 14:23:07,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:07,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-12-27 14:23:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-27 14:23:07,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:07,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:07,266 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:07,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:07,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2036668926, now seen corresponding path program 1 times [2019-12-27 14:23:07,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:07,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044301443] [2019-12-27 14:23:07,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:07,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044301443] [2019-12-27 14:23:07,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:07,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:07,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533938448] [2019-12-27 14:23:07,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:07,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:07,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:07,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:07,445 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-12-27 14:23:08,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:08,542 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-12-27 14:23:08,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:08,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-27 14:23:08,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:08,703 INFO L225 Difference]: With dead ends: 34711 [2019-12-27 14:23:08,704 INFO L226 Difference]: Without dead ends: 34567 [2019-12-27 14:23:08,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:08,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-12-27 14:23:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-12-27 14:23:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-12-27 14:23:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-12-27 14:23:11,068 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-12-27 14:23:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:11,073 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-12-27 14:23:11,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:11,073 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-12-27 14:23:11,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 14:23:11,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:11,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:11,079 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:11,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:11,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1802978339, now seen corresponding path program 1 times [2019-12-27 14:23:11,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:11,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455280721] [2019-12-27 14:23:11,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:11,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455280721] [2019-12-27 14:23:11,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:11,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:11,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960356629] [2019-12-27 14:23:11,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:11,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:11,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:11,215 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-12-27 14:23:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:11,803 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-12-27 14:23:11,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:11,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 14:23:11,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:12,071 INFO L225 Difference]: With dead ends: 40219 [2019-12-27 14:23:12,071 INFO L226 Difference]: Without dead ends: 40059 [2019-12-27 14:23:12,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-12-27 14:23:14,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-12-27 14:23:14,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-12-27 14:23:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-12-27 14:23:14,510 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-12-27 14:23:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:14,510 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-12-27 14:23:14,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-12-27 14:23:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 14:23:14,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:14,755 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:14,755 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:14,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:14,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1187379522, now seen corresponding path program 1 times [2019-12-27 14:23:14,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:14,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200031406] [2019-12-27 14:23:14,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:14,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200031406] [2019-12-27 14:23:14,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:14,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:14,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796282855] [2019-12-27 14:23:14,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:14,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:14,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:14,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:14,873 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-12-27 14:23:15,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:15,837 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-12-27 14:23:15,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:23:15,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 14:23:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:15,980 INFO L225 Difference]: With dead ends: 45668 [2019-12-27 14:23:15,980 INFO L226 Difference]: Without dead ends: 45524 [2019-12-27 14:23:15,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 14:23:16,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-12-27 14:23:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-12-27 14:23:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-12-27 14:23:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-12-27 14:23:18,433 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-12-27 14:23:18,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:18,433 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-12-27 14:23:18,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-12-27 14:23:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 14:23:18,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:18,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:18,469 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:18,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:18,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2042153850, now seen corresponding path program 1 times [2019-12-27 14:23:18,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:18,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379164771] [2019-12-27 14:23:18,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:18,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:18,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379164771] [2019-12-27 14:23:18,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:18,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:18,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966405874] [2019-12-27 14:23:18,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:18,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:18,600 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-12-27 14:23:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:19,544 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-12-27 14:23:19,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 14:23:19,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-27 14:23:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:19,640 INFO L225 Difference]: With dead ends: 46075 [2019-12-27 14:23:19,640 INFO L226 Difference]: Without dead ends: 45835 [2019-12-27 14:23:19,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:23:19,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-12-27 14:23:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-12-27 14:23:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-12-27 14:23:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-12-27 14:23:22,180 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-12-27 14:23:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:22,181 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-12-27 14:23:22,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-12-27 14:23:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 14:23:22,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:22,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:22,215 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:22,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:22,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1541499923, now seen corresponding path program 1 times [2019-12-27 14:23:22,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:22,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219115347] [2019-12-27 14:23:22,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:22,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:22,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219115347] [2019-12-27 14:23:22,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:22,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:22,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576748577] [2019-12-27 14:23:22,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:22,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:22,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:22,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:22,263 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-12-27 14:23:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:22,528 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-12-27 14:23:22,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:22,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-27 14:23:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:22,630 INFO L225 Difference]: With dead ends: 50262 [2019-12-27 14:23:22,630 INFO L226 Difference]: Without dead ends: 50262 [2019-12-27 14:23:22,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-12-27 14:23:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-12-27 14:23:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-12-27 14:23:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-12-27 14:23:23,763 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-12-27 14:23:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:23,763 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-12-27 14:23:23,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-12-27 14:23:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 14:23:23,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:23,799 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:23,799 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:23,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:23,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1207224336, now seen corresponding path program 1 times [2019-12-27 14:23:23,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:23,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930126517] [2019-12-27 14:23:23,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:23,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930126517] [2019-12-27 14:23:23,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:23,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:23,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078964328] [2019-12-27 14:23:23,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:23,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:23,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:23,901 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-12-27 14:23:25,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:25,449 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-12-27 14:23:25,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:23:25,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 14:23:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:25,569 INFO L225 Difference]: With dead ends: 55890 [2019-12-27 14:23:25,569 INFO L226 Difference]: Without dead ends: 55650 [2019-12-27 14:23:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 14:23:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-12-27 14:23:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-12-27 14:23:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-12-27 14:23:29,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-12-27 14:23:29,071 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-12-27 14:23:29,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:29,072 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-12-27 14:23:29,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:29,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-12-27 14:23:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 14:23:29,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:29,110 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:29,111 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2064437065, now seen corresponding path program 1 times [2019-12-27 14:23:29,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:29,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84896708] [2019-12-27 14:23:29,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:29,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84896708] [2019-12-27 14:23:29,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:29,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:29,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712702962] [2019-12-27 14:23:29,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:29,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:29,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:29,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:29,203 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 6 states. [2019-12-27 14:23:29,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:29,949 INFO L93 Difference]: Finished difference Result 62662 states and 223894 transitions. [2019-12-27 14:23:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:23:29,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 14:23:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:30,080 INFO L225 Difference]: With dead ends: 62662 [2019-12-27 14:23:30,081 INFO L226 Difference]: Without dead ends: 62518 [2019-12-27 14:23:30,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:23:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62518 states. [2019-12-27 14:23:31,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62518 to 48801. [2019-12-27 14:23:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-27 14:23:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 177924 transitions. [2019-12-27 14:23:31,270 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 177924 transitions. Word has length 65 [2019-12-27 14:23:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:31,271 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 177924 transitions. [2019-12-27 14:23:31,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 177924 transitions. [2019-12-27 14:23:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 14:23:31,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:31,305 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:31,305 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -978936533, now seen corresponding path program 2 times [2019-12-27 14:23:31,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:31,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882489633] [2019-12-27 14:23:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:31,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882489633] [2019-12-27 14:23:31,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:31,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:31,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347630786] [2019-12-27 14:23:31,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:31,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:31,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:31,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:31,419 INFO L87 Difference]: Start difference. First operand 48801 states and 177924 transitions. Second operand 7 states. [2019-12-27 14:23:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:32,565 INFO L93 Difference]: Finished difference Result 58785 states and 210668 transitions. [2019-12-27 14:23:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 14:23:32,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 14:23:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:32,687 INFO L225 Difference]: With dead ends: 58785 [2019-12-27 14:23:32,688 INFO L226 Difference]: Without dead ends: 58585 [2019-12-27 14:23:32,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 14:23:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58585 states. [2019-12-27 14:23:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58585 to 45998. [2019-12-27 14:23:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45998 states. [2019-12-27 14:23:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45998 states to 45998 states and 167829 transitions. [2019-12-27 14:23:33,982 INFO L78 Accepts]: Start accepts. Automaton has 45998 states and 167829 transitions. Word has length 65 [2019-12-27 14:23:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:33,983 INFO L462 AbstractCegarLoop]: Abstraction has 45998 states and 167829 transitions. [2019-12-27 14:23:33,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:33,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45998 states and 167829 transitions. [2019-12-27 14:23:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:34,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:34,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:34,022 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:34,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash 379551327, now seen corresponding path program 1 times [2019-12-27 14:23:34,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:34,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735095273] [2019-12-27 14:23:34,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:34,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:34,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735095273] [2019-12-27 14:23:34,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:34,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:34,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537013891] [2019-12-27 14:23:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:34,073 INFO L87 Difference]: Start difference. First operand 45998 states and 167829 transitions. Second operand 3 states. [2019-12-27 14:23:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:34,947 INFO L93 Difference]: Finished difference Result 61492 states and 224163 transitions. [2019-12-27 14:23:34,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:34,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 14:23:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:35,082 INFO L225 Difference]: With dead ends: 61492 [2019-12-27 14:23:35,082 INFO L226 Difference]: Without dead ends: 61492 [2019-12-27 14:23:35,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61492 states. [2019-12-27 14:23:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61492 to 53439. [2019-12-27 14:23:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53439 states. [2019-12-27 14:23:36,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53439 states to 53439 states and 195642 transitions. [2019-12-27 14:23:36,070 INFO L78 Accepts]: Start accepts. Automaton has 53439 states and 195642 transitions. Word has length 67 [2019-12-27 14:23:36,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:36,070 INFO L462 AbstractCegarLoop]: Abstraction has 53439 states and 195642 transitions. [2019-12-27 14:23:36,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:36,070 INFO L276 IsEmpty]: Start isEmpty. Operand 53439 states and 195642 transitions. [2019-12-27 14:23:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:36,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:36,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:36,127 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:36,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1904207583, now seen corresponding path program 1 times [2019-12-27 14:23:36,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:36,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121189551] [2019-12-27 14:23:36,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:36,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121189551] [2019-12-27 14:23:36,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:36,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:36,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512134192] [2019-12-27 14:23:36,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:36,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:36,265 INFO L87 Difference]: Start difference. First operand 53439 states and 195642 transitions. Second operand 6 states. [2019-12-27 14:23:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:37,302 INFO L93 Difference]: Finished difference Result 65988 states and 238856 transitions. [2019-12-27 14:23:37,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:37,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 14:23:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:37,442 INFO L225 Difference]: With dead ends: 65988 [2019-12-27 14:23:37,443 INFO L226 Difference]: Without dead ends: 65344 [2019-12-27 14:23:37,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65344 states. [2019-12-27 14:23:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65344 to 56048. [2019-12-27 14:23:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56048 states. [2019-12-27 14:23:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56048 states to 56048 states and 204359 transitions. [2019-12-27 14:23:39,277 INFO L78 Accepts]: Start accepts. Automaton has 56048 states and 204359 transitions. Word has length 67 [2019-12-27 14:23:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:39,278 INFO L462 AbstractCegarLoop]: Abstraction has 56048 states and 204359 transitions. [2019-12-27 14:23:39,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:39,278 INFO L276 IsEmpty]: Start isEmpty. Operand 56048 states and 204359 transitions. [2019-12-27 14:23:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:39,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:39,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:39,322 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:39,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1429145696, now seen corresponding path program 1 times [2019-12-27 14:23:39,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:39,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885766276] [2019-12-27 14:23:39,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:39,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885766276] [2019-12-27 14:23:39,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:39,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:39,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845951910] [2019-12-27 14:23:39,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:39,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:39,434 INFO L87 Difference]: Start difference. First operand 56048 states and 204359 transitions. Second operand 7 states. [2019-12-27 14:23:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:40,558 INFO L93 Difference]: Finished difference Result 83036 states and 292787 transitions. [2019-12-27 14:23:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:23:40,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 14:23:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:40,735 INFO L225 Difference]: With dead ends: 83036 [2019-12-27 14:23:40,735 INFO L226 Difference]: Without dead ends: 83036 [2019-12-27 14:23:40,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:23:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-12-27 14:23:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 76085. [2019-12-27 14:23:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76085 states. [2019-12-27 14:23:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76085 states to 76085 states and 270654 transitions. [2019-12-27 14:23:42,912 INFO L78 Accepts]: Start accepts. Automaton has 76085 states and 270654 transitions. Word has length 67 [2019-12-27 14:23:42,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:42,913 INFO L462 AbstractCegarLoop]: Abstraction has 76085 states and 270654 transitions. [2019-12-27 14:23:42,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:42,913 INFO L276 IsEmpty]: Start isEmpty. Operand 76085 states and 270654 transitions. [2019-12-27 14:23:42,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 14:23:42,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:42,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:42,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash -184381215, now seen corresponding path program 1 times [2019-12-27 14:23:42,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:42,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653883973] [2019-12-27 14:23:42,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:43,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653883973] [2019-12-27 14:23:43,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:43,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:43,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705751733] [2019-12-27 14:23:43,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:43,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:43,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:43,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:43,050 INFO L87 Difference]: Start difference. First operand 76085 states and 270654 transitions. Second operand 4 states. [2019-12-27 14:23:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:43,149 INFO L93 Difference]: Finished difference Result 17230 states and 54532 transitions. [2019-12-27 14:23:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:43,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 14:23:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:43,192 INFO L225 Difference]: With dead ends: 17230 [2019-12-27 14:23:43,192 INFO L226 Difference]: Without dead ends: 16752 [2019-12-27 14:23:43,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-12-27 14:23:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 16740. [2019-12-27 14:23:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16740 states. [2019-12-27 14:23:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16740 states to 16740 states and 53027 transitions. [2019-12-27 14:23:43,419 INFO L78 Accepts]: Start accepts. Automaton has 16740 states and 53027 transitions. Word has length 67 [2019-12-27 14:23:43,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:43,419 INFO L462 AbstractCegarLoop]: Abstraction has 16740 states and 53027 transitions. [2019-12-27 14:23:43,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 16740 states and 53027 transitions. [2019-12-27 14:23:43,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:23:43,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:43,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:43,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:43,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:43,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1457085175, now seen corresponding path program 1 times [2019-12-27 14:23:43,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:43,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260931966] [2019-12-27 14:23:43,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:43,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260931966] [2019-12-27 14:23:43,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:43,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:43,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090576247] [2019-12-27 14:23:43,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:43,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:43,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:43,527 INFO L87 Difference]: Start difference. First operand 16740 states and 53027 transitions. Second operand 4 states. [2019-12-27 14:23:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:43,826 INFO L93 Difference]: Finished difference Result 22104 states and 69108 transitions. [2019-12-27 14:23:43,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:43,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-27 14:23:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:44,839 INFO L225 Difference]: With dead ends: 22104 [2019-12-27 14:23:44,839 INFO L226 Difference]: Without dead ends: 22104 [2019-12-27 14:23:44,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-27 14:23:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 17616. [2019-12-27 14:23:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17616 states. [2019-12-27 14:23:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17616 states to 17616 states and 55586 transitions. [2019-12-27 14:23:45,083 INFO L78 Accepts]: Start accepts. Automaton has 17616 states and 55586 transitions. Word has length 77 [2019-12-27 14:23:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:45,083 INFO L462 AbstractCegarLoop]: Abstraction has 17616 states and 55586 transitions. [2019-12-27 14:23:45,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 17616 states and 55586 transitions. [2019-12-27 14:23:45,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 14:23:45,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:45,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:45,098 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:45,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1202348630, now seen corresponding path program 1 times [2019-12-27 14:23:45,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:45,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718640158] [2019-12-27 14:23:45,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:45,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718640158] [2019-12-27 14:23:45,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:45,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 14:23:45,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606295422] [2019-12-27 14:23:45,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 14:23:45,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 14:23:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:45,204 INFO L87 Difference]: Start difference. First operand 17616 states and 55586 transitions. Second operand 8 states. [2019-12-27 14:23:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:46,379 INFO L93 Difference]: Finished difference Result 19710 states and 61662 transitions. [2019-12-27 14:23:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 14:23:46,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-27 14:23:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:46,412 INFO L225 Difference]: With dead ends: 19710 [2019-12-27 14:23:46,413 INFO L226 Difference]: Without dead ends: 19662 [2019-12-27 14:23:46,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 14:23:46,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-27 14:23:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 15534. [2019-12-27 14:23:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-12-27 14:23:46,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 49320 transitions. [2019-12-27 14:23:46,650 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 49320 transitions. Word has length 77 [2019-12-27 14:23:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:46,651 INFO L462 AbstractCegarLoop]: Abstraction has 15534 states and 49320 transitions. [2019-12-27 14:23:46,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 14:23:46,651 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 49320 transitions. [2019-12-27 14:23:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 14:23:46,664 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:46,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:46,664 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:46,664 INFO L82 PathProgramCache]: Analyzing trace with hash -155414719, now seen corresponding path program 1 times [2019-12-27 14:23:46,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:46,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854384254] [2019-12-27 14:23:46,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:46,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854384254] [2019-12-27 14:23:46,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:46,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:46,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854827411] [2019-12-27 14:23:46,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:46,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:46,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:46,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:46,709 INFO L87 Difference]: Start difference. First operand 15534 states and 49320 transitions. Second operand 3 states. [2019-12-27 14:23:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:46,996 INFO L93 Difference]: Finished difference Result 16798 states and 53033 transitions. [2019-12-27 14:23:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:46,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-27 14:23:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:47,033 INFO L225 Difference]: With dead ends: 16798 [2019-12-27 14:23:47,033 INFO L226 Difference]: Without dead ends: 16798 [2019-12-27 14:23:47,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2019-12-27 14:23:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16150. [2019-12-27 14:23:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-27 14:23:47,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 51134 transitions. [2019-12-27 14:23:47,318 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 51134 transitions. Word has length 78 [2019-12-27 14:23:47,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:47,318 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 51134 transitions. [2019-12-27 14:23:47,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 51134 transitions. [2019-12-27 14:23:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:23:47,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:47,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:47,332 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:47,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:47,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2033602545, now seen corresponding path program 1 times [2019-12-27 14:23:47,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:47,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287537825] [2019-12-27 14:23:47,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:47,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:47,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287537825] [2019-12-27 14:23:47,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:47,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:47,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939402107] [2019-12-27 14:23:47,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:47,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:47,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:47,400 INFO L87 Difference]: Start difference. First operand 16150 states and 51134 transitions. Second operand 4 states. [2019-12-27 14:23:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:47,714 INFO L93 Difference]: Finished difference Result 19318 states and 60264 transitions. [2019-12-27 14:23:47,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 14:23:47,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-27 14:23:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:47,747 INFO L225 Difference]: With dead ends: 19318 [2019-12-27 14:23:47,747 INFO L226 Difference]: Without dead ends: 19318 [2019-12-27 14:23:47,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19318 states. [2019-12-27 14:23:48,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19318 to 18295. [2019-12-27 14:23:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18295 states. [2019-12-27 14:23:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 57380 transitions. [2019-12-27 14:23:48,117 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 57380 transitions. Word has length 79 [2019-12-27 14:23:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:48,117 INFO L462 AbstractCegarLoop]: Abstraction has 18295 states and 57380 transitions. [2019-12-27 14:23:48,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 57380 transitions. [2019-12-27 14:23:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 14:23:48,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:48,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:48,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:48,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash 332862066, now seen corresponding path program 1 times [2019-12-27 14:23:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654050699] [2019-12-27 14:23:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:48,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654050699] [2019-12-27 14:23:48,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:48,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:48,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819337925] [2019-12-27 14:23:48,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:48,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:48,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:48,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:48,197 INFO L87 Difference]: Start difference. First operand 18295 states and 57380 transitions. Second operand 3 states. [2019-12-27 14:23:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:48,465 INFO L93 Difference]: Finished difference Result 19638 states and 61303 transitions. [2019-12-27 14:23:48,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:48,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-27 14:23:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:48,494 INFO L225 Difference]: With dead ends: 19638 [2019-12-27 14:23:48,494 INFO L226 Difference]: Without dead ends: 19638 [2019-12-27 14:23:48,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:48,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19638 states. [2019-12-27 14:23:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19638 to 18975. [2019-12-27 14:23:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18975 states. [2019-12-27 14:23:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18975 states to 18975 states and 59360 transitions. [2019-12-27 14:23:48,757 INFO L78 Accepts]: Start accepts. Automaton has 18975 states and 59360 transitions. Word has length 79 [2019-12-27 14:23:48,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:48,757 INFO L462 AbstractCegarLoop]: Abstraction has 18975 states and 59360 transitions. [2019-12-27 14:23:48,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 18975 states and 59360 transitions. [2019-12-27 14:23:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:48,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:48,774 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:48,774 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1580742388, now seen corresponding path program 1 times [2019-12-27 14:23:48,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:48,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835965296] [2019-12-27 14:23:48,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:48,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:48,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835965296] [2019-12-27 14:23:48,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:48,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 14:23:48,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390082213] [2019-12-27 14:23:48,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 14:23:48,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 14:23:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:48,882 INFO L87 Difference]: Start difference. First operand 18975 states and 59360 transitions. Second operand 8 states. [2019-12-27 14:23:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:51,994 INFO L93 Difference]: Finished difference Result 52657 states and 160091 transitions. [2019-12-27 14:23:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 14:23:51,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-27 14:23:51,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:52,135 INFO L225 Difference]: With dead ends: 52657 [2019-12-27 14:23:52,135 INFO L226 Difference]: Without dead ends: 52240 [2019-12-27 14:23:52,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 14:23:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52240 states. [2019-12-27 14:23:53,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52240 to 28682. [2019-12-27 14:23:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-12-27 14:23:53,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 89258 transitions. [2019-12-27 14:23:53,198 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 89258 transitions. Word has length 80 [2019-12-27 14:23:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:53,198 INFO L462 AbstractCegarLoop]: Abstraction has 28682 states and 89258 transitions. [2019-12-27 14:23:53,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 14:23:53,198 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 89258 transitions. [2019-12-27 14:23:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:53,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:53,225 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:53,225 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -507846410, now seen corresponding path program 1 times [2019-12-27 14:23:53,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:53,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950713467] [2019-12-27 14:23:53,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:53,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950713467] [2019-12-27 14:23:53,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:53,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:53,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548233001] [2019-12-27 14:23:53,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:53,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:53,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:53,313 INFO L87 Difference]: Start difference. First operand 28682 states and 89258 transitions. Second operand 6 states. [2019-12-27 14:23:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:53,867 INFO L93 Difference]: Finished difference Result 30407 states and 93751 transitions. [2019-12-27 14:23:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:53,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-27 14:23:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:53,911 INFO L225 Difference]: With dead ends: 30407 [2019-12-27 14:23:53,911 INFO L226 Difference]: Without dead ends: 30407 [2019-12-27 14:23:53,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:53,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30407 states. [2019-12-27 14:23:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30407 to 29149. [2019-12-27 14:23:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29149 states. [2019-12-27 14:23:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29149 states to 29149 states and 90160 transitions. [2019-12-27 14:23:54,301 INFO L78 Accepts]: Start accepts. Automaton has 29149 states and 90160 transitions. Word has length 80 [2019-12-27 14:23:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:54,301 INFO L462 AbstractCegarLoop]: Abstraction has 29149 states and 90160 transitions. [2019-12-27 14:23:54,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 29149 states and 90160 transitions. [2019-12-27 14:23:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:54,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:54,327 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:54,327 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:54,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1851460599, now seen corresponding path program 1 times [2019-12-27 14:23:54,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:54,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787542376] [2019-12-27 14:23:54,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:54,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787542376] [2019-12-27 14:23:54,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:54,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:54,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547668602] [2019-12-27 14:23:54,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:54,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:54,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:54,443 INFO L87 Difference]: Start difference. First operand 29149 states and 90160 transitions. Second operand 7 states. [2019-12-27 14:23:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:55,073 INFO L93 Difference]: Finished difference Result 30834 states and 94868 transitions. [2019-12-27 14:23:55,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 14:23:55,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-27 14:23:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:55,117 INFO L225 Difference]: With dead ends: 30834 [2019-12-27 14:23:55,117 INFO L226 Difference]: Without dead ends: 30834 [2019-12-27 14:23:55,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:23:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30834 states. [2019-12-27 14:23:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30834 to 29512. [2019-12-27 14:23:55,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29512 states. [2019-12-27 14:23:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 91025 transitions. [2019-12-27 14:23:55,513 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 91025 transitions. Word has length 80 [2019-12-27 14:23:55,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:55,513 INFO L462 AbstractCegarLoop]: Abstraction has 29512 states and 91025 transitions. [2019-12-27 14:23:55,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 91025 transitions. [2019-12-27 14:23:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:55,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:55,542 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:55,542 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:55,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2113740936, now seen corresponding path program 1 times [2019-12-27 14:23:55,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:55,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676808843] [2019-12-27 14:23:55,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:55,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676808843] [2019-12-27 14:23:55,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:55,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 14:23:55,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225061853] [2019-12-27 14:23:55,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 14:23:55,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 14:23:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:55,587 INFO L87 Difference]: Start difference. First operand 29512 states and 91025 transitions. Second operand 3 states. [2019-12-27 14:23:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:55,849 INFO L93 Difference]: Finished difference Result 22465 states and 68730 transitions. [2019-12-27 14:23:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 14:23:55,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-27 14:23:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:55,893 INFO L225 Difference]: With dead ends: 22465 [2019-12-27 14:23:55,893 INFO L226 Difference]: Without dead ends: 22465 [2019-12-27 14:23:55,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 14:23:55,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22465 states. [2019-12-27 14:23:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22465 to 21651. [2019-12-27 14:23:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2019-12-27 14:23:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 66414 transitions. [2019-12-27 14:23:56,186 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 66414 transitions. Word has length 80 [2019-12-27 14:23:56,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:56,186 INFO L462 AbstractCegarLoop]: Abstraction has 21651 states and 66414 transitions. [2019-12-27 14:23:56,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 14:23:56,187 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 66414 transitions. [2019-12-27 14:23:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:56,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:56,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:56,208 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:56,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1936604585, now seen corresponding path program 1 times [2019-12-27 14:23:56,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:56,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214067541] [2019-12-27 14:23:56,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:56,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:56,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214067541] [2019-12-27 14:23:56,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:56,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547137565] [2019-12-27 14:23:56,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:56,308 INFO L87 Difference]: Start difference. First operand 21651 states and 66414 transitions. Second operand 7 states. [2019-12-27 14:23:57,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:57,023 INFO L93 Difference]: Finished difference Result 39045 states and 119676 transitions. [2019-12-27 14:23:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:23:57,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-27 14:23:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:57,082 INFO L225 Difference]: With dead ends: 39045 [2019-12-27 14:23:57,082 INFO L226 Difference]: Without dead ends: 39045 [2019-12-27 14:23:57,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 14:23:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39045 states. [2019-12-27 14:23:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39045 to 23068. [2019-12-27 14:23:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2019-12-27 14:23:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 70714 transitions. [2019-12-27 14:23:57,499 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 70714 transitions. Word has length 80 [2019-12-27 14:23:57,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:57,499 INFO L462 AbstractCegarLoop]: Abstraction has 23068 states and 70714 transitions. [2019-12-27 14:23:57,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:57,500 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 70714 transitions. [2019-12-27 14:23:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 14:23:57,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:57,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:57,520 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:57,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash -632881814, now seen corresponding path program 1 times [2019-12-27 14:23:57,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:57,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198700018] [2019-12-27 14:23:57,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:57,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198700018] [2019-12-27 14:23:57,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:57,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:57,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880778770] [2019-12-27 14:23:57,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:57,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:57,602 INFO L87 Difference]: Start difference. First operand 23068 states and 70714 transitions. Second operand 5 states. [2019-12-27 14:23:57,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:57,653 INFO L93 Difference]: Finished difference Result 3274 states and 8033 transitions. [2019-12-27 14:23:57,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:23:57,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-27 14:23:57,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:57,658 INFO L225 Difference]: With dead ends: 3274 [2019-12-27 14:23:57,659 INFO L226 Difference]: Without dead ends: 2815 [2019-12-27 14:23:57,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-27 14:23:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2541. [2019-12-27 14:23:57,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-12-27 14:23:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6203 transitions. [2019-12-27 14:23:57,701 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6203 transitions. Word has length 80 [2019-12-27 14:23:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:57,702 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6203 transitions. [2019-12-27 14:23:57,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6203 transitions. [2019-12-27 14:23:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:57,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:57,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:57,705 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:57,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:57,706 INFO L82 PathProgramCache]: Analyzing trace with hash 211784789, now seen corresponding path program 1 times [2019-12-27 14:23:57,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:57,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570274732] [2019-12-27 14:23:57,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:57,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570274732] [2019-12-27 14:23:57,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:57,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:57,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113432089] [2019-12-27 14:23:57,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:57,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:57,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:57,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:57,776 INFO L87 Difference]: Start difference. First operand 2541 states and 6203 transitions. Second operand 6 states. [2019-12-27 14:23:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:58,075 INFO L93 Difference]: Finished difference Result 3131 states and 7603 transitions. [2019-12-27 14:23:58,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:58,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:23:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:58,080 INFO L225 Difference]: With dead ends: 3131 [2019-12-27 14:23:58,080 INFO L226 Difference]: Without dead ends: 3113 [2019-12-27 14:23:58,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2019-12-27 14:23:58,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2790. [2019-12-27 14:23:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-12-27 14:23:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 6803 transitions. [2019-12-27 14:23:58,108 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 6803 transitions. Word has length 92 [2019-12-27 14:23:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:58,109 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 6803 transitions. [2019-12-27 14:23:58,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 6803 transitions. [2019-12-27 14:23:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:58,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:58,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:58,111 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:58,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:58,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1173398806, now seen corresponding path program 1 times [2019-12-27 14:23:58,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:58,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912743485] [2019-12-27 14:23:58,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:58,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912743485] [2019-12-27 14:23:58,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:58,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:23:58,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297040227] [2019-12-27 14:23:58,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:23:58,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:58,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:23:58,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:23:58,210 INFO L87 Difference]: Start difference. First operand 2790 states and 6803 transitions. Second operand 6 states. [2019-12-27 14:23:58,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:58,532 INFO L93 Difference]: Finished difference Result 2990 states and 7156 transitions. [2019-12-27 14:23:58,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:58,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:23:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:58,538 INFO L225 Difference]: With dead ends: 2990 [2019-12-27 14:23:58,538 INFO L226 Difference]: Without dead ends: 2938 [2019-12-27 14:23:58,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-12-27 14:23:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2881. [2019-12-27 14:23:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-12-27 14:23:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 6969 transitions. [2019-12-27 14:23:58,600 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 6969 transitions. Word has length 92 [2019-12-27 14:23:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:58,601 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 6969 transitions. [2019-12-27 14:23:58,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:23:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 6969 transitions. [2019-12-27 14:23:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:58,605 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:58,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:58,606 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 738198895, now seen corresponding path program 1 times [2019-12-27 14:23:58,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:58,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688207680] [2019-12-27 14:23:58,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:58,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688207680] [2019-12-27 14:23:58,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:58,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 14:23:58,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646512199] [2019-12-27 14:23:58,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 14:23:58,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 14:23:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 14:23:58,702 INFO L87 Difference]: Start difference. First operand 2881 states and 6969 transitions. Second operand 4 states. [2019-12-27 14:23:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:58,751 INFO L93 Difference]: Finished difference Result 2703 states and 6512 transitions. [2019-12-27 14:23:58,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:23:58,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-27 14:23:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:58,757 INFO L225 Difference]: With dead ends: 2703 [2019-12-27 14:23:58,757 INFO L226 Difference]: Without dead ends: 2703 [2019-12-27 14:23:58,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-27 14:23:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2624. [2019-12-27 14:23:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-12-27 14:23:58,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 6310 transitions. [2019-12-27 14:23:58,814 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 6310 transitions. Word has length 92 [2019-12-27 14:23:58,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:58,814 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 6310 transitions. [2019-12-27 14:23:58,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 14:23:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 6310 transitions. [2019-12-27 14:23:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:58,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:58,819 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:58,820 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:58,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1220152845, now seen corresponding path program 1 times [2019-12-27 14:23:58,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:58,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934816658] [2019-12-27 14:23:58,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:58,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934816658] [2019-12-27 14:23:58,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:58,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:23:58,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020337350] [2019-12-27 14:23:58,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:23:58,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:23:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:23:58,929 INFO L87 Difference]: Start difference. First operand 2624 states and 6310 transitions. Second operand 5 states. [2019-12-27 14:23:59,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:59,159 INFO L93 Difference]: Finished difference Result 3041 states and 7197 transitions. [2019-12-27 14:23:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 14:23:59,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-27 14:23:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:59,163 INFO L225 Difference]: With dead ends: 3041 [2019-12-27 14:23:59,163 INFO L226 Difference]: Without dead ends: 3015 [2019-12-27 14:23:59,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:23:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2019-12-27 14:23:59,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2695. [2019-12-27 14:23:59,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-27 14:23:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 6452 transitions. [2019-12-27 14:23:59,204 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 6452 transitions. Word has length 92 [2019-12-27 14:23:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:59,204 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 6452 transitions. [2019-12-27 14:23:59,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:23:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 6452 transitions. [2019-12-27 14:23:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:59,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:59,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:59,208 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:59,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:59,209 INFO L82 PathProgramCache]: Analyzing trace with hash -947481435, now seen corresponding path program 2 times [2019-12-27 14:23:59,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:59,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922909511] [2019-12-27 14:23:59,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:59,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922909511] [2019-12-27 14:23:59,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:59,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:59,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69801458] [2019-12-27 14:23:59,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:59,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:59,327 INFO L87 Difference]: Start difference. First operand 2695 states and 6452 transitions. Second operand 7 states. [2019-12-27 14:23:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:23:59,745 INFO L93 Difference]: Finished difference Result 3871 states and 9108 transitions. [2019-12-27 14:23:59,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 14:23:59,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:23:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:23:59,754 INFO L225 Difference]: With dead ends: 3871 [2019-12-27 14:23:59,754 INFO L226 Difference]: Without dead ends: 3853 [2019-12-27 14:23:59,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 14:23:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-12-27 14:23:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3378. [2019-12-27 14:23:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3378 states. [2019-12-27 14:23:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 7977 transitions. [2019-12-27 14:23:59,791 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 7977 transitions. Word has length 92 [2019-12-27 14:23:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:23:59,792 INFO L462 AbstractCegarLoop]: Abstraction has 3378 states and 7977 transitions. [2019-12-27 14:23:59,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:23:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 7977 transitions. [2019-12-27 14:23:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:23:59,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:23:59,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:23:59,795 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:23:59,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:23:59,796 INFO L82 PathProgramCache]: Analyzing trace with hash 14132582, now seen corresponding path program 1 times [2019-12-27 14:23:59,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:23:59,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392269056] [2019-12-27 14:23:59,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:23:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:23:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:23:59,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392269056] [2019-12-27 14:23:59,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:23:59,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 14:23:59,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67975955] [2019-12-27 14:23:59,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 14:23:59,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:23:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 14:23:59,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:23:59,877 INFO L87 Difference]: Start difference. First operand 3378 states and 7977 transitions. Second operand 7 states. [2019-12-27 14:24:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:00,235 INFO L93 Difference]: Finished difference Result 4287 states and 10155 transitions. [2019-12-27 14:24:00,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:24:00,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-27 14:24:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:00,241 INFO L225 Difference]: With dead ends: 4287 [2019-12-27 14:24:00,241 INFO L226 Difference]: Without dead ends: 4287 [2019-12-27 14:24:00,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-27 14:24:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-12-27 14:24:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3600. [2019-12-27 14:24:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-27 14:24:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 8531 transitions. [2019-12-27 14:24:00,278 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 8531 transitions. Word has length 92 [2019-12-27 14:24:00,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:00,279 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 8531 transitions. [2019-12-27 14:24:00,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 14:24:00,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 8531 transitions. [2019-12-27 14:24:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:00,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:00,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:00,282 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:00,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:00,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1258897063, now seen corresponding path program 1 times [2019-12-27 14:24:00,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:00,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337840460] [2019-12-27 14:24:00,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:00,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337840460] [2019-12-27 14:24:00,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:00,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:00,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235373533] [2019-12-27 14:24:00,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:00,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:00,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:00,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:00,373 INFO L87 Difference]: Start difference. First operand 3600 states and 8531 transitions. Second operand 6 states. [2019-12-27 14:24:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:00,647 INFO L93 Difference]: Finished difference Result 3968 states and 9363 transitions. [2019-12-27 14:24:00,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 14:24:00,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:24:00,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:00,653 INFO L225 Difference]: With dead ends: 3968 [2019-12-27 14:24:00,653 INFO L226 Difference]: Without dead ends: 3968 [2019-12-27 14:24:00,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-12-27 14:24:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3572. [2019-12-27 14:24:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-12-27 14:24:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 8475 transitions. [2019-12-27 14:24:00,719 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 8475 transitions. Word has length 92 [2019-12-27 14:24:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:00,720 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 8475 transitions. [2019-12-27 14:24:00,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 8475 transitions. [2019-12-27 14:24:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:00,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:00,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:00,727 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1311094677, now seen corresponding path program 1 times [2019-12-27 14:24:00,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:00,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416212140] [2019-12-27 14:24:00,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:00,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416212140] [2019-12-27 14:24:00,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:00,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:00,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103596078] [2019-12-27 14:24:00,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:00,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:00,877 INFO L87 Difference]: Start difference. First operand 3572 states and 8475 transitions. Second operand 6 states. [2019-12-27 14:24:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:01,167 INFO L93 Difference]: Finished difference Result 4056 states and 9312 transitions. [2019-12-27 14:24:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 14:24:01,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:24:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:01,184 INFO L225 Difference]: With dead ends: 4056 [2019-12-27 14:24:01,184 INFO L226 Difference]: Without dead ends: 4056 [2019-12-27 14:24:01,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 14:24:01,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-27 14:24:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3770. [2019-12-27 14:24:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2019-12-27 14:24:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 8757 transitions. [2019-12-27 14:24:01,260 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 8757 transitions. Word has length 92 [2019-12-27 14:24:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:01,261 INFO L462 AbstractCegarLoop]: Abstraction has 3770 states and 8757 transitions. [2019-12-27 14:24:01,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 8757 transitions. [2019-12-27 14:24:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:01,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:01,268 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:01,268 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1187021430, now seen corresponding path program 1 times [2019-12-27 14:24:01,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:01,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343210452] [2019-12-27 14:24:01,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:01,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343210452] [2019-12-27 14:24:01,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:01,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 14:24:01,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379515923] [2019-12-27 14:24:01,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 14:24:01,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:01,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 14:24:01,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:01,436 INFO L87 Difference]: Start difference. First operand 3770 states and 8757 transitions. Second operand 8 states. [2019-12-27 14:24:01,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:01,985 INFO L93 Difference]: Finished difference Result 4626 states and 10717 transitions. [2019-12-27 14:24:01,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 14:24:01,986 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-12-27 14:24:01,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:01,992 INFO L225 Difference]: With dead ends: 4626 [2019-12-27 14:24:01,992 INFO L226 Difference]: Without dead ends: 4608 [2019-12-27 14:24:01,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 14:24:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2019-12-27 14:24:02,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3251. [2019-12-27 14:24:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-12-27 14:24:02,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7643 transitions. [2019-12-27 14:24:02,068 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7643 transitions. Word has length 92 [2019-12-27 14:24:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,069 INFO L462 AbstractCegarLoop]: Abstraction has 3251 states and 7643 transitions. [2019-12-27 14:24:02,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 14:24:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7643 transitions. [2019-12-27 14:24:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:02,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:02,074 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1019357068, now seen corresponding path program 1 times [2019-12-27 14:24:02,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578501552] [2019-12-27 14:24:02,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578501552] [2019-12-27 14:24:02,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:02,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862387963] [2019-12-27 14:24:02,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:02,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:02,216 INFO L87 Difference]: Start difference. First operand 3251 states and 7643 transitions. Second operand 5 states. [2019-12-27 14:24:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,261 INFO L93 Difference]: Finished difference Result 4760 states and 11424 transitions. [2019-12-27 14:24:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 14:24:02,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-27 14:24:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,270 INFO L225 Difference]: With dead ends: 4760 [2019-12-27 14:24:02,271 INFO L226 Difference]: Without dead ends: 4760 [2019-12-27 14:24:02,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-27 14:24:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 2893. [2019-12-27 14:24:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-27 14:24:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6764 transitions. [2019-12-27 14:24:02,327 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6764 transitions. Word has length 92 [2019-12-27 14:24:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,327 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6764 transitions. [2019-12-27 14:24:02,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6764 transitions. [2019-12-27 14:24:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-27 14:24:02,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,331 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:02,331 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1500073484, now seen corresponding path program 1 times [2019-12-27 14:24:02,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658297857] [2019-12-27 14:24:02,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658297857] [2019-12-27 14:24:02,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 14:24:02,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742664386] [2019-12-27 14:24:02,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 14:24:02,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 14:24:02,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 14:24:02,440 INFO L87 Difference]: Start difference. First operand 2893 states and 6764 transitions. Second operand 6 states. [2019-12-27 14:24:02,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,613 INFO L93 Difference]: Finished difference Result 2650 states and 6062 transitions. [2019-12-27 14:24:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:02,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-27 14:24:02,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,617 INFO L225 Difference]: With dead ends: 2650 [2019-12-27 14:24:02,618 INFO L226 Difference]: Without dead ends: 2650 [2019-12-27 14:24:02,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 14:24:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-12-27 14:24:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2018. [2019-12-27 14:24:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-27 14:24:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4736 transitions. [2019-12-27 14:24:02,652 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4736 transitions. Word has length 92 [2019-12-27 14:24:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,653 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 4736 transitions. [2019-12-27 14:24:02,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 14:24:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4736 transitions. [2019-12-27 14:24:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:02,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:02,656 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash -572704409, now seen corresponding path program 1 times [2019-12-27 14:24:02,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742662911] [2019-12-27 14:24:02,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:02,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742662911] [2019-12-27 14:24:02,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:02,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 14:24:02,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890677993] [2019-12-27 14:24:02,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 14:24:02,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:02,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 14:24:02,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 14:24:02,740 INFO L87 Difference]: Start difference. First operand 2018 states and 4736 transitions. Second operand 5 states. [2019-12-27 14:24:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:02,930 INFO L93 Difference]: Finished difference Result 2270 states and 5315 transitions. [2019-12-27 14:24:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 14:24:02,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 14:24:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:02,933 INFO L225 Difference]: With dead ends: 2270 [2019-12-27 14:24:02,933 INFO L226 Difference]: Without dead ends: 2252 [2019-12-27 14:24:02,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 14:24:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-12-27 14:24:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2045. [2019-12-27 14:24:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-27 14:24:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4790 transitions. [2019-12-27 14:24:02,965 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4790 transitions. Word has length 94 [2019-12-27 14:24:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:02,966 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4790 transitions. [2019-12-27 14:24:02,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 14:24:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4790 transitions. [2019-12-27 14:24:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:02,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:02,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:02,969 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 672060072, now seen corresponding path program 1 times [2019-12-27 14:24:02,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:02,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399926497] [2019-12-27 14:24:02,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 14:24:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 14:24:03,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399926497] [2019-12-27 14:24:03,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 14:24:03,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 14:24:03,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612706709] [2019-12-27 14:24:03,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 14:24:03,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 14:24:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 14:24:03,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-27 14:24:03,137 INFO L87 Difference]: Start difference. First operand 2045 states and 4790 transitions. Second operand 12 states. [2019-12-27 14:24:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 14:24:03,395 INFO L93 Difference]: Finished difference Result 3214 states and 7655 transitions. [2019-12-27 14:24:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 14:24:03,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-12-27 14:24:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 14:24:03,398 INFO L225 Difference]: With dead ends: 3214 [2019-12-27 14:24:03,399 INFO L226 Difference]: Without dead ends: 2575 [2019-12-27 14:24:03,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-27 14:24:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-27 14:24:03,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2463. [2019-12-27 14:24:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-27 14:24:03,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5707 transitions. [2019-12-27 14:24:03,422 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5707 transitions. Word has length 94 [2019-12-27 14:24:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 14:24:03,422 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5707 transitions. [2019-12-27 14:24:03,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 14:24:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5707 transitions. [2019-12-27 14:24:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 14:24:03,424 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 14:24:03,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 14:24:03,425 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 14:24:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 14:24:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 718924530, now seen corresponding path program 2 times [2019-12-27 14:24:03,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 14:24:03,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890592252] [2019-12-27 14:24:03,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 14:24:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:24:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 14:24:03,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 14:24:03,509 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 14:24:03,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:24:03 BasicIcfg [2019-12-27 14:24:03,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 14:24:03,684 INFO L168 Benchmark]: Toolchain (without parser) took 62833.12 ms. Allocated memory was 138.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,685 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.14 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.13 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,686 INFO L168 Benchmark]: Boogie Preprocessor took 38.50 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,686 INFO L168 Benchmark]: RCFGBuilder took 820.61 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,687 INFO L168 Benchmark]: TraceAbstraction took 61142.10 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 14:24:03,689 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.14 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 101.8 MB in the beginning and 156.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.13 ms. Allocated memory is still 201.3 MB. Free memory was 156.1 MB in the beginning and 152.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.50 ms. Allocated memory is still 201.3 MB. Free memory was 152.8 MB in the beginning and 150.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.61 ms. Allocated memory is still 201.3 MB. Free memory was 150.9 MB in the beginning and 106.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61142.10 ms. Allocated memory was 201.3 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L700] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L701] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L702] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L703] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L704] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L705] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L706] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L707] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L708] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L709] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L710] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L711] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L712] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L713] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L714] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 0 pthread_t t2473; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1 = y$w_buff0 [L721] 1 y$w_buff0 = 2 [L722] 1 y$w_buff1_used = y$w_buff0_used [L723] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y = y$flush_delayed ? y$mem_tmp : y [L805] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 60.8s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10100 SDtfs, 10338 SDslu, 24185 SDs, 0 SdLazy, 11145 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 108 SyntacticMatches, 18 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76085occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 153176 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2914 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2783 ConstructedInterpolants, 0 QuantifiedInterpolants, 526567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...