/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:04:11,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:04:11,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:04:11,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:04:11,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:04:11,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:04:11,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:04:11,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:04:11,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:04:11,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:04:11,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:04:11,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:04:11,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:04:11,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:04:11,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:04:11,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:04:11,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:04:11,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:04:11,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:04:11,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:04:11,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:04:11,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:04:11,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:04:11,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:04:11,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:04:11,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:04:11,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:04:11,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:04:11,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:04:11,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:04:11,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:04:11,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:04:11,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:04:11,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:04:11,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:04:11,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:04:11,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:04:11,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:04:11,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:04:11,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:04:11,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:04:11,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:04:11,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:04:11,693 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:04:11,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:04:11,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:04:11,695 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:04:11,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:04:11,698 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:04:11,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:04:11,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:04:11,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:04:11,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:04:11,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:04:11,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:04:11,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:04:11,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:04:11,700 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:04:11,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:04:11,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:04:11,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:04:11,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:04:11,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:04:11,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:04:11,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:04:11,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:04:11,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:04:11,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:04:11,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:04:11,705 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:04:11,705 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:04:11,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:04:12,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:04:12,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:04:12,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:04:12,043 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:04:12,043 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:04:12,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 13:04:12,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c9870a8/a228659ec75240f0bf56d0549256eb35/FLAG64b7b1939 [2019-12-18 13:04:12,670 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:04:12,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc.i [2019-12-18 13:04:12,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c9870a8/a228659ec75240f0bf56d0549256eb35/FLAG64b7b1939 [2019-12-18 13:04:12,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42c9870a8/a228659ec75240f0bf56d0549256eb35 [2019-12-18 13:04:12,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:04:12,948 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:04:12,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:04:12,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:04:12,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:04:12,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:04:12" (1/1) ... [2019-12-18 13:04:12,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f54299f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:12, skipping insertion in model container [2019-12-18 13:04:12,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:04:12" (1/1) ... [2019-12-18 13:04:12,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:04:13,027 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:04:13,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:04:13,677 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:04:13,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:04:13,862 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:04:13,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13 WrapperNode [2019-12-18 13:04:13,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:04:13,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:04:13,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:04:13,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:04:13,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:04:13,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:04:13,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:04:13,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:04:13,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (1/1) ... [2019-12-18 13:04:13,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:04:13,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:04:13,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:04:13,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:04:13,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (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-18 13:04:14,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:04:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:04:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:04:14,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:04:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:04:14,058 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:04:14,058 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:04:14,059 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:04:14,060 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:04:14,060 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:04:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:04:14,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:04:14,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:04:14,065 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:04:14,858 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:04:14,858 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:04:14,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:04:14 BoogieIcfgContainer [2019-12-18 13:04:14,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:04:14,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:04:14,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:04:14,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:04:14,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:04:12" (1/3) ... [2019-12-18 13:04:14,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e11e585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:04:14, skipping insertion in model container [2019-12-18 13:04:14,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:04:13" (2/3) ... [2019-12-18 13:04:14,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e11e585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:04:14, skipping insertion in model container [2019-12-18 13:04:14,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:04:14" (3/3) ... [2019-12-18 13:04:14,870 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc.i [2019-12-18 13:04:14,882 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:04:14,882 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:04:14,890 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:04:14,891 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:04:14,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,959 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,969 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,985 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:14,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,028 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,034 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,039 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,040 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,047 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,058 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:04:15,075 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:04:15,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:04:15,100 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:04:15,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:04:15,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:04:15,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:04:15,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:04:15,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:04:15,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:04:15,115 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:04:15,117 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:04:15,209 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:04:15,209 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:04:15,227 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:04:15,256 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:04:15,308 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:04:15,309 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:04:15,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:04:15,350 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:04:15,351 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:04:20,967 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 13:04:21,239 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:04:21,392 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:04:21,421 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87070 [2019-12-18 13:04:21,421 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 13:04:21,425 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 13:04:38,962 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-18 13:04:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-18 13:04:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:04:38,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:38,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:04:38,971 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:38,977 INFO L82 PathProgramCache]: Analyzing trace with hash 911890, now seen corresponding path program 1 times [2019-12-18 13:04:38,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:38,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810951749] [2019-12-18 13:04:38,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:39,201 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-18 13:04:39,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810951749] [2019-12-18 13:04:39,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:39,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:04:39,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936253097] [2019-12-18 13:04:39,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:04:39,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:04:39,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:39,232 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-18 13:04:40,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:40,642 INFO L93 Difference]: Finished difference Result 114158 states and 484836 transitions. [2019-12-18 13:04:40,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:04:40,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:04:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:41,220 INFO L225 Difference]: With dead ends: 114158 [2019-12-18 13:04:41,221 INFO L226 Difference]: Without dead ends: 107060 [2019-12-18 13:04:41,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:04:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107060 states. [2019-12-18 13:04:50,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107060 to 107060. [2019-12-18 13:04:50,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107060 states. [2019-12-18 13:04:51,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107060 states to 107060 states and 454078 transitions. [2019-12-18 13:04:51,347 INFO L78 Accepts]: Start accepts. Automaton has 107060 states and 454078 transitions. Word has length 3 [2019-12-18 13:04:51,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:04:51,347 INFO L462 AbstractCegarLoop]: Abstraction has 107060 states and 454078 transitions. [2019-12-18 13:04:51,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:04:51,347 INFO L276 IsEmpty]: Start isEmpty. Operand 107060 states and 454078 transitions. [2019-12-18 13:04:51,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:04:51,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:04:51,352 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:04:51,352 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:04:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:04:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1487504284, now seen corresponding path program 1 times [2019-12-18 13:04:51,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:04:51,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678840142] [2019-12-18 13:04:51,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:04:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:04:51,491 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-18 13:04:51,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678840142] [2019-12-18 13:04:51,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:04:51,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:04:51,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387191167] [2019-12-18 13:04:51,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:04:51,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:04:51,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:04:51,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:04:51,494 INFO L87 Difference]: Start difference. First operand 107060 states and 454078 transitions. Second operand 4 states. [2019-12-18 13:04:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:04:56,452 INFO L93 Difference]: Finished difference Result 166396 states and 678148 transitions. [2019-12-18 13:04:56,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:04:56,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:04:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:04:57,161 INFO L225 Difference]: With dead ends: 166396 [2019-12-18 13:04:57,161 INFO L226 Difference]: Without dead ends: 166347 [2019-12-18 13:04:57,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-18 13:05:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166347 states. [2019-12-18 13:05:11,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166347 to 151934. [2019-12-18 13:05:11,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151934 states. [2019-12-18 13:05:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151934 states to 151934 states and 627001 transitions. [2019-12-18 13:05:12,350 INFO L78 Accepts]: Start accepts. Automaton has 151934 states and 627001 transitions. Word has length 11 [2019-12-18 13:05:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:12,350 INFO L462 AbstractCegarLoop]: Abstraction has 151934 states and 627001 transitions. [2019-12-18 13:05:12,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 151934 states and 627001 transitions. [2019-12-18 13:05:12,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:05:12,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:12,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:12,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:12,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:12,358 INFO L82 PathProgramCache]: Analyzing trace with hash 881606285, now seen corresponding path program 1 times [2019-12-18 13:05:12,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:12,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285381311] [2019-12-18 13:05:12,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:12,429 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-18 13:05:12,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285381311] [2019-12-18 13:05:12,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:12,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:12,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854375397] [2019-12-18 13:05:12,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:12,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:12,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:12,431 INFO L87 Difference]: Start difference. First operand 151934 states and 627001 transitions. Second operand 3 states. [2019-12-18 13:05:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:12,567 INFO L93 Difference]: Finished difference Result 33114 states and 107084 transitions. [2019-12-18 13:05:12,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:12,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:05:12,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:12,621 INFO L225 Difference]: With dead ends: 33114 [2019-12-18 13:05:12,621 INFO L226 Difference]: Without dead ends: 33114 [2019-12-18 13:05:12,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33114 states. [2019-12-18 13:05:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33114 to 33114. [2019-12-18 13:05:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33114 states. [2019-12-18 13:05:18,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33114 states to 33114 states and 107084 transitions. [2019-12-18 13:05:18,108 INFO L78 Accepts]: Start accepts. Automaton has 33114 states and 107084 transitions. Word has length 13 [2019-12-18 13:05:18,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:18,109 INFO L462 AbstractCegarLoop]: Abstraction has 33114 states and 107084 transitions. [2019-12-18 13:05:18,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:18,109 INFO L276 IsEmpty]: Start isEmpty. Operand 33114 states and 107084 transitions. [2019-12-18 13:05:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:05:18,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:18,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:05:18,112 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1702625862, now seen corresponding path program 1 times [2019-12-18 13:05:18,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:18,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210910678] [2019-12-18 13:05:18,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:18,223 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-18 13:05:18,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210910678] [2019-12-18 13:05:18,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:18,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:18,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920871321] [2019-12-18 13:05:18,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:05:18,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:18,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:05:18,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:18,228 INFO L87 Difference]: Start difference. First operand 33114 states and 107084 transitions. Second operand 4 states. [2019-12-18 13:05:18,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:18,594 INFO L93 Difference]: Finished difference Result 41561 states and 133908 transitions. [2019-12-18 13:05:18,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:05:18,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:05:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:18,672 INFO L225 Difference]: With dead ends: 41561 [2019-12-18 13:05:18,672 INFO L226 Difference]: Without dead ends: 41561 [2019-12-18 13:05:18,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41561 states. [2019-12-18 13:05:19,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41561 to 37204. [2019-12-18 13:05:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37204 states. [2019-12-18 13:05:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 120245 transitions. [2019-12-18 13:05:19,399 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 120245 transitions. Word has length 16 [2019-12-18 13:05:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:19,401 INFO L462 AbstractCegarLoop]: Abstraction has 37204 states and 120245 transitions. [2019-12-18 13:05:19,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 120245 transitions. [2019-12-18 13:05:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:05:19,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:19,411 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] [2019-12-18 13:05:19,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash -989401703, now seen corresponding path program 1 times [2019-12-18 13:05:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:19,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940797202] [2019-12-18 13:05:19,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:19,552 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-18 13:05:19,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940797202] [2019-12-18 13:05:19,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:19,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:19,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536945973] [2019-12-18 13:05:19,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:19,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:19,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:19,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:19,554 INFO L87 Difference]: Start difference. First operand 37204 states and 120245 transitions. Second operand 5 states. [2019-12-18 13:05:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:20,259 INFO L93 Difference]: Finished difference Result 47941 states and 152440 transitions. [2019-12-18 13:05:20,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 13:05:20,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 13:05:20,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:20,346 INFO L225 Difference]: With dead ends: 47941 [2019-12-18 13:05:20,347 INFO L226 Difference]: Without dead ends: 47934 [2019-12-18 13:05:20,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47934 states. [2019-12-18 13:05:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47934 to 36849. [2019-12-18 13:05:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36849 states. [2019-12-18 13:05:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36849 states to 36849 states and 118974 transitions. [2019-12-18 13:05:21,365 INFO L78 Accepts]: Start accepts. Automaton has 36849 states and 118974 transitions. Word has length 22 [2019-12-18 13:05:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:21,365 INFO L462 AbstractCegarLoop]: Abstraction has 36849 states and 118974 transitions. [2019-12-18 13:05:21,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36849 states and 118974 transitions. [2019-12-18 13:05:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:05:21,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:21,380 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] [2019-12-18 13:05:21,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2090054503, now seen corresponding path program 1 times [2019-12-18 13:05:21,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:21,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103008592] [2019-12-18 13:05:21,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:21,429 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-18 13:05:21,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103008592] [2019-12-18 13:05:21,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:21,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:21,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292145934] [2019-12-18 13:05:21,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:05:21,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:05:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:21,432 INFO L87 Difference]: Start difference. First operand 36849 states and 118974 transitions. Second operand 4 states. [2019-12-18 13:05:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:21,498 INFO L93 Difference]: Finished difference Result 15264 states and 46609 transitions. [2019-12-18 13:05:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:05:21,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:05:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:21,531 INFO L225 Difference]: With dead ends: 15264 [2019-12-18 13:05:21,531 INFO L226 Difference]: Without dead ends: 15264 [2019-12-18 13:05:21,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:05:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15264 states. [2019-12-18 13:05:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15264 to 14936. [2019-12-18 13:05:21,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14936 states. [2019-12-18 13:05:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14936 states to 14936 states and 45673 transitions. [2019-12-18 13:05:21,810 INFO L78 Accepts]: Start accepts. Automaton has 14936 states and 45673 transitions. Word has length 25 [2019-12-18 13:05:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:21,810 INFO L462 AbstractCegarLoop]: Abstraction has 14936 states and 45673 transitions. [2019-12-18 13:05:21,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:05:21,810 INFO L276 IsEmpty]: Start isEmpty. Operand 14936 states and 45673 transitions. [2019-12-18 13:05:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:05:21,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:21,821 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] [2019-12-18 13:05:21,821 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:21,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1906532401, now seen corresponding path program 1 times [2019-12-18 13:05:21,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:21,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115724962] [2019-12-18 13:05:21,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:21,862 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-18 13:05:21,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115724962] [2019-12-18 13:05:21,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:21,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:21,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894389229] [2019-12-18 13:05:21,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:21,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:21,866 INFO L87 Difference]: Start difference. First operand 14936 states and 45673 transitions. Second operand 3 states. [2019-12-18 13:05:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:21,983 INFO L93 Difference]: Finished difference Result 21267 states and 63997 transitions. [2019-12-18 13:05:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:21,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 13:05:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:22,023 INFO L225 Difference]: With dead ends: 21267 [2019-12-18 13:05:22,023 INFO L226 Difference]: Without dead ends: 21267 [2019-12-18 13:05:22,024 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-18 13:05:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21267 states. [2019-12-18 13:05:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21267 to 15790. [2019-12-18 13:05:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15790 states. [2019-12-18 13:05:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15790 states to 15790 states and 48131 transitions. [2019-12-18 13:05:22,309 INFO L78 Accepts]: Start accepts. Automaton has 15790 states and 48131 transitions. Word has length 27 [2019-12-18 13:05:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:22,309 INFO L462 AbstractCegarLoop]: Abstraction has 15790 states and 48131 transitions. [2019-12-18 13:05:22,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 15790 states and 48131 transitions. [2019-12-18 13:05:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:05:22,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:22,319 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] [2019-12-18 13:05:22,320 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1466938041, now seen corresponding path program 1 times [2019-12-18 13:05:22,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:22,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980292599] [2019-12-18 13:05:22,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:22,459 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-18 13:05:22,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980292599] [2019-12-18 13:05:22,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:22,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:22,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371676500] [2019-12-18 13:05:22,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:22,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:22,461 INFO L87 Difference]: Start difference. First operand 15790 states and 48131 transitions. Second operand 6 states. [2019-12-18 13:05:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:23,200 INFO L93 Difference]: Finished difference Result 40724 states and 122204 transitions. [2019-12-18 13:05:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:05:23,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:05:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:23,268 INFO L225 Difference]: With dead ends: 40724 [2019-12-18 13:05:23,269 INFO L226 Difference]: Without dead ends: 40724 [2019-12-18 13:05:23,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:05:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40724 states. [2019-12-18 13:05:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40724 to 22567. [2019-12-18 13:05:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22567 states. [2019-12-18 13:05:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22567 states to 22567 states and 69647 transitions. [2019-12-18 13:05:24,056 INFO L78 Accepts]: Start accepts. Automaton has 22567 states and 69647 transitions. Word has length 27 [2019-12-18 13:05:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:24,056 INFO L462 AbstractCegarLoop]: Abstraction has 22567 states and 69647 transitions. [2019-12-18 13:05:24,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 22567 states and 69647 transitions. [2019-12-18 13:05:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:05:24,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:24,075 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] [2019-12-18 13:05:24,075 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1177717026, now seen corresponding path program 1 times [2019-12-18 13:05:24,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:24,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61781441] [2019-12-18 13:05:24,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:24,267 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-18 13:05:24,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61781441] [2019-12-18 13:05:24,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:24,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:24,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972497300] [2019-12-18 13:05:24,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:05:24,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:24,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:05:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:24,270 INFO L87 Difference]: Start difference. First operand 22567 states and 69647 transitions. Second operand 6 states. [2019-12-18 13:05:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:25,117 INFO L93 Difference]: Finished difference Result 37765 states and 113362 transitions. [2019-12-18 13:05:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:05:25,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 13:05:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:25,169 INFO L225 Difference]: With dead ends: 37765 [2019-12-18 13:05:25,169 INFO L226 Difference]: Without dead ends: 37765 [2019-12-18 13:05:25,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:05:25,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37765 states. [2019-12-18 13:05:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37765 to 22218. [2019-12-18 13:05:25,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22218 states. [2019-12-18 13:05:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22218 states to 22218 states and 68697 transitions. [2019-12-18 13:05:25,650 INFO L78 Accepts]: Start accepts. Automaton has 22218 states and 68697 transitions. Word has length 28 [2019-12-18 13:05:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:25,650 INFO L462 AbstractCegarLoop]: Abstraction has 22218 states and 68697 transitions. [2019-12-18 13:05:25,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:05:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 22218 states and 68697 transitions. [2019-12-18 13:05:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:05:25,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:25,677 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] [2019-12-18 13:05:25,677 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:25,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1088633804, now seen corresponding path program 1 times [2019-12-18 13:05:25,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:25,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729015608] [2019-12-18 13:05:25,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:25,785 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-18 13:05:25,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729015608] [2019-12-18 13:05:25,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:25,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:25,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947800791] [2019-12-18 13:05:25,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:25,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:25,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:25,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:25,787 INFO L87 Difference]: Start difference. First operand 22218 states and 68697 transitions. Second operand 7 states. [2019-12-18 13:05:27,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:27,347 INFO L93 Difference]: Finished difference Result 50401 states and 150592 transitions. [2019-12-18 13:05:27,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 13:05:27,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:05:27,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:27,432 INFO L225 Difference]: With dead ends: 50401 [2019-12-18 13:05:27,433 INFO L226 Difference]: Without dead ends: 50401 [2019-12-18 13:05:27,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:05:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50401 states. [2019-12-18 13:05:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50401 to 23449. [2019-12-18 13:05:27,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23449 states. [2019-12-18 13:05:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23449 states to 23449 states and 72523 transitions. [2019-12-18 13:05:28,281 INFO L78 Accepts]: Start accepts. Automaton has 23449 states and 72523 transitions. Word has length 33 [2019-12-18 13:05:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:28,281 INFO L462 AbstractCegarLoop]: Abstraction has 23449 states and 72523 transitions. [2019-12-18 13:05:28,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:28,281 INFO L276 IsEmpty]: Start isEmpty. Operand 23449 states and 72523 transitions. [2019-12-18 13:05:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:05:28,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:28,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] [2019-12-18 13:05:28,305 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:28,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:28,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1082826604, now seen corresponding path program 1 times [2019-12-18 13:05:28,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:28,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550928899] [2019-12-18 13:05:28,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:28,344 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-18 13:05:28,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550928899] [2019-12-18 13:05:28,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:28,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:05:28,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332936906] [2019-12-18 13:05:28,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:28,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:28,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:28,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:28,346 INFO L87 Difference]: Start difference. First operand 23449 states and 72523 transitions. Second operand 3 states. [2019-12-18 13:05:28,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:28,494 INFO L93 Difference]: Finished difference Result 31046 states and 92713 transitions. [2019-12-18 13:05:28,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:28,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 13:05:28,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:28,565 INFO L225 Difference]: With dead ends: 31046 [2019-12-18 13:05:28,565 INFO L226 Difference]: Without dead ends: 31046 [2019-12-18 13:05:28,566 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-18 13:05:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31046 states. [2019-12-18 13:05:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31046 to 22288. [2019-12-18 13:05:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22288 states. [2019-12-18 13:05:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22288 states to 22288 states and 66690 transitions. [2019-12-18 13:05:29,176 INFO L78 Accepts]: Start accepts. Automaton has 22288 states and 66690 transitions. Word has length 33 [2019-12-18 13:05:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:29,176 INFO L462 AbstractCegarLoop]: Abstraction has 22288 states and 66690 transitions. [2019-12-18 13:05:29,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22288 states and 66690 transitions. [2019-12-18 13:05:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:05:29,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:29,200 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] [2019-12-18 13:05:29,201 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1090977820, now seen corresponding path program 2 times [2019-12-18 13:05:29,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:29,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744024519] [2019-12-18 13:05:29,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:29,364 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-18 13:05:29,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744024519] [2019-12-18 13:05:29,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:29,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:05:29,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947303464] [2019-12-18 13:05:29,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:05:29,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:05:29,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:05:29,368 INFO L87 Difference]: Start difference. First operand 22288 states and 66690 transitions. Second operand 8 states. [2019-12-18 13:05:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:31,197 INFO L93 Difference]: Finished difference Result 49099 states and 143360 transitions. [2019-12-18 13:05:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 13:05:31,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 13:05:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:31,264 INFO L225 Difference]: With dead ends: 49099 [2019-12-18 13:05:31,264 INFO L226 Difference]: Without dead ends: 49099 [2019-12-18 13:05:31,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 13:05:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49099 states. [2019-12-18 13:05:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49099 to 21685. [2019-12-18 13:05:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-12-18 13:05:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 64891 transitions. [2019-12-18 13:05:31,788 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 64891 transitions. Word has length 33 [2019-12-18 13:05:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:31,788 INFO L462 AbstractCegarLoop]: Abstraction has 21685 states and 64891 transitions. [2019-12-18 13:05:31,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:05:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 64891 transitions. [2019-12-18 13:05:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:05:31,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:31,806 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] [2019-12-18 13:05:31,806 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:31,807 INFO L82 PathProgramCache]: Analyzing trace with hash 791261483, now seen corresponding path program 1 times [2019-12-18 13:05:31,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:31,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75768430] [2019-12-18 13:05:31,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:32,026 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-18 13:05:32,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75768430] [2019-12-18 13:05:32,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:32,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:05:32,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273699114] [2019-12-18 13:05:32,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:32,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:32,028 INFO L87 Difference]: Start difference. First operand 21685 states and 64891 transitions. Second operand 9 states. [2019-12-18 13:05:34,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:34,025 INFO L93 Difference]: Finished difference Result 39456 states and 115299 transitions. [2019-12-18 13:05:34,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 13:05:34,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 13:05:34,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:34,082 INFO L225 Difference]: With dead ends: 39456 [2019-12-18 13:05:34,082 INFO L226 Difference]: Without dead ends: 39456 [2019-12-18 13:05:34,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:05:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39456 states. [2019-12-18 13:05:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39456 to 21437. [2019-12-18 13:05:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21437 states. [2019-12-18 13:05:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21437 states to 21437 states and 64195 transitions. [2019-12-18 13:05:34,552 INFO L78 Accepts]: Start accepts. Automaton has 21437 states and 64195 transitions. Word has length 34 [2019-12-18 13:05:34,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:34,553 INFO L462 AbstractCegarLoop]: Abstraction has 21437 states and 64195 transitions. [2019-12-18 13:05:34,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 21437 states and 64195 transitions. [2019-12-18 13:05:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:05:34,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:34,575 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] [2019-12-18 13:05:34,575 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1281586677, now seen corresponding path program 2 times [2019-12-18 13:05:34,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:34,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692239431] [2019-12-18 13:05:34,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:34,709 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-18 13:05:34,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692239431] [2019-12-18 13:05:34,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:34,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:34,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77490416] [2019-12-18 13:05:34,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:34,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:34,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:34,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:34,713 INFO L87 Difference]: Start difference. First operand 21437 states and 64195 transitions. Second operand 7 states. [2019-12-18 13:05:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:36,008 INFO L93 Difference]: Finished difference Result 35917 states and 105493 transitions. [2019-12-18 13:05:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:05:36,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:05:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:36,094 INFO L225 Difference]: With dead ends: 35917 [2019-12-18 13:05:36,094 INFO L226 Difference]: Without dead ends: 35917 [2019-12-18 13:05:36,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:05:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35917 states. [2019-12-18 13:05:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35917 to 20324. [2019-12-18 13:05:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20324 states. [2019-12-18 13:05:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20324 states to 20324 states and 60908 transitions. [2019-12-18 13:05:36,841 INFO L78 Accepts]: Start accepts. Automaton has 20324 states and 60908 transitions. Word has length 34 [2019-12-18 13:05:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:36,842 INFO L462 AbstractCegarLoop]: Abstraction has 20324 states and 60908 transitions. [2019-12-18 13:05:36,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20324 states and 60908 transitions. [2019-12-18 13:05:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:05:36,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:36,873 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] [2019-12-18 13:05:36,873 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:36,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1244987983, now seen corresponding path program 3 times [2019-12-18 13:05:36,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:36,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121085879] [2019-12-18 13:05:36,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:37,088 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-18 13:05:37,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121085879] [2019-12-18 13:05:37,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:37,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:37,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118764106] [2019-12-18 13:05:37,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:37,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:37,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:37,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:37,090 INFO L87 Difference]: Start difference. First operand 20324 states and 60908 transitions. Second operand 7 states. [2019-12-18 13:05:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:38,326 INFO L93 Difference]: Finished difference Result 46732 states and 135699 transitions. [2019-12-18 13:05:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 13:05:38,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 13:05:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:38,401 INFO L225 Difference]: With dead ends: 46732 [2019-12-18 13:05:38,401 INFO L226 Difference]: Without dead ends: 46732 [2019-12-18 13:05:38,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:05:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46732 states. [2019-12-18 13:05:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46732 to 19737. [2019-12-18 13:05:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19737 states. [2019-12-18 13:05:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19737 states to 19737 states and 59173 transitions. [2019-12-18 13:05:39,028 INFO L78 Accepts]: Start accepts. Automaton has 19737 states and 59173 transitions. Word has length 34 [2019-12-18 13:05:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:39,028 INFO L462 AbstractCegarLoop]: Abstraction has 19737 states and 59173 transitions. [2019-12-18 13:05:39,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 19737 states and 59173 transitions. [2019-12-18 13:05:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 13:05:39,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:39,045 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] [2019-12-18 13:05:39,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:39,045 INFO L82 PathProgramCache]: Analyzing trace with hash -851207469, now seen corresponding path program 4 times [2019-12-18 13:05:39,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:39,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773572010] [2019-12-18 13:05:39,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:39,197 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-18 13:05:39,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773572010] [2019-12-18 13:05:39,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:39,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:05:39,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19150373] [2019-12-18 13:05:39,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:39,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:39,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:39,199 INFO L87 Difference]: Start difference. First operand 19737 states and 59173 transitions. Second operand 9 states. [2019-12-18 13:05:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:40,981 INFO L93 Difference]: Finished difference Result 41366 states and 121149 transitions. [2019-12-18 13:05:40,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:05:40,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 13:05:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:41,036 INFO L225 Difference]: With dead ends: 41366 [2019-12-18 13:05:41,036 INFO L226 Difference]: Without dead ends: 41366 [2019-12-18 13:05:41,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:05:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41366 states. [2019-12-18 13:05:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41366 to 19413. [2019-12-18 13:05:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19413 states. [2019-12-18 13:05:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19413 states to 19413 states and 58228 transitions. [2019-12-18 13:05:41,471 INFO L78 Accepts]: Start accepts. Automaton has 19413 states and 58228 transitions. Word has length 34 [2019-12-18 13:05:41,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:41,472 INFO L462 AbstractCegarLoop]: Abstraction has 19413 states and 58228 transitions. [2019-12-18 13:05:41,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand 19413 states and 58228 transitions. [2019-12-18 13:05:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:05:41,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:41,489 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] [2019-12-18 13:05:41,490 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:41,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1420266152, now seen corresponding path program 1 times [2019-12-18 13:05:41,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:41,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15996933] [2019-12-18 13:05:41,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:41,537 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-18 13:05:41,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15996933] [2019-12-18 13:05:41,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:41,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:05:41,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46744568] [2019-12-18 13:05:41,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:41,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:41,539 INFO L87 Difference]: Start difference. First operand 19413 states and 58228 transitions. Second operand 3 states. [2019-12-18 13:05:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:41,625 INFO L93 Difference]: Finished difference Result 19412 states and 58226 transitions. [2019-12-18 13:05:41,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:41,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 13:05:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:41,662 INFO L225 Difference]: With dead ends: 19412 [2019-12-18 13:05:41,662 INFO L226 Difference]: Without dead ends: 19412 [2019-12-18 13:05:41,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19412 states. [2019-12-18 13:05:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19412 to 19412. [2019-12-18 13:05:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19412 states. [2019-12-18 13:05:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19412 states to 19412 states and 58226 transitions. [2019-12-18 13:05:41,971 INFO L78 Accepts]: Start accepts. Automaton has 19412 states and 58226 transitions. Word has length 39 [2019-12-18 13:05:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:41,971 INFO L462 AbstractCegarLoop]: Abstraction has 19412 states and 58226 transitions. [2019-12-18 13:05:41,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 19412 states and 58226 transitions. [2019-12-18 13:05:41,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:05:41,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:41,991 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] [2019-12-18 13:05:41,991 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:41,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:41,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1015126435, now seen corresponding path program 1 times [2019-12-18 13:05:41,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:41,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005981689] [2019-12-18 13:05:41,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:42,027 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-18 13:05:42,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005981689] [2019-12-18 13:05:42,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:42,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:42,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709944634] [2019-12-18 13:05:42,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:42,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:42,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:42,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:42,029 INFO L87 Difference]: Start difference. First operand 19412 states and 58226 transitions. Second operand 3 states. [2019-12-18 13:05:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:42,145 INFO L93 Difference]: Finished difference Result 36821 states and 110495 transitions. [2019-12-18 13:05:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:42,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:05:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:42,174 INFO L225 Difference]: With dead ends: 36821 [2019-12-18 13:05:42,174 INFO L226 Difference]: Without dead ends: 19829 [2019-12-18 13:05:42,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19829 states. [2019-12-18 13:05:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19829 to 19763. [2019-12-18 13:05:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19763 states. [2019-12-18 13:05:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19763 states to 19763 states and 57956 transitions. [2019-12-18 13:05:42,653 INFO L78 Accepts]: Start accepts. Automaton has 19763 states and 57956 transitions. Word has length 40 [2019-12-18 13:05:42,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:42,653 INFO L462 AbstractCegarLoop]: Abstraction has 19763 states and 57956 transitions. [2019-12-18 13:05:42,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:42,653 INFO L276 IsEmpty]: Start isEmpty. Operand 19763 states and 57956 transitions. [2019-12-18 13:05:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:05:42,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:42,672 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] [2019-12-18 13:05:42,672 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:42,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1234885869, now seen corresponding path program 2 times [2019-12-18 13:05:42,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:42,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581598846] [2019-12-18 13:05:42,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:42,751 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-18 13:05:42,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581598846] [2019-12-18 13:05:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:42,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:05:42,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199791279] [2019-12-18 13:05:42,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:42,753 INFO L87 Difference]: Start difference. First operand 19763 states and 57956 transitions. Second operand 5 states. [2019-12-18 13:05:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:43,544 INFO L93 Difference]: Finished difference Result 28152 states and 81728 transitions. [2019-12-18 13:05:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:05:43,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 13:05:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:43,595 INFO L225 Difference]: With dead ends: 28152 [2019-12-18 13:05:43,596 INFO L226 Difference]: Without dead ends: 28152 [2019-12-18 13:05:43,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:05:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28152 states. [2019-12-18 13:05:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28152 to 25718. [2019-12-18 13:05:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25718 states. [2019-12-18 13:05:44,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25718 states to 25718 states and 75196 transitions. [2019-12-18 13:05:44,070 INFO L78 Accepts]: Start accepts. Automaton has 25718 states and 75196 transitions. Word has length 40 [2019-12-18 13:05:44,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:44,071 INFO L462 AbstractCegarLoop]: Abstraction has 25718 states and 75196 transitions. [2019-12-18 13:05:44,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:44,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25718 states and 75196 transitions. [2019-12-18 13:05:44,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 13:05:44,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:44,095 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] [2019-12-18 13:05:44,096 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:44,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash 342200019, now seen corresponding path program 3 times [2019-12-18 13:05:44,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061232416] [2019-12-18 13:05:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:44,172 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-18 13:05:44,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061232416] [2019-12-18 13:05:44,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:44,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:44,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523634293] [2019-12-18 13:05:44,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:44,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:44,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:44,174 INFO L87 Difference]: Start difference. First operand 25718 states and 75196 transitions. Second operand 3 states. [2019-12-18 13:05:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:44,247 INFO L93 Difference]: Finished difference Result 24330 states and 70130 transitions. [2019-12-18 13:05:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:44,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 13:05:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:44,280 INFO L225 Difference]: With dead ends: 24330 [2019-12-18 13:05:44,280 INFO L226 Difference]: Without dead ends: 24330 [2019-12-18 13:05:44,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24330 states. [2019-12-18 13:05:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24330 to 24266. [2019-12-18 13:05:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24266 states. [2019-12-18 13:05:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24266 states to 24266 states and 69952 transitions. [2019-12-18 13:05:44,628 INFO L78 Accepts]: Start accepts. Automaton has 24266 states and 69952 transitions. Word has length 40 [2019-12-18 13:05:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:44,628 INFO L462 AbstractCegarLoop]: Abstraction has 24266 states and 69952 transitions. [2019-12-18 13:05:44,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 24266 states and 69952 transitions. [2019-12-18 13:05:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 13:05:44,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:44,649 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] [2019-12-18 13:05:44,649 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:44,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2044650148, now seen corresponding path program 1 times [2019-12-18 13:05:44,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:44,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804037395] [2019-12-18 13:05:44,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:44,740 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-18 13:05:44,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804037395] [2019-12-18 13:05:44,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:44,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:05:44,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700914488] [2019-12-18 13:05:44,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:05:44,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:05:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:44,744 INFO L87 Difference]: Start difference. First operand 24266 states and 69952 transitions. Second operand 3 states. [2019-12-18 13:05:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:44,838 INFO L93 Difference]: Finished difference Result 24266 states and 69874 transitions. [2019-12-18 13:05:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:05:44,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 13:05:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:44,879 INFO L225 Difference]: With dead ends: 24266 [2019-12-18 13:05:44,879 INFO L226 Difference]: Without dead ends: 24266 [2019-12-18 13:05:44,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:05:44,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24266 states. [2019-12-18 13:05:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24266 to 19817. [2019-12-18 13:05:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19817 states. [2019-12-18 13:05:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19817 states to 19817 states and 57519 transitions. [2019-12-18 13:05:45,206 INFO L78 Accepts]: Start accepts. Automaton has 19817 states and 57519 transitions. Word has length 41 [2019-12-18 13:05:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:45,207 INFO L462 AbstractCegarLoop]: Abstraction has 19817 states and 57519 transitions. [2019-12-18 13:05:45,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:05:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 19817 states and 57519 transitions. [2019-12-18 13:05:45,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:05:45,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:45,224 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] [2019-12-18 13:05:45,224 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:45,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:45,224 INFO L82 PathProgramCache]: Analyzing trace with hash 884175412, now seen corresponding path program 1 times [2019-12-18 13:05:45,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:45,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10717175] [2019-12-18 13:05:45,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:45,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-18 13:05:45,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10717175] [2019-12-18 13:05:45,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:45,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:05:45,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138940924] [2019-12-18 13:05:45,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:05:45,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:45,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:05:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:45,265 INFO L87 Difference]: Start difference. First operand 19817 states and 57519 transitions. Second operand 5 states. [2019-12-18 13:05:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:45,346 INFO L93 Difference]: Finished difference Result 18568 states and 54840 transitions. [2019-12-18 13:05:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:05:45,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 13:05:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:45,370 INFO L225 Difference]: With dead ends: 18568 [2019-12-18 13:05:45,370 INFO L226 Difference]: Without dead ends: 17139 [2019-12-18 13:05:45,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:05:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17139 states. [2019-12-18 13:05:45,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17139 to 17139. [2019-12-18 13:05:45,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17139 states. [2019-12-18 13:05:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17139 states to 17139 states and 51794 transitions. [2019-12-18 13:05:45,770 INFO L78 Accepts]: Start accepts. Automaton has 17139 states and 51794 transitions. Word has length 42 [2019-12-18 13:05:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:45,770 INFO L462 AbstractCegarLoop]: Abstraction has 17139 states and 51794 transitions. [2019-12-18 13:05:45,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:05:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17139 states and 51794 transitions. [2019-12-18 13:05:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:45,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:45,788 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] [2019-12-18 13:05:45,788 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1215626616, now seen corresponding path program 1 times [2019-12-18 13:05:45,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:45,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281777090] [2019-12-18 13:05:45,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:45,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:45,854 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-18 13:05:45,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281777090] [2019-12-18 13:05:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:05:45,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98370392] [2019-12-18 13:05:45,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:05:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:05:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:05:45,857 INFO L87 Difference]: Start difference. First operand 17139 states and 51794 transitions. Second operand 7 states. [2019-12-18 13:05:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:46,255 INFO L93 Difference]: Finished difference Result 48114 states and 143833 transitions. [2019-12-18 13:05:46,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:05:46,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 13:05:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:46,302 INFO L225 Difference]: With dead ends: 48114 [2019-12-18 13:05:46,302 INFO L226 Difference]: Without dead ends: 33834 [2019-12-18 13:05:46,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:05:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33834 states. [2019-12-18 13:05:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33834 to 20005. [2019-12-18 13:05:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20005 states. [2019-12-18 13:05:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20005 states to 20005 states and 59874 transitions. [2019-12-18 13:05:46,739 INFO L78 Accepts]: Start accepts. Automaton has 20005 states and 59874 transitions. Word has length 66 [2019-12-18 13:05:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:46,739 INFO L462 AbstractCegarLoop]: Abstraction has 20005 states and 59874 transitions. [2019-12-18 13:05:46,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:05:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20005 states and 59874 transitions. [2019-12-18 13:05:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:46,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:46,760 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] [2019-12-18 13:05:46,760 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:46,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1961322332, now seen corresponding path program 2 times [2019-12-18 13:05:46,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:46,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755653480] [2019-12-18 13:05:46,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:46,897 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-18 13:05:46,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755653480] [2019-12-18 13:05:46,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:46,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:05:46,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253729343] [2019-12-18 13:05:46,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:05:46,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:46,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:05:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:05:46,899 INFO L87 Difference]: Start difference. First operand 20005 states and 59874 transitions. Second operand 8 states. [2019-12-18 13:05:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:49,741 INFO L93 Difference]: Finished difference Result 42581 states and 126178 transitions. [2019-12-18 13:05:49,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:05:49,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:05:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:49,800 INFO L225 Difference]: With dead ends: 42581 [2019-12-18 13:05:49,800 INFO L226 Difference]: Without dead ends: 42309 [2019-12-18 13:05:49,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 13:05:49,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42309 states. [2019-12-18 13:05:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42309 to 21043. [2019-12-18 13:05:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21043 states. [2019-12-18 13:05:50,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21043 states to 21043 states and 63048 transitions. [2019-12-18 13:05:50,324 INFO L78 Accepts]: Start accepts. Automaton has 21043 states and 63048 transitions. Word has length 66 [2019-12-18 13:05:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:50,324 INFO L462 AbstractCegarLoop]: Abstraction has 21043 states and 63048 transitions. [2019-12-18 13:05:50,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:05:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21043 states and 63048 transitions. [2019-12-18 13:05:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:50,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:50,567 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] [2019-12-18 13:05:50,567 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:50,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1828255542, now seen corresponding path program 3 times [2019-12-18 13:05:50,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:50,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533478123] [2019-12-18 13:05:50,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:50,693 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-18 13:05:50,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533478123] [2019-12-18 13:05:50,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:50,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:05:50,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395886309] [2019-12-18 13:05:50,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:50,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:50,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:50,696 INFO L87 Difference]: Start difference. First operand 21043 states and 63048 transitions. Second operand 9 states. [2019-12-18 13:05:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:54,269 INFO L93 Difference]: Finished difference Result 47208 states and 139511 transitions. [2019-12-18 13:05:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 13:05:54,269 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:05:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:54,369 INFO L225 Difference]: With dead ends: 47208 [2019-12-18 13:05:54,369 INFO L226 Difference]: Without dead ends: 47208 [2019-12-18 13:05:54,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=466, Invalid=1984, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 13:05:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47208 states. [2019-12-18 13:05:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47208 to 20769. [2019-12-18 13:05:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20769 states. [2019-12-18 13:05:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20769 states to 20769 states and 62252 transitions. [2019-12-18 13:05:54,994 INFO L78 Accepts]: Start accepts. Automaton has 20769 states and 62252 transitions. Word has length 66 [2019-12-18 13:05:54,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:54,994 INFO L462 AbstractCegarLoop]: Abstraction has 20769 states and 62252 transitions. [2019-12-18 13:05:54,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20769 states and 62252 transitions. [2019-12-18 13:05:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:55,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:55,017 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] [2019-12-18 13:05:55,018 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash -178270044, now seen corresponding path program 4 times [2019-12-18 13:05:55,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:55,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901777145] [2019-12-18 13:05:55,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:55,122 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-18 13:05:55,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901777145] [2019-12-18 13:05:55,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:55,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:05:55,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725699160] [2019-12-18 13:05:55,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:05:55,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:05:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:05:55,124 INFO L87 Difference]: Start difference. First operand 20769 states and 62252 transitions. Second operand 8 states. [2019-12-18 13:05:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:56,532 INFO L93 Difference]: Finished difference Result 40034 states and 119878 transitions. [2019-12-18 13:05:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:05:56,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-18 13:05:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:56,579 INFO L225 Difference]: With dead ends: 40034 [2019-12-18 13:05:56,579 INFO L226 Difference]: Without dead ends: 32335 [2019-12-18 13:05:56,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:05:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32335 states. [2019-12-18 13:05:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32335 to 21470. [2019-12-18 13:05:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21470 states. [2019-12-18 13:05:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21470 states to 21470 states and 63912 transitions. [2019-12-18 13:05:56,988 INFO L78 Accepts]: Start accepts. Automaton has 21470 states and 63912 transitions. Word has length 66 [2019-12-18 13:05:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:56,988 INFO L462 AbstractCegarLoop]: Abstraction has 21470 states and 63912 transitions. [2019-12-18 13:05:56,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:05:56,989 INFO L276 IsEmpty]: Start isEmpty. Operand 21470 states and 63912 transitions. [2019-12-18 13:05:57,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:57,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:57,008 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] [2019-12-18 13:05:57,008 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:57,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1109171142, now seen corresponding path program 5 times [2019-12-18 13:05:57,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:57,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218132724] [2019-12-18 13:05:57,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:57,354 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-18 13:05:57,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218132724] [2019-12-18 13:05:57,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:57,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:05:57,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442518057] [2019-12-18 13:05:57,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 13:05:57,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 13:05:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:05:57,356 INFO L87 Difference]: Start difference. First operand 21470 states and 63912 transitions. Second operand 9 states. [2019-12-18 13:05:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:05:58,677 INFO L93 Difference]: Finished difference Result 37534 states and 111576 transitions. [2019-12-18 13:05:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:05:58,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 13:05:58,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:05:58,721 INFO L225 Difference]: With dead ends: 37534 [2019-12-18 13:05:58,721 INFO L226 Difference]: Without dead ends: 31687 [2019-12-18 13:05:58,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:05:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31687 states. [2019-12-18 13:05:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31687 to 21254. [2019-12-18 13:05:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21254 states. [2019-12-18 13:05:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21254 states to 21254 states and 63224 transitions. [2019-12-18 13:05:59,119 INFO L78 Accepts]: Start accepts. Automaton has 21254 states and 63224 transitions. Word has length 66 [2019-12-18 13:05:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:05:59,120 INFO L462 AbstractCegarLoop]: Abstraction has 21254 states and 63224 transitions. [2019-12-18 13:05:59,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 13:05:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 21254 states and 63224 transitions. [2019-12-18 13:05:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:05:59,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:05:59,143 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] [2019-12-18 13:05:59,143 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:05:59,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:05:59,143 INFO L82 PathProgramCache]: Analyzing trace with hash 191706936, now seen corresponding path program 6 times [2019-12-18 13:05:59,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:05:59,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048906034] [2019-12-18 13:05:59,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:05:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:05:59,666 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-18 13:05:59,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048906034] [2019-12-18 13:05:59,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:05:59,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:05:59,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632660931] [2019-12-18 13:05:59,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:05:59,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:05:59,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:05:59,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:05:59,668 INFO L87 Difference]: Start difference. First operand 21254 states and 63224 transitions. Second operand 17 states. [2019-12-18 13:06:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:04,110 INFO L93 Difference]: Finished difference Result 33380 states and 97736 transitions. [2019-12-18 13:06:04,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 13:06:04,111 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 13:06:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:04,151 INFO L225 Difference]: With dead ends: 33380 [2019-12-18 13:06:04,152 INFO L226 Difference]: Without dead ends: 29804 [2019-12-18 13:06:04,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=412, Invalid=2038, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 13:06:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29804 states. [2019-12-18 13:06:04,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29804 to 21868. [2019-12-18 13:06:04,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21868 states. [2019-12-18 13:06:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21868 states to 21868 states and 64767 transitions. [2019-12-18 13:06:04,805 INFO L78 Accepts]: Start accepts. Automaton has 21868 states and 64767 transitions. Word has length 66 [2019-12-18 13:06:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:04,805 INFO L462 AbstractCegarLoop]: Abstraction has 21868 states and 64767 transitions. [2019-12-18 13:06:04,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:06:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 21868 states and 64767 transitions. [2019-12-18 13:06:04,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:04,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:04,827 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] [2019-12-18 13:06:04,827 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:04,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:04,828 INFO L82 PathProgramCache]: Analyzing trace with hash 390243420, now seen corresponding path program 7 times [2019-12-18 13:06:04,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:04,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337321479] [2019-12-18 13:06:04,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:05,643 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-18 13:06:05,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337321479] [2019-12-18 13:06:05,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:05,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:06:05,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288449712] [2019-12-18 13:06:05,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:06:05,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:05,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:06:05,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:06:05,645 INFO L87 Difference]: Start difference. First operand 21868 states and 64767 transitions. Second operand 17 states. [2019-12-18 13:06:08,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:08,831 INFO L93 Difference]: Finished difference Result 31075 states and 91188 transitions. [2019-12-18 13:06:08,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 13:06:08,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 13:06:08,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:08,874 INFO L225 Difference]: With dead ends: 31075 [2019-12-18 13:06:08,874 INFO L226 Difference]: Without dead ends: 29732 [2019-12-18 13:06:08,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=301, Invalid=1339, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 13:06:08,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29732 states. [2019-12-18 13:06:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29732 to 21676. [2019-12-18 13:06:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21676 states. [2019-12-18 13:06:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21676 states to 21676 states and 64281 transitions. [2019-12-18 13:06:09,276 INFO L78 Accepts]: Start accepts. Automaton has 21676 states and 64281 transitions. Word has length 66 [2019-12-18 13:06:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:09,276 INFO L462 AbstractCegarLoop]: Abstraction has 21676 states and 64281 transitions. [2019-12-18 13:06:09,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:06:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21676 states and 64281 transitions. [2019-12-18 13:06:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:09,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:09,300 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] [2019-12-18 13:06:09,300 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1093592258, now seen corresponding path program 8 times [2019-12-18 13:06:09,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:09,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179746789] [2019-12-18 13:06:09,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:09,765 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-18 13:06:09,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179746789] [2019-12-18 13:06:09,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:09,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:06:09,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895910409] [2019-12-18 13:06:09,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:06:09,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:06:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:06:09,768 INFO L87 Difference]: Start difference. First operand 21676 states and 64281 transitions. Second operand 15 states. [2019-12-18 13:06:14,109 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-12-18 13:06:15,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:15,336 INFO L93 Difference]: Finished difference Result 48156 states and 142053 transitions. [2019-12-18 13:06:15,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 13:06:15,337 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 13:06:15,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:15,397 INFO L225 Difference]: With dead ends: 48156 [2019-12-18 13:06:15,397 INFO L226 Difference]: Without dead ends: 45362 [2019-12-18 13:06:15,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=562, Invalid=3220, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 13:06:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45362 states. [2019-12-18 13:06:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45362 to 23879. [2019-12-18 13:06:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23879 states. [2019-12-18 13:06:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23879 states to 23879 states and 70364 transitions. [2019-12-18 13:06:15,905 INFO L78 Accepts]: Start accepts. Automaton has 23879 states and 70364 transitions. Word has length 66 [2019-12-18 13:06:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:15,905 INFO L462 AbstractCegarLoop]: Abstraction has 23879 states and 70364 transitions. [2019-12-18 13:06:15,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:06:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 23879 states and 70364 transitions. [2019-12-18 13:06:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:15,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:15,928 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] [2019-12-18 13:06:15,928 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:15,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1123753950, now seen corresponding path program 9 times [2019-12-18 13:06:15,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:15,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006922386] [2019-12-18 13:06:15,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:16,430 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-18 13:06:16,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006922386] [2019-12-18 13:06:16,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:16,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:06:16,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287724106] [2019-12-18 13:06:16,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:06:16,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:06:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:06:16,432 INFO L87 Difference]: Start difference. First operand 23879 states and 70364 transitions. Second operand 18 states. [2019-12-18 13:06:21,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:21,510 INFO L93 Difference]: Finished difference Result 33228 states and 96487 transitions. [2019-12-18 13:06:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 13:06:21,516 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2019-12-18 13:06:21,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:21,558 INFO L225 Difference]: With dead ends: 33228 [2019-12-18 13:06:21,558 INFO L226 Difference]: Without dead ends: 31698 [2019-12-18 13:06:21,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=553, Invalid=2753, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 13:06:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31698 states. [2019-12-18 13:06:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31698 to 23730. [2019-12-18 13:06:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23730 states. [2019-12-18 13:06:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23730 states to 23730 states and 69932 transitions. [2019-12-18 13:06:22,177 INFO L78 Accepts]: Start accepts. Automaton has 23730 states and 69932 transitions. Word has length 66 [2019-12-18 13:06:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:22,177 INFO L462 AbstractCegarLoop]: Abstraction has 23730 states and 69932 transitions. [2019-12-18 13:06:22,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:06:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23730 states and 69932 transitions. [2019-12-18 13:06:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:22,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:22,201 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] [2019-12-18 13:06:22,201 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:22,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash 991837186, now seen corresponding path program 10 times [2019-12-18 13:06:22,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:22,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765836737] [2019-12-18 13:06:22,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:22,392 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-18 13:06:22,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765836737] [2019-12-18 13:06:22,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:22,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:06:22,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128132073] [2019-12-18 13:06:22,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:06:22,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:06:22,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:06:22,394 INFO L87 Difference]: Start difference. First operand 23730 states and 69932 transitions. Second operand 12 states. [2019-12-18 13:06:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:24,310 INFO L93 Difference]: Finished difference Result 34053 states and 99062 transitions. [2019-12-18 13:06:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:06:24,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 13:06:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:24,351 INFO L225 Difference]: With dead ends: 34053 [2019-12-18 13:06:24,351 INFO L226 Difference]: Without dead ends: 29550 [2019-12-18 13:06:24,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:06:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29550 states. [2019-12-18 13:06:24,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29550 to 23662. [2019-12-18 13:06:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23662 states. [2019-12-18 13:06:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23662 states to 23662 states and 69505 transitions. [2019-12-18 13:06:24,764 INFO L78 Accepts]: Start accepts. Automaton has 23662 states and 69505 transitions. Word has length 66 [2019-12-18 13:06:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:24,764 INFO L462 AbstractCegarLoop]: Abstraction has 23662 states and 69505 transitions. [2019-12-18 13:06:24,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:06:24,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23662 states and 69505 transitions. [2019-12-18 13:06:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:24,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:24,790 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] [2019-12-18 13:06:24,791 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1804114782, now seen corresponding path program 11 times [2019-12-18 13:06:24,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:24,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347802921] [2019-12-18 13:06:24,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:24,959 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-18 13:06:24,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347802921] [2019-12-18 13:06:24,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:24,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:06:24,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402088421] [2019-12-18 13:06:24,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:06:24,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:24,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:06:24,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:06:24,961 INFO L87 Difference]: Start difference. First operand 23662 states and 69505 transitions. Second operand 12 states. [2019-12-18 13:06:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:26,362 INFO L93 Difference]: Finished difference Result 31611 states and 92426 transitions. [2019-12-18 13:06:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 13:06:26,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-18 13:06:26,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:26,402 INFO L225 Difference]: With dead ends: 31611 [2019-12-18 13:06:26,402 INFO L226 Difference]: Without dead ends: 28882 [2019-12-18 13:06:26,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-18 13:06:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28882 states. [2019-12-18 13:06:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28882 to 23642. [2019-12-18 13:06:26,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23642 states. [2019-12-18 13:06:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23642 states to 23642 states and 69435 transitions. [2019-12-18 13:06:26,805 INFO L78 Accepts]: Start accepts. Automaton has 23642 states and 69435 transitions. Word has length 66 [2019-12-18 13:06:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:26,805 INFO L462 AbstractCegarLoop]: Abstraction has 23642 states and 69435 transitions. [2019-12-18 13:06:26,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:06:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23642 states and 69435 transitions. [2019-12-18 13:06:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:26,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:26,841 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] [2019-12-18 13:06:26,841 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:26,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1626612378, now seen corresponding path program 12 times [2019-12-18 13:06:26,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:26,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829466981] [2019-12-18 13:06:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:27,087 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-18 13:06:27,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829466981] [2019-12-18 13:06:27,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:27,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 13:06:27,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008337695] [2019-12-18 13:06:27,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 13:06:27,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:27,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 13:06:27,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:06:27,089 INFO L87 Difference]: Start difference. First operand 23642 states and 69435 transitions. Second operand 13 states. [2019-12-18 13:06:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:29,171 INFO L93 Difference]: Finished difference Result 30673 states and 89279 transitions. [2019-12-18 13:06:29,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 13:06:29,171 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 13:06:29,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:29,210 INFO L225 Difference]: With dead ends: 30673 [2019-12-18 13:06:29,210 INFO L226 Difference]: Without dead ends: 28698 [2019-12-18 13:06:29,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2019-12-18 13:06:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28698 states. [2019-12-18 13:06:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28698 to 23272. [2019-12-18 13:06:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23272 states. [2019-12-18 13:06:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23272 states to 23272 states and 68478 transitions. [2019-12-18 13:06:29,597 INFO L78 Accepts]: Start accepts. Automaton has 23272 states and 68478 transitions. Word has length 66 [2019-12-18 13:06:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:29,598 INFO L462 AbstractCegarLoop]: Abstraction has 23272 states and 68478 transitions. [2019-12-18 13:06:29,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 13:06:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 23272 states and 68478 transitions. [2019-12-18 13:06:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:06:29,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:29,620 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] [2019-12-18 13:06:29,620 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1594558236, now seen corresponding path program 13 times [2019-12-18 13:06:29,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118122921] [2019-12-18 13:06:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:29,695 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-18 13:06:29,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118122921] [2019-12-18 13:06:29,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:29,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:29,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448075713] [2019-12-18 13:06:29,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:06:29,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:29,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:06:29,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:29,697 INFO L87 Difference]: Start difference. First operand 23272 states and 68478 transitions. Second operand 4 states. [2019-12-18 13:06:29,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:29,852 INFO L93 Difference]: Finished difference Result 25957 states and 76649 transitions. [2019-12-18 13:06:29,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:29,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:06:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:29,906 INFO L225 Difference]: With dead ends: 25957 [2019-12-18 13:06:29,906 INFO L226 Difference]: Without dead ends: 25957 [2019-12-18 13:06:29,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:06:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25957 states. [2019-12-18 13:06:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25957 to 21990. [2019-12-18 13:06:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21990 states. [2019-12-18 13:06:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21990 states to 21990 states and 65015 transitions. [2019-12-18 13:06:30,318 INFO L78 Accepts]: Start accepts. Automaton has 21990 states and 65015 transitions. Word has length 66 [2019-12-18 13:06:30,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:30,318 INFO L462 AbstractCegarLoop]: Abstraction has 21990 states and 65015 transitions. [2019-12-18 13:06:30,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:06:30,318 INFO L276 IsEmpty]: Start isEmpty. Operand 21990 states and 65015 transitions. [2019-12-18 13:06:30,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:30,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:30,339 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-18 13:06:30,339 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:30,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:30,340 INFO L82 PathProgramCache]: Analyzing trace with hash 248787667, now seen corresponding path program 1 times [2019-12-18 13:06:30,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:30,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508736209] [2019-12-18 13:06:30,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:31,134 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-18 13:06:31,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508736209] [2019-12-18 13:06:31,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 13:06:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952488393] [2019-12-18 13:06:31,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 13:06:31,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 13:06:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 13:06:31,136 INFO L87 Difference]: Start difference. First operand 21990 states and 65015 transitions. Second operand 18 states. [2019-12-18 13:06:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:36,615 INFO L93 Difference]: Finished difference Result 29235 states and 85327 transitions. [2019-12-18 13:06:36,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 13:06:36,616 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-18 13:06:36,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:36,655 INFO L225 Difference]: With dead ends: 29235 [2019-12-18 13:06:36,655 INFO L226 Difference]: Without dead ends: 28298 [2019-12-18 13:06:36,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=335, Invalid=1471, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 13:06:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28298 states. [2019-12-18 13:06:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28298 to 21894. [2019-12-18 13:06:37,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21894 states. [2019-12-18 13:06:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21894 states to 21894 states and 64755 transitions. [2019-12-18 13:06:37,177 INFO L78 Accepts]: Start accepts. Automaton has 21894 states and 64755 transitions. Word has length 67 [2019-12-18 13:06:37,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:37,177 INFO L462 AbstractCegarLoop]: Abstraction has 21894 states and 64755 transitions. [2019-12-18 13:06:37,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 13:06:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 21894 states and 64755 transitions. [2019-12-18 13:06:37,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:37,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:37,198 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-18 13:06:37,198 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:37,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1759012269, now seen corresponding path program 1 times [2019-12-18 13:06:37,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:37,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679963100] [2019-12-18 13:06:37,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:37,239 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-18 13:06:37,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679963100] [2019-12-18 13:06:37,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:37,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:06:37,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044334276] [2019-12-18 13:06:37,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:06:37,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:06:37,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:06:37,241 INFO L87 Difference]: Start difference. First operand 21894 states and 64755 transitions. Second operand 3 states. [2019-12-18 13:06:37,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:37,499 INFO L93 Difference]: Finished difference Result 30072 states and 89229 transitions. [2019-12-18 13:06:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:06:37,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 13:06:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:37,570 INFO L225 Difference]: With dead ends: 30072 [2019-12-18 13:06:37,570 INFO L226 Difference]: Without dead ends: 30072 [2019-12-18 13:06:37,570 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-18 13:06:37,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30072 states. [2019-12-18 13:06:38,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30072 to 22279. [2019-12-18 13:06:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22279 states. [2019-12-18 13:06:38,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22279 states to 22279 states and 66008 transitions. [2019-12-18 13:06:38,253 INFO L78 Accepts]: Start accepts. Automaton has 22279 states and 66008 transitions. Word has length 67 [2019-12-18 13:06:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:38,253 INFO L462 AbstractCegarLoop]: Abstraction has 22279 states and 66008 transitions. [2019-12-18 13:06:38,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:06:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22279 states and 66008 transitions. [2019-12-18 13:06:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:38,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:38,286 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-18 13:06:38,286 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:38,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:38,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1524318628, now seen corresponding path program 1 times [2019-12-18 13:06:38,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:38,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622889782] [2019-12-18 13:06:38,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:38,384 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-18 13:06:38,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622889782] [2019-12-18 13:06:38,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:38,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 13:06:38,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366475107] [2019-12-18 13:06:38,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 13:06:38,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:38,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 13:06:38,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:06:38,386 INFO L87 Difference]: Start difference. First operand 22279 states and 66008 transitions. Second operand 8 states. [2019-12-18 13:06:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:41,140 INFO L93 Difference]: Finished difference Result 39639 states and 115565 transitions. [2019-12-18 13:06:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 13:06:41,141 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 13:06:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:41,193 INFO L225 Difference]: With dead ends: 39639 [2019-12-18 13:06:41,193 INFO L226 Difference]: Without dead ends: 39639 [2019-12-18 13:06:41,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=946, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 13:06:41,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39639 states. [2019-12-18 13:06:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39639 to 21563. [2019-12-18 13:06:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21563 states. [2019-12-18 13:06:41,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21563 states to 21563 states and 64105 transitions. [2019-12-18 13:06:41,671 INFO L78 Accepts]: Start accepts. Automaton has 21563 states and 64105 transitions. Word has length 67 [2019-12-18 13:06:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:41,671 INFO L462 AbstractCegarLoop]: Abstraction has 21563 states and 64105 transitions. [2019-12-18 13:06:41,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 13:06:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 21563 states and 64105 transitions. [2019-12-18 13:06:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:41,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:41,694 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-18 13:06:41,694 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2013885398, now seen corresponding path program 2 times [2019-12-18 13:06:41,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:41,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835763636] [2019-12-18 13:06:41,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:42,686 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-18 13:06:42,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835763636] [2019-12-18 13:06:42,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:42,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 13:06:42,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360252244] [2019-12-18 13:06:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 13:06:42,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:42,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 13:06:42,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:06:42,688 INFO L87 Difference]: Start difference. First operand 21563 states and 64105 transitions. Second operand 19 states. [2019-12-18 13:06:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:48,924 INFO L93 Difference]: Finished difference Result 26590 states and 77934 transitions. [2019-12-18 13:06:48,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 13:06:48,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 13:06:48,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:48,961 INFO L225 Difference]: With dead ends: 26590 [2019-12-18 13:06:48,961 INFO L226 Difference]: Without dead ends: 25670 [2019-12-18 13:06:48,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 11 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=545, Invalid=2877, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 13:06:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25670 states. [2019-12-18 13:06:49,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25670 to 21667. [2019-12-18 13:06:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21667 states. [2019-12-18 13:06:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21667 states to 21667 states and 64367 transitions. [2019-12-18 13:06:49,317 INFO L78 Accepts]: Start accepts. Automaton has 21667 states and 64367 transitions. Word has length 67 [2019-12-18 13:06:49,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:49,317 INFO L462 AbstractCegarLoop]: Abstraction has 21667 states and 64367 transitions. [2019-12-18 13:06:49,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 13:06:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 21667 states and 64367 transitions. [2019-12-18 13:06:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:49,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:49,340 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-18 13:06:49,340 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2104277200, now seen corresponding path program 3 times [2019-12-18 13:06:49,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:49,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568518534] [2019-12-18 13:06:49,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:49,737 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-18 13:06:49,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568518534] [2019-12-18 13:06:49,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:49,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 13:06:49,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086393799] [2019-12-18 13:06:49,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 13:06:49,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 13:06:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:06:49,738 INFO L87 Difference]: Start difference. First operand 21667 states and 64367 transitions. Second operand 15 states. [2019-12-18 13:06:53,387 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-18 13:06:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:06:54,620 INFO L93 Difference]: Finished difference Result 31446 states and 91749 transitions. [2019-12-18 13:06:54,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 13:06:54,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 13:06:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:06:54,657 INFO L225 Difference]: With dead ends: 31446 [2019-12-18 13:06:54,657 INFO L226 Difference]: Without dead ends: 27069 [2019-12-18 13:06:54,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=424, Invalid=2126, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 13:06:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27069 states. [2019-12-18 13:06:54,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27069 to 21983. [2019-12-18 13:06:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21983 states. [2019-12-18 13:06:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21983 states to 21983 states and 65147 transitions. [2019-12-18 13:06:55,035 INFO L78 Accepts]: Start accepts. Automaton has 21983 states and 65147 transitions. Word has length 67 [2019-12-18 13:06:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:06:55,035 INFO L462 AbstractCegarLoop]: Abstraction has 21983 states and 65147 transitions. [2019-12-18 13:06:55,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 13:06:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21983 states and 65147 transitions. [2019-12-18 13:06:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:06:55,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:06:55,060 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-18 13:06:55,060 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:06:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:06:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1963880236, now seen corresponding path program 4 times [2019-12-18 13:06:55,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:06:55,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297084666] [2019-12-18 13:06:55,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:06:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:06:55,638 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-18 13:06:55,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297084666] [2019-12-18 13:06:55,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:06:55,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 13:06:55,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956941340] [2019-12-18 13:06:55,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 13:06:55,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:06:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 13:06:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:06:55,640 INFO L87 Difference]: Start difference. First operand 21983 states and 65147 transitions. Second operand 17 states. [2019-12-18 13:07:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:00,455 INFO L93 Difference]: Finished difference Result 27424 states and 80176 transitions. [2019-12-18 13:07:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 13:07:00,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 13:07:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:00,489 INFO L225 Difference]: With dead ends: 27424 [2019-12-18 13:07:00,489 INFO L226 Difference]: Without dead ends: 24790 [2019-12-18 13:07:00,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=385, Invalid=1777, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 13:07:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24790 states. [2019-12-18 13:07:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24790 to 22135. [2019-12-18 13:07:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22135 states. [2019-12-18 13:07:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22135 states to 22135 states and 65566 transitions. [2019-12-18 13:07:00,841 INFO L78 Accepts]: Start accepts. Automaton has 22135 states and 65566 transitions. Word has length 67 [2019-12-18 13:07:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:00,841 INFO L462 AbstractCegarLoop]: Abstraction has 22135 states and 65566 transitions. [2019-12-18 13:07:00,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 13:07:00,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22135 states and 65566 transitions. [2019-12-18 13:07:00,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:00,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:00,864 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-18 13:07:00,864 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:00,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:00,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1203608972, now seen corresponding path program 5 times [2019-12-18 13:07:00,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:00,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863776308] [2019-12-18 13:07:00,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:01,270 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-18 13:07:01,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863776308] [2019-12-18 13:07:01,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:01,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 13:07:01,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938250309] [2019-12-18 13:07:01,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 13:07:01,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:01,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 13:07:01,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-18 13:07:01,272 INFO L87 Difference]: Start difference. First operand 22135 states and 65566 transitions. Second operand 16 states. [2019-12-18 13:07:05,144 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-12-18 13:07:05,775 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-12-18 13:07:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:06,187 INFO L93 Difference]: Finished difference Result 32042 states and 93368 transitions. [2019-12-18 13:07:06,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 13:07:06,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 13:07:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:06,229 INFO L225 Difference]: With dead ends: 32042 [2019-12-18 13:07:06,230 INFO L226 Difference]: Without dead ends: 30252 [2019-12-18 13:07:06,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=559, Invalid=2093, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 13:07:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30252 states. [2019-12-18 13:07:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30252 to 22355. [2019-12-18 13:07:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22355 states. [2019-12-18 13:07:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22355 states to 22355 states and 66288 transitions. [2019-12-18 13:07:06,603 INFO L78 Accepts]: Start accepts. Automaton has 22355 states and 66288 transitions. Word has length 67 [2019-12-18 13:07:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:06,604 INFO L462 AbstractCegarLoop]: Abstraction has 22355 states and 66288 transitions. [2019-12-18 13:07:06,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 13:07:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 22355 states and 66288 transitions. [2019-12-18 13:07:06,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:06,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:06,624 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-18 13:07:06,625 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:06,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1260199424, now seen corresponding path program 6 times [2019-12-18 13:07:06,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:06,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22997827] [2019-12-18 13:07:06,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:07,241 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-18 13:07:07,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22997827] [2019-12-18 13:07:07,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:07,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 13:07:07,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023521969] [2019-12-18 13:07:07,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 13:07:07,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 13:07:07,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:07:07,243 INFO L87 Difference]: Start difference. First operand 22355 states and 66288 transitions. Second operand 19 states. [2019-12-18 13:07:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:12,390 INFO L93 Difference]: Finished difference Result 28951 states and 84560 transitions. [2019-12-18 13:07:12,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 13:07:12,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-18 13:07:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:12,432 INFO L225 Difference]: With dead ends: 28951 [2019-12-18 13:07:12,432 INFO L226 Difference]: Without dead ends: 27643 [2019-12-18 13:07:12,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=1752, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 13:07:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27643 states. [2019-12-18 13:07:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27643 to 22552. [2019-12-18 13:07:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22552 states. [2019-12-18 13:07:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22552 states to 22552 states and 66764 transitions. [2019-12-18 13:07:13,034 INFO L78 Accepts]: Start accepts. Automaton has 22552 states and 66764 transitions. Word has length 67 [2019-12-18 13:07:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:13,034 INFO L462 AbstractCegarLoop]: Abstraction has 22552 states and 66764 transitions. [2019-12-18 13:07:13,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 13:07:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 22552 states and 66764 transitions. [2019-12-18 13:07:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:13,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:13,058 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-18 13:07:13,058 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1104843346, now seen corresponding path program 7 times [2019-12-18 13:07:13,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:13,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996637509] [2019-12-18 13:07:13,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:14,382 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-18 13:07:14,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996637509] [2019-12-18 13:07:14,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:14,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 13:07:14,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760921479] [2019-12-18 13:07:14,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 13:07:14,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:14,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 13:07:14,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-12-18 13:07:14,384 INFO L87 Difference]: Start difference. First operand 22552 states and 66764 transitions. Second operand 23 states. [2019-12-18 13:07:20,094 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-12-18 13:07:21,372 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 40 [2019-12-18 13:07:23,003 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-18 13:07:23,649 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-18 13:07:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:24,827 INFO L93 Difference]: Finished difference Result 31867 states and 93020 transitions. [2019-12-18 13:07:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 13:07:24,827 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2019-12-18 13:07:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:24,872 INFO L225 Difference]: With dead ends: 31867 [2019-12-18 13:07:24,872 INFO L226 Difference]: Without dead ends: 31682 [2019-12-18 13:07:24,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=528, Invalid=3632, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 13:07:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31682 states. [2019-12-18 13:07:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31682 to 22564. [2019-12-18 13:07:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22564 states. [2019-12-18 13:07:25,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22564 states to 22564 states and 66794 transitions. [2019-12-18 13:07:25,502 INFO L78 Accepts]: Start accepts. Automaton has 22564 states and 66794 transitions. Word has length 67 [2019-12-18 13:07:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:25,502 INFO L462 AbstractCegarLoop]: Abstraction has 22564 states and 66794 transitions. [2019-12-18 13:07:25,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 13:07:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 22564 states and 66794 transitions. [2019-12-18 13:07:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:25,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:25,526 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-18 13:07:25,526 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:25,526 INFO L82 PathProgramCache]: Analyzing trace with hash 33955710, now seen corresponding path program 8 times [2019-12-18 13:07:25,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:25,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723568587] [2019-12-18 13:07:25,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:26,481 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-18 13:07:26,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723568587] [2019-12-18 13:07:26,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:26,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 13:07:26,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964864968] [2019-12-18 13:07:26,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 13:07:26,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:26,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 13:07:26,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:07:26,487 INFO L87 Difference]: Start difference. First operand 22564 states and 66794 transitions. Second operand 21 states. [2019-12-18 13:07:29,745 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 13:07:30,338 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 13:07:31,274 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-18 13:07:31,923 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 13:07:32,157 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-18 13:07:33,076 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 13:07:38,599 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-12-18 13:07:40,435 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-12-18 13:07:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:07:44,760 INFO L93 Difference]: Finished difference Result 46963 states and 140295 transitions. [2019-12-18 13:07:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-18 13:07:44,760 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2019-12-18 13:07:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:07:44,821 INFO L225 Difference]: With dead ends: 46963 [2019-12-18 13:07:44,822 INFO L226 Difference]: Without dead ends: 44103 [2019-12-18 13:07:44,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3561 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1573, Invalid=9347, Unknown=0, NotChecked=0, Total=10920 [2019-12-18 13:07:44,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44103 states. [2019-12-18 13:07:45,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44103 to 23786. [2019-12-18 13:07:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23786 states. [2019-12-18 13:07:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23786 states to 23786 states and 70407 transitions. [2019-12-18 13:07:45,329 INFO L78 Accepts]: Start accepts. Automaton has 23786 states and 70407 transitions. Word has length 67 [2019-12-18 13:07:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:07:45,329 INFO L462 AbstractCegarLoop]: Abstraction has 23786 states and 70407 transitions. [2019-12-18 13:07:45,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 13:07:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23786 states and 70407 transitions. [2019-12-18 13:07:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:07:45,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:07:45,354 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-18 13:07:45,354 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:07:45,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:07:45,354 INFO L82 PathProgramCache]: Analyzing trace with hash -114710396, now seen corresponding path program 9 times [2019-12-18 13:07:45,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:07:45,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601891785] [2019-12-18 13:07:45,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:07:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:07:46,305 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-18 13:07:46,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601891785] [2019-12-18 13:07:46,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:07:46,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 13:07:46,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366014049] [2019-12-18 13:07:46,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 13:07:46,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:07:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 13:07:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-12-18 13:07:46,307 INFO L87 Difference]: Start difference. First operand 23786 states and 70407 transitions. Second operand 21 states. [2019-12-18 13:07:49,023 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 13:07:49,545 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-12-18 13:07:50,094 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-12-18 13:07:50,392 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-12-18 13:07:50,545 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-12-18 13:07:51,103 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-12-18 13:07:51,336 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-12-18 13:07:52,178 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 Received shutdown request... [2019-12-18 13:07:57,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-18 13:07:57,501 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 13:07:57,506 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 13:07:57,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:07:57 BasicIcfg [2019-12-18 13:07:57,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:07:57,508 INFO L168 Benchmark]: Toolchain (without parser) took 224560.49 ms. Allocated memory was 146.8 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 103.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,508 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 913.78 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 156.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,509 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,509 INFO L168 Benchmark]: Boogie Preprocessor took 38.86 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,510 INFO L168 Benchmark]: RCFGBuilder took 894.71 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 100.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,510 INFO L168 Benchmark]: TraceAbstraction took 222644.62 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:07:57,512 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 913.78 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 103.1 MB in the beginning and 156.4 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.74 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.86 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 894.71 ms. Allocated memory is still 204.5 MB. Free memory was 151.1 MB in the beginning and 100.9 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 222644.62 ms. Allocated memory was 204.5 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 175 ProgramPointsBefore, 93 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 32 ChoiceCompositions, 6798 VarBasedMoverChecksPositive, 289 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 285 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87070 CheckedPairsTotal, 113 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (23786states) and FLOYD_HOARE automaton (currently 70 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (18683 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (23786states) and FLOYD_HOARE automaton (currently 70 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (18683 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: TIMEOUT, OverallTime: 222.4s, OverallIterations: 46, TraceHistogramMax: 1, AutomataDifference: 131.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12684 SDtfs, 21077 SDslu, 54007 SDs, 0 SdLazy, 75961 SolverSat, 1843 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 71.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 98 SyntacticMatches, 53 SemanticMatches, 1136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15192 ImplicationChecksByTransitivity, 40.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151934occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.9s AutomataMinimizationTime, 45 MinimizatonAttempts, 457297 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2244 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2198 ConstructedInterpolants, 0 QuantifiedInterpolants, 992885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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 could not prove your program: Timeout Completed graceful shutdown