/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/rfi002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:06:45,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:06:45,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:06:45,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:06:45,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:06:45,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:06:45,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:06:45,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:06:45,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:06:45,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:06:45,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:06:45,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:06:45,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:06:45,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:06:45,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:06:45,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:06:45,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:06:45,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:06:45,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:06:45,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:06:45,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:06:45,687 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:06:45,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:06:45,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:06:45,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:06:45,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:06:45,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:06:45,698 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:06:45,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:06:45,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:06:45,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:06:45,702 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:06:45,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:06:45,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:06:45,705 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:06:45,705 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:06:45,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:06:45,706 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:06:45,706 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:06:45,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:06:45,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:06:45,711 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 14:06:45,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:06:45,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:06:45,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:06:45,743 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:06:45,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:06:45,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:06:45,747 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:06:45,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:06:45,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:06:45,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:06:45,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:06:45,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:06:45,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:45,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:06:45,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:06:45,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:06:45,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:06:45,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:06:45,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:06:45,754 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:06:45,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:06:46,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:06:46,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:06:46,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:06:46,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:06:46,063 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:06:46,063 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.oepc.i [2019-12-18 14:06:46,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7780456/7882e90c19e2499993590f912d3df318/FLAG76493f4e4 [2019-12-18 14:06:46,680 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:06:46,681 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.oepc.i [2019-12-18 14:06:46,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7780456/7882e90c19e2499993590f912d3df318/FLAG76493f4e4 [2019-12-18 14:06:46,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c7780456/7882e90c19e2499993590f912d3df318 [2019-12-18 14:06:46,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:06:46,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:06:46,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:46,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:06:46,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:06:46,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:46" (1/1) ... [2019-12-18 14:06:46,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189aaca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:46, skipping insertion in model container [2019-12-18 14:06:46,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:46" (1/1) ... [2019-12-18 14:06:46,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:06:47,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:06:47,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:47,625 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:06:47,716 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:47,800 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:06:47,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47 WrapperNode [2019-12-18 14:06:47,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:47,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:47,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:06:47,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:06:47,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,871 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:47,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:06:47,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:06:47,872 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:06:47,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (1/1) ... [2019-12-18 14:06:47,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:06:47,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:06:47,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:06:47,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:06:47,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (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 14:06:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:06:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:06:48,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:06:48,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:06:48,026 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:06:48,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:06:48,027 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:06:48,028 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:06:48,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:06:48,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:06:48,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:06:48,032 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 14:06:49,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:06:49,203 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:06:49,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:49 BoogieIcfgContainer [2019-12-18 14:06:49,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:06:49,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:06:49,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:06:49,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:06:49,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:06:46" (1/3) ... [2019-12-18 14:06:49,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d5673e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:49, skipping insertion in model container [2019-12-18 14:06:49,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:47" (2/3) ... [2019-12-18 14:06:49,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d5673e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:49, skipping insertion in model container [2019-12-18 14:06:49,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:49" (3/3) ... [2019-12-18 14:06:49,213 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.oepc.i [2019-12-18 14:06:49,224 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:06:49,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:06:49,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:06:49,233 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:06:49,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,328 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,329 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,330 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,331 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,332 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,333 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,334 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,335 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,336 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,337 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,338 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:49,386 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:06:49,407 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:06:49,408 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:06:49,408 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:06:49,408 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:06:49,408 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:06:49,408 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:06:49,408 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:06:49,408 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:06:49,428 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 14:06:49,430 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:49,624 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:49,625 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:49,688 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:49,793 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:49,900 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:49,900 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:49,923 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:49,973 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 14:06:49,974 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:06:57,575 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:06:57,687 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:06:57,833 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 14:06:57,833 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 14:06:57,836 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 14:07:12,464 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 14:07:12,466 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 14:07:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:07:12,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:12,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:07:12,474 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 14:07:12,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:12,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519813200] [2019-12-18 14:07:12,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:12,729 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 14:07:12,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519813200] [2019-12-18 14:07:12,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:12,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:07:12,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156344546] [2019-12-18 14:07:12,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:07:12,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:12,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:07:12,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:07:12,764 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 14:07:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:14,171 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 14:07:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:07:14,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:07:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:14,838 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 14:07:14,838 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 14:07:14,839 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 14:07:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 14:07:25,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 14:07:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 14:07:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 14:07:26,047 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 14:07:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:26,048 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 14:07:26,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:07:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 14:07:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:26,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:26,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:26,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:26,051 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 14:07:26,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:26,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442032850] [2019-12-18 14:07:26,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:26,129 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 14:07:26,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442032850] [2019-12-18 14:07:26,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:26,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:26,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657580428] [2019-12-18 14:07:26,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:26,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:26,132 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 14:07:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:31,420 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 14:07:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:31,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:31,940 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 14:07:31,940 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 14:07:31,941 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 14:07:37,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 14:07:43,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 14:07:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 14:07:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 14:07:43,703 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 14:07:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:43,703 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 14:07:43,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 14:07:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:43,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:43,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:43,706 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:43,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 14:07:43,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:43,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36789088] [2019-12-18 14:07:43,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:43,790 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 14:07:43,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36789088] [2019-12-18 14:07:43,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:43,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:43,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399798891] [2019-12-18 14:07:43,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:43,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:43,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:43,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:43,794 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 14:07:45,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:45,026 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 14:07:45,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:45,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:45,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:51,358 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 14:07:51,359 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 14:07:51,359 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 14:07:56,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 14:07:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 14:07:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 14:07:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 14:07:59,968 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 14:07:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:59,968 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 14:07:59,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 14:07:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:07:59,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:59,974 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:59,975 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 14:07:59,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:59,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790452020] [2019-12-18 14:07:59,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:00,108 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 14:08:00,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790452020] [2019-12-18 14:08:00,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:00,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:00,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868132426] [2019-12-18 14:08:00,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:08:00,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:08:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:08:00,110 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 4 states. [2019-12-18 14:08:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:00,200 INFO L93 Difference]: Finished difference Result 11993 states and 33125 transitions. [2019-12-18 14:08:00,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:08:00,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:08:00,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:00,214 INFO L225 Difference]: With dead ends: 11993 [2019-12-18 14:08:00,214 INFO L226 Difference]: Without dead ends: 8737 [2019-12-18 14:08:00,215 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 14:08:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8737 states. [2019-12-18 14:08:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8737 to 8729. [2019-12-18 14:08:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8729 states. [2019-12-18 14:08:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8729 states to 8729 states and 21886 transitions. [2019-12-18 14:08:00,372 INFO L78 Accepts]: Start accepts. Automaton has 8729 states and 21886 transitions. Word has length 17 [2019-12-18 14:08:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:00,372 INFO L462 AbstractCegarLoop]: Abstraction has 8729 states and 21886 transitions. [2019-12-18 14:08:00,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:08:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8729 states and 21886 transitions. [2019-12-18 14:08:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:08:00,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:00,374 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 14:08:00,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:00,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:00,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 14:08:00,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:00,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307658717] [2019-12-18 14:08:00,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:00,545 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 14:08:00,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307658717] [2019-12-18 14:08:00,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:00,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:00,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858298315] [2019-12-18 14:08:00,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:00,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:00,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:00,547 INFO L87 Difference]: Start difference. First operand 8729 states and 21886 transitions. Second operand 6 states. [2019-12-18 14:08:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:01,671 INFO L93 Difference]: Finished difference Result 10286 states and 25434 transitions. [2019-12-18 14:08:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:08:01,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 14:08:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:01,682 INFO L225 Difference]: With dead ends: 10286 [2019-12-18 14:08:01,682 INFO L226 Difference]: Without dead ends: 10286 [2019-12-18 14:08:01,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10286 states. [2019-12-18 14:08:01,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 10191. [2019-12-18 14:08:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10191 states. [2019-12-18 14:08:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10191 states to 10191 states and 25249 transitions. [2019-12-18 14:08:01,840 INFO L78 Accepts]: Start accepts. Automaton has 10191 states and 25249 transitions. Word has length 25 [2019-12-18 14:08:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:01,842 INFO L462 AbstractCegarLoop]: Abstraction has 10191 states and 25249 transitions. [2019-12-18 14:08:01,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10191 states and 25249 transitions. [2019-12-18 14:08:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 14:08:01,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:01,854 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] [2019-12-18 14:08:01,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:01,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:01,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 14:08:01,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:01,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282727612] [2019-12-18 14:08:01,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:01,983 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 14:08:01,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282727612] [2019-12-18 14:08:01,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:01,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:01,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872880936] [2019-12-18 14:08:01,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:01,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:01,986 INFO L87 Difference]: Start difference. First operand 10191 states and 25249 transitions. Second operand 6 states. [2019-12-18 14:08:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:02,971 INFO L93 Difference]: Finished difference Result 11186 states and 27316 transitions. [2019-12-18 14:08:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:02,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 14:08:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:02,984 INFO L225 Difference]: With dead ends: 11186 [2019-12-18 14:08:02,984 INFO L226 Difference]: Without dead ends: 11138 [2019-12-18 14:08:02,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-18 14:08:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10951. [2019-12-18 14:08:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10951 states. [2019-12-18 14:08:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 26866 transitions. [2019-12-18 14:08:03,180 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 26866 transitions. Word has length 38 [2019-12-18 14:08:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:03,181 INFO L462 AbstractCegarLoop]: Abstraction has 10951 states and 26866 transitions. [2019-12-18 14:08:03,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 26866 transitions. [2019-12-18 14:08:03,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:08:03,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:03,193 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] [2019-12-18 14:08:03,194 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:03,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:03,194 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 14:08:03,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:03,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187396931] [2019-12-18 14:08:03,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:03,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187396931] [2019-12-18 14:08:03,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:03,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:03,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069979065] [2019-12-18 14:08:03,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:03,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:03,313 INFO L87 Difference]: Start difference. First operand 10951 states and 26866 transitions. Second operand 5 states. [2019-12-18 14:08:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:03,366 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-18 14:08:03,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:08:03,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-18 14:08:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:03,372 INFO L225 Difference]: With dead ends: 4762 [2019-12-18 14:08:03,372 INFO L226 Difference]: Without dead ends: 4575 [2019-12-18 14:08:03,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-18 14:08:03,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-18 14:08:03,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-18 14:08:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-18 14:08:03,433 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-18 14:08:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:03,434 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-18 14:08:03,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-18 14:08:03,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:03,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:03,443 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:03,443 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 14:08:03,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:03,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357192816] [2019-12-18 14:08:03,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:03,636 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 14:08:03,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357192816] [2019-12-18 14:08:03,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:03,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:03,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746891212] [2019-12-18 14:08:03,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:03,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:03,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:03,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:03,638 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 6 states. [2019-12-18 14:08:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:04,497 INFO L93 Difference]: Finished difference Result 6100 states and 14382 transitions. [2019-12-18 14:08:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:08:04,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:04,506 INFO L225 Difference]: With dead ends: 6100 [2019-12-18 14:08:04,506 INFO L226 Difference]: Without dead ends: 6100 [2019-12-18 14:08:04,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:04,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-12-18 14:08:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5765. [2019-12-18 14:08:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-18 14:08:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 13657 transitions. [2019-12-18 14:08:04,571 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 13657 transitions. Word has length 94 [2019-12-18 14:08:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:04,572 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 13657 transitions. [2019-12-18 14:08:04,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 13657 transitions. [2019-12-18 14:08:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:04,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:04,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:04,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:04,585 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 14:08:04,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:04,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979269300] [2019-12-18 14:08:04,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:04,742 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 14:08:04,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979269300] [2019-12-18 14:08:04,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:04,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:04,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107506044] [2019-12-18 14:08:04,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:04,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:04,750 INFO L87 Difference]: Start difference. First operand 5765 states and 13657 transitions. Second operand 7 states. [2019-12-18 14:08:05,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:05,647 INFO L93 Difference]: Finished difference Result 6939 states and 16285 transitions. [2019-12-18 14:08:05,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:08:05,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:05,657 INFO L225 Difference]: With dead ends: 6939 [2019-12-18 14:08:05,657 INFO L226 Difference]: Without dead ends: 6939 [2019-12-18 14:08:05,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2019-12-18 14:08:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 6214. [2019-12-18 14:08:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-12-18 14:08:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 14677 transitions. [2019-12-18 14:08:05,726 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 14677 transitions. Word has length 94 [2019-12-18 14:08:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:05,726 INFO L462 AbstractCegarLoop]: Abstraction has 6214 states and 14677 transitions. [2019-12-18 14:08:05,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:05,726 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 14677 transitions. [2019-12-18 14:08:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:05,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:05,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:05,734 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:05,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 14:08:05,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:05,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781346084] [2019-12-18 14:08:05,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:05,844 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 14:08:05,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781346084] [2019-12-18 14:08:05,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:05,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:05,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127681057] [2019-12-18 14:08:05,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:05,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:05,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:05,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:05,846 INFO L87 Difference]: Start difference. First operand 6214 states and 14677 transitions. Second operand 5 states. [2019-12-18 14:08:06,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:06,426 INFO L93 Difference]: Finished difference Result 6709 states and 15705 transitions. [2019-12-18 14:08:06,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:06,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 14:08:06,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:06,435 INFO L225 Difference]: With dead ends: 6709 [2019-12-18 14:08:06,435 INFO L226 Difference]: Without dead ends: 6709 [2019-12-18 14:08:06,435 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 14:08:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-12-18 14:08:06,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 6274. [2019-12-18 14:08:06,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-12-18 14:08:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 14825 transitions. [2019-12-18 14:08:06,503 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 14825 transitions. Word has length 94 [2019-12-18 14:08:06,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:06,503 INFO L462 AbstractCegarLoop]: Abstraction has 6274 states and 14825 transitions. [2019-12-18 14:08:06,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 14825 transitions. [2019-12-18 14:08:06,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:06,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:06,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:06,512 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 14:08:06,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:06,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084750340] [2019-12-18 14:08:06,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:06,651 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 14:08:06,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084750340] [2019-12-18 14:08:06,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:06,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:06,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988082212] [2019-12-18 14:08:06,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:06,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:06,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:06,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:06,654 INFO L87 Difference]: Start difference. First operand 6274 states and 14825 transitions. Second operand 6 states. [2019-12-18 14:08:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:07,361 INFO L93 Difference]: Finished difference Result 6942 states and 16188 transitions. [2019-12-18 14:08:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:07,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:07,371 INFO L225 Difference]: With dead ends: 6942 [2019-12-18 14:08:07,371 INFO L226 Difference]: Without dead ends: 6942 [2019-12-18 14:08:07,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2019-12-18 14:08:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6667. [2019-12-18 14:08:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6667 states. [2019-12-18 14:08:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 15654 transitions. [2019-12-18 14:08:07,447 INFO L78 Accepts]: Start accepts. Automaton has 6667 states and 15654 transitions. Word has length 94 [2019-12-18 14:08:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:07,448 INFO L462 AbstractCegarLoop]: Abstraction has 6667 states and 15654 transitions. [2019-12-18 14:08:07,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 15654 transitions. [2019-12-18 14:08:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:07,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:07,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:07,456 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:07,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:07,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-18 14:08:07,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:07,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302014664] [2019-12-18 14:08:07,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:07,582 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 14:08:07,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302014664] [2019-12-18 14:08:07,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:07,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:07,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409167459] [2019-12-18 14:08:07,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:07,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:07,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:07,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:07,584 INFO L87 Difference]: Start difference. First operand 6667 states and 15654 transitions. Second operand 7 states. [2019-12-18 14:08:08,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:08,624 INFO L93 Difference]: Finished difference Result 19108 states and 45320 transitions. [2019-12-18 14:08:08,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:08,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:08,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:08,653 INFO L225 Difference]: With dead ends: 19108 [2019-12-18 14:08:08,654 INFO L226 Difference]: Without dead ends: 19108 [2019-12-18 14:08:08,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2019-12-18 14:08:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 7145. [2019-12-18 14:08:08,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 14:08:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 16896 transitions. [2019-12-18 14:08:08,956 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 16896 transitions. Word has length 94 [2019-12-18 14:08:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:08,956 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 16896 transitions. [2019-12-18 14:08:08,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 16896 transitions. [2019-12-18 14:08:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:08,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:08,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:08,966 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1832696303, now seen corresponding path program 6 times [2019-12-18 14:08:08,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:08,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931674325] [2019-12-18 14:08:08,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:09,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931674325] [2019-12-18 14:08:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:09,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:09,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209362963] [2019-12-18 14:08:09,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:09,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:09,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:09,072 INFO L87 Difference]: Start difference. First operand 7145 states and 16896 transitions. Second operand 6 states. [2019-12-18 14:08:09,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:09,964 INFO L93 Difference]: Finished difference Result 11949 states and 27558 transitions. [2019-12-18 14:08:09,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:08:09,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:09,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:09,980 INFO L225 Difference]: With dead ends: 11949 [2019-12-18 14:08:09,980 INFO L226 Difference]: Without dead ends: 11949 [2019-12-18 14:08:09,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:10,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11949 states. [2019-12-18 14:08:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11949 to 9005. [2019-12-18 14:08:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-12-18 14:08:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 21437 transitions. [2019-12-18 14:08:10,147 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 21437 transitions. Word has length 94 [2019-12-18 14:08:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:10,147 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 21437 transitions. [2019-12-18 14:08:10,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 21437 transitions. [2019-12-18 14:08:10,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:10,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:10,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:10,163 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:10,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 7 times [2019-12-18 14:08:10,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:10,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204303714] [2019-12-18 14:08:10,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:10,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 14:08:10,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204303714] [2019-12-18 14:08:10,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:10,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:10,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133090626] [2019-12-18 14:08:10,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:10,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:10,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:10,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:10,265 INFO L87 Difference]: Start difference. First operand 9005 states and 21437 transitions. Second operand 6 states. [2019-12-18 14:08:10,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:10,872 INFO L93 Difference]: Finished difference Result 9532 states and 22489 transitions. [2019-12-18 14:08:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:10,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:10,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:10,885 INFO L225 Difference]: With dead ends: 9532 [2019-12-18 14:08:10,885 INFO L226 Difference]: Without dead ends: 9532 [2019-12-18 14:08:10,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9532 states. [2019-12-18 14:08:10,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9532 to 9188. [2019-12-18 14:08:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2019-12-18 14:08:10,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 21829 transitions. [2019-12-18 14:08:10,987 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 21829 transitions. Word has length 94 [2019-12-18 14:08:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:10,987 INFO L462 AbstractCegarLoop]: Abstraction has 9188 states and 21829 transitions. [2019-12-18 14:08:10,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:10,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 21829 transitions. [2019-12-18 14:08:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:10,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:11,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:11,000 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2023312549, now seen corresponding path program 8 times [2019-12-18 14:08:11,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:11,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834833618] [2019-12-18 14:08:11,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:11,127 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 14:08:11,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834833618] [2019-12-18 14:08:11,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:11,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:11,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951089218] [2019-12-18 14:08:11,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:11,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:11,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:11,129 INFO L87 Difference]: Start difference. First operand 9188 states and 21829 transitions. Second operand 7 states. [2019-12-18 14:08:12,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:12,350 INFO L93 Difference]: Finished difference Result 12102 states and 27887 transitions. [2019-12-18 14:08:12,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:12,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:12,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:12,369 INFO L225 Difference]: With dead ends: 12102 [2019-12-18 14:08:12,369 INFO L226 Difference]: Without dead ends: 12102 [2019-12-18 14:08:12,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2019-12-18 14:08:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 9028. [2019-12-18 14:08:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2019-12-18 14:08:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 21469 transitions. [2019-12-18 14:08:12,564 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 21469 transitions. Word has length 94 [2019-12-18 14:08:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:12,565 INFO L462 AbstractCegarLoop]: Abstraction has 9028 states and 21469 transitions. [2019-12-18 14:08:12,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 21469 transitions. [2019-12-18 14:08:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:12,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:12,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:12,577 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:12,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:12,577 INFO L82 PathProgramCache]: Analyzing trace with hash -171487305, now seen corresponding path program 9 times [2019-12-18 14:08:12,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:12,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281281809] [2019-12-18 14:08:12,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:12,699 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 14:08:12,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281281809] [2019-12-18 14:08:12,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:12,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:12,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273581402] [2019-12-18 14:08:12,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:12,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:12,704 INFO L87 Difference]: Start difference. First operand 9028 states and 21469 transitions. Second operand 7 states. [2019-12-18 14:08:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:13,526 INFO L93 Difference]: Finished difference Result 12880 states and 30135 transitions. [2019-12-18 14:08:13,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:08:13,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:13,543 INFO L225 Difference]: With dead ends: 12880 [2019-12-18 14:08:13,543 INFO L226 Difference]: Without dead ends: 12880 [2019-12-18 14:08:13,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12880 states. [2019-12-18 14:08:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12880 to 9115. [2019-12-18 14:08:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9115 states. [2019-12-18 14:08:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9115 states to 9115 states and 21679 transitions. [2019-12-18 14:08:13,669 INFO L78 Accepts]: Start accepts. Automaton has 9115 states and 21679 transitions. Word has length 94 [2019-12-18 14:08:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:13,669 INFO L462 AbstractCegarLoop]: Abstraction has 9115 states and 21679 transitions. [2019-12-18 14:08:13,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9115 states and 21679 transitions. [2019-12-18 14:08:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:13,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:13,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:13,679 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 340897079, now seen corresponding path program 10 times [2019-12-18 14:08:13,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:13,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209761339] [2019-12-18 14:08:13,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:13,798 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 14:08:13,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209761339] [2019-12-18 14:08:13,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:13,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:13,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557350084] [2019-12-18 14:08:13,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:13,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:13,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:13,800 INFO L87 Difference]: Start difference. First operand 9115 states and 21679 transitions. Second operand 7 states. [2019-12-18 14:08:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:14,803 INFO L93 Difference]: Finished difference Result 12268 states and 28683 transitions. [2019-12-18 14:08:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:08:14,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:14,818 INFO L225 Difference]: With dead ends: 12268 [2019-12-18 14:08:14,818 INFO L226 Difference]: Without dead ends: 12268 [2019-12-18 14:08:14,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12268 states. [2019-12-18 14:08:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12268 to 9061. [2019-12-18 14:08:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9061 states. [2019-12-18 14:08:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9061 states to 9061 states and 21556 transitions. [2019-12-18 14:08:14,925 INFO L78 Accepts]: Start accepts. Automaton has 9061 states and 21556 transitions. Word has length 94 [2019-12-18 14:08:14,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:14,925 INFO L462 AbstractCegarLoop]: Abstraction has 9061 states and 21556 transitions. [2019-12-18 14:08:14,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 9061 states and 21556 transitions. [2019-12-18 14:08:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:14,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:14,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:14,933 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-18 14:08:14,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:14,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34756749] [2019-12-18 14:08:14,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:15,046 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 14:08:15,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34756749] [2019-12-18 14:08:15,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:15,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:15,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19273483] [2019-12-18 14:08:15,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:15,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:15,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:15,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:15,049 INFO L87 Difference]: Start difference. First operand 9061 states and 21556 transitions. Second operand 7 states. [2019-12-18 14:08:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:15,757 INFO L93 Difference]: Finished difference Result 10362 states and 24279 transitions. [2019-12-18 14:08:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:15,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 14:08:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:15,769 INFO L225 Difference]: With dead ends: 10362 [2019-12-18 14:08:15,769 INFO L226 Difference]: Without dead ends: 10362 [2019-12-18 14:08:15,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10362 states. [2019-12-18 14:08:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10362 to 9136. [2019-12-18 14:08:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9136 states. [2019-12-18 14:08:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9136 states to 9136 states and 21739 transitions. [2019-12-18 14:08:16,049 INFO L78 Accepts]: Start accepts. Automaton has 9136 states and 21739 transitions. Word has length 95 [2019-12-18 14:08:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:16,049 INFO L462 AbstractCegarLoop]: Abstraction has 9136 states and 21739 transitions. [2019-12-18 14:08:16,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9136 states and 21739 transitions. [2019-12-18 14:08:16,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:16,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:16,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, 1, 1, 1, 1, 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 14:08:16,058 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:16,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1018864798, now seen corresponding path program 2 times [2019-12-18 14:08:16,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:16,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385685455] [2019-12-18 14:08:16,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:16,164 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 14:08:16,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385685455] [2019-12-18 14:08:16,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:16,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:16,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339306196] [2019-12-18 14:08:16,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:16,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:16,166 INFO L87 Difference]: Start difference. First operand 9136 states and 21739 transitions. Second operand 7 states. [2019-12-18 14:08:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:16,989 INFO L93 Difference]: Finished difference Result 10297 states and 24119 transitions. [2019-12-18 14:08:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:08:16,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 14:08:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:17,003 INFO L225 Difference]: With dead ends: 10297 [2019-12-18 14:08:17,003 INFO L226 Difference]: Without dead ends: 10297 [2019-12-18 14:08:17,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10297 states. [2019-12-18 14:08:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10297 to 9094. [2019-12-18 14:08:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9094 states. [2019-12-18 14:08:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9094 states to 9094 states and 21643 transitions. [2019-12-18 14:08:17,116 INFO L78 Accepts]: Start accepts. Automaton has 9094 states and 21643 transitions. Word has length 95 [2019-12-18 14:08:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:17,116 INFO L462 AbstractCegarLoop]: Abstraction has 9094 states and 21643 transitions. [2019-12-18 14:08:17,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 9094 states and 21643 transitions. [2019-12-18 14:08:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:17,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:17,129 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:17,129 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 3 times [2019-12-18 14:08:17,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:17,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252341051] [2019-12-18 14:08:17,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:17,470 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 14:08:17,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252341051] [2019-12-18 14:08:17,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:17,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:17,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876282151] [2019-12-18 14:08:17,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:08:17,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:17,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:08:17,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:17,472 INFO L87 Difference]: Start difference. First operand 9094 states and 21643 transitions. Second operand 9 states. [2019-12-18 14:08:19,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:19,056 INFO L93 Difference]: Finished difference Result 14751 states and 35008 transitions. [2019-12-18 14:08:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:08:19,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-18 14:08:19,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:19,074 INFO L225 Difference]: With dead ends: 14751 [2019-12-18 14:08:19,074 INFO L226 Difference]: Without dead ends: 14751 [2019-12-18 14:08:19,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:08:19,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14751 states. [2019-12-18 14:08:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14751 to 10485. [2019-12-18 14:08:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10485 states. [2019-12-18 14:08:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10485 states to 10485 states and 25104 transitions. [2019-12-18 14:08:19,209 INFO L78 Accepts]: Start accepts. Automaton has 10485 states and 25104 transitions. Word has length 95 [2019-12-18 14:08:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:19,209 INFO L462 AbstractCegarLoop]: Abstraction has 10485 states and 25104 transitions. [2019-12-18 14:08:19,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:08:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10485 states and 25104 transitions. [2019-12-18 14:08:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:19,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:19,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:19,221 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:19,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-18 14:08:19,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:19,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842956654] [2019-12-18 14:08:19,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:19,455 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 14:08:19,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842956654] [2019-12-18 14:08:19,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:19,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:19,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865529170] [2019-12-18 14:08:19,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:08:19,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:08:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:19,457 INFO L87 Difference]: Start difference. First operand 10485 states and 25104 transitions. Second operand 11 states. [2019-12-18 14:08:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:20,935 INFO L93 Difference]: Finished difference Result 22104 states and 52809 transitions. [2019-12-18 14:08:20,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 14:08:20,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:08:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:20,959 INFO L225 Difference]: With dead ends: 22104 [2019-12-18 14:08:20,959 INFO L226 Difference]: Without dead ends: 17148 [2019-12-18 14:08:20,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:08:20,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17148 states. [2019-12-18 14:08:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17148 to 14424. [2019-12-18 14:08:21,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14424 states. [2019-12-18 14:08:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14424 states to 14424 states and 35256 transitions. [2019-12-18 14:08:21,137 INFO L78 Accepts]: Start accepts. Automaton has 14424 states and 35256 transitions. Word has length 96 [2019-12-18 14:08:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:21,138 INFO L462 AbstractCegarLoop]: Abstraction has 14424 states and 35256 transitions. [2019-12-18 14:08:21,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:08:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14424 states and 35256 transitions. [2019-12-18 14:08:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:21,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:21,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:21,155 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:21,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-18 14:08:21,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:21,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078775619] [2019-12-18 14:08:21,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:21,391 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 14:08:21,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078775619] [2019-12-18 14:08:21,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:21,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:08:21,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837856075] [2019-12-18 14:08:21,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:08:21,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:21,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:08:21,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:08:21,393 INFO L87 Difference]: Start difference. First operand 14424 states and 35256 transitions. Second operand 13 states. [2019-12-18 14:08:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:23,095 INFO L93 Difference]: Finished difference Result 19672 states and 47082 transitions. [2019-12-18 14:08:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 14:08:23,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 14:08:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:23,117 INFO L225 Difference]: With dead ends: 19672 [2019-12-18 14:08:23,118 INFO L226 Difference]: Without dead ends: 18225 [2019-12-18 14:08:23,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 14:08:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18225 states. [2019-12-18 14:08:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18225 to 14756. [2019-12-18 14:08:23,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14756 states. [2019-12-18 14:08:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14756 states to 14756 states and 36048 transitions. [2019-12-18 14:08:23,305 INFO L78 Accepts]: Start accepts. Automaton has 14756 states and 36048 transitions. Word has length 96 [2019-12-18 14:08:23,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:23,305 INFO L462 AbstractCegarLoop]: Abstraction has 14756 states and 36048 transitions. [2019-12-18 14:08:23,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:08:23,305 INFO L276 IsEmpty]: Start isEmpty. Operand 14756 states and 36048 transitions. [2019-12-18 14:08:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:23,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:23,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:23,543 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:23,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-18 14:08:23,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:23,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058572252] [2019-12-18 14:08:23,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:23,653 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 14:08:23,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058572252] [2019-12-18 14:08:23,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:23,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:23,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739485832] [2019-12-18 14:08:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:23,660 INFO L87 Difference]: Start difference. First operand 14756 states and 36048 transitions. Second operand 5 states. [2019-12-18 14:08:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:24,215 INFO L93 Difference]: Finished difference Result 18384 states and 44941 transitions. [2019-12-18 14:08:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:24,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 14:08:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:24,244 INFO L225 Difference]: With dead ends: 18384 [2019-12-18 14:08:24,244 INFO L226 Difference]: Without dead ends: 18384 [2019-12-18 14:08:24,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18384 states. [2019-12-18 14:08:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18384 to 15437. [2019-12-18 14:08:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15437 states. [2019-12-18 14:08:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15437 states to 15437 states and 37790 transitions. [2019-12-18 14:08:24,580 INFO L78 Accepts]: Start accepts. Automaton has 15437 states and 37790 transitions. Word has length 96 [2019-12-18 14:08:24,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:24,580 INFO L462 AbstractCegarLoop]: Abstraction has 15437 states and 37790 transitions. [2019-12-18 14:08:24,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 15437 states and 37790 transitions. [2019-12-18 14:08:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:24,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:24,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:24,601 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-18 14:08:24,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:24,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976539729] [2019-12-18 14:08:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:24,804 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 14:08:24,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976539729] [2019-12-18 14:08:24,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:24,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:24,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078383856] [2019-12-18 14:08:24,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:24,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:24,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:24,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:24,808 INFO L87 Difference]: Start difference. First operand 15437 states and 37790 transitions. Second operand 10 states. [2019-12-18 14:08:25,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:25,770 INFO L93 Difference]: Finished difference Result 26522 states and 64155 transitions. [2019-12-18 14:08:25,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:25,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:25,800 INFO L225 Difference]: With dead ends: 26522 [2019-12-18 14:08:25,800 INFO L226 Difference]: Without dead ends: 25045 [2019-12-18 14:08:25,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:08:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25045 states. [2019-12-18 14:08:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25045 to 19157. [2019-12-18 14:08:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19157 states. [2019-12-18 14:08:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19157 states to 19157 states and 47847 transitions. [2019-12-18 14:08:26,066 INFO L78 Accepts]: Start accepts. Automaton has 19157 states and 47847 transitions. Word has length 96 [2019-12-18 14:08:26,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:26,067 INFO L462 AbstractCegarLoop]: Abstraction has 19157 states and 47847 transitions. [2019-12-18 14:08:26,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:26,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19157 states and 47847 transitions. [2019-12-18 14:08:26,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:26,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:26,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:26,085 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-18 14:08:26,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:26,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187506908] [2019-12-18 14:08:26,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:26,242 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 14:08:26,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187506908] [2019-12-18 14:08:26,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:26,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:26,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354945740] [2019-12-18 14:08:26,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:26,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:26,244 INFO L87 Difference]: Start difference. First operand 19157 states and 47847 transitions. Second operand 10 states. [2019-12-18 14:08:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:27,356 INFO L93 Difference]: Finished difference Result 35528 states and 86772 transitions. [2019-12-18 14:08:27,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:08:27,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:27,395 INFO L225 Difference]: With dead ends: 35528 [2019-12-18 14:08:27,395 INFO L226 Difference]: Without dead ends: 34824 [2019-12-18 14:08:27,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:08:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34824 states. [2019-12-18 14:08:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34824 to 22292. [2019-12-18 14:08:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22292 states. [2019-12-18 14:08:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22292 states to 22292 states and 55813 transitions. [2019-12-18 14:08:27,753 INFO L78 Accepts]: Start accepts. Automaton has 22292 states and 55813 transitions. Word has length 96 [2019-12-18 14:08:27,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:27,753 INFO L462 AbstractCegarLoop]: Abstraction has 22292 states and 55813 transitions. [2019-12-18 14:08:27,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:27,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22292 states and 55813 transitions. [2019-12-18 14:08:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:27,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:27,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:27,776 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1036038953, now seen corresponding path program 1 times [2019-12-18 14:08:27,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:27,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859802598] [2019-12-18 14:08:27,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:27,975 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 14:08:27,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859802598] [2019-12-18 14:08:27,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:27,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:08:27,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397418302] [2019-12-18 14:08:27,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:08:27,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:08:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:27,977 INFO L87 Difference]: Start difference. First operand 22292 states and 55813 transitions. Second operand 11 states. [2019-12-18 14:08:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:31,316 INFO L93 Difference]: Finished difference Result 42229 states and 106096 transitions. [2019-12-18 14:08:31,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 14:08:31,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:08:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:31,365 INFO L225 Difference]: With dead ends: 42229 [2019-12-18 14:08:31,365 INFO L226 Difference]: Without dead ends: 42229 [2019-12-18 14:08:31,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:08:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42229 states. [2019-12-18 14:08:31,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42229 to 31971. [2019-12-18 14:08:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31971 states. [2019-12-18 14:08:31,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31971 states to 31971 states and 81124 transitions. [2019-12-18 14:08:31,848 INFO L78 Accepts]: Start accepts. Automaton has 31971 states and 81124 transitions. Word has length 96 [2019-12-18 14:08:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:31,848 INFO L462 AbstractCegarLoop]: Abstraction has 31971 states and 81124 transitions. [2019-12-18 14:08:31,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:08:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 31971 states and 81124 transitions. [2019-12-18 14:08:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:31,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:31,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:31,879 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 6 times [2019-12-18 14:08:31,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:31,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233557735] [2019-12-18 14:08:31,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:32,165 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 14:08:32,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233557735] [2019-12-18 14:08:32,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:32,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:08:32,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761597512] [2019-12-18 14:08:32,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:08:32,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:08:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:08:32,167 INFO L87 Difference]: Start difference. First operand 31971 states and 81124 transitions. Second operand 14 states. [2019-12-18 14:08:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:33,457 INFO L93 Difference]: Finished difference Result 41499 states and 104022 transitions. [2019-12-18 14:08:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:33,458 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 14:08:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:33,509 INFO L225 Difference]: With dead ends: 41499 [2019-12-18 14:08:33,509 INFO L226 Difference]: Without dead ends: 41469 [2019-12-18 14:08:33,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:08:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41469 states. [2019-12-18 14:08:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41469 to 36774. [2019-12-18 14:08:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36774 states. [2019-12-18 14:08:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36774 states to 36774 states and 93289 transitions. [2019-12-18 14:08:34,015 INFO L78 Accepts]: Start accepts. Automaton has 36774 states and 93289 transitions. Word has length 96 [2019-12-18 14:08:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:34,015 INFO L462 AbstractCegarLoop]: Abstraction has 36774 states and 93289 transitions. [2019-12-18 14:08:34,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:08:34,015 INFO L276 IsEmpty]: Start isEmpty. Operand 36774 states and 93289 transitions. [2019-12-18 14:08:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:34,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:34,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:34,055 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -720700797, now seen corresponding path program 2 times [2019-12-18 14:08:34,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:34,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979910776] [2019-12-18 14:08:34,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:34,475 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 14:08:34,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979910776] [2019-12-18 14:08:34,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:34,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:08:34,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771048214] [2019-12-18 14:08:34,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:08:34,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:34,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:08:34,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:08:34,477 INFO L87 Difference]: Start difference. First operand 36774 states and 93289 transitions. Second operand 14 states. [2019-12-18 14:08:36,271 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 14:08:37,221 WARN L192 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-12-18 14:08:39,453 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-18 14:08:40,815 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-18 14:08:40,951 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-12-18 14:08:42,383 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-12-18 14:08:43,448 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-18 14:08:45,085 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-12-18 14:08:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:45,796 INFO L93 Difference]: Finished difference Result 92489 states and 232525 transitions. [2019-12-18 14:08:45,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-18 14:08:45,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 14:08:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:45,914 INFO L225 Difference]: With dead ends: 92489 [2019-12-18 14:08:45,914 INFO L226 Difference]: Without dead ends: 92489 [2019-12-18 14:08:45,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2998 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1154, Invalid=7402, Unknown=0, NotChecked=0, Total=8556 [2019-12-18 14:08:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92489 states. [2019-12-18 14:08:47,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92489 to 45752. [2019-12-18 14:08:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45752 states. [2019-12-18 14:08:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45752 states to 45752 states and 115323 transitions. [2019-12-18 14:08:47,228 INFO L78 Accepts]: Start accepts. Automaton has 45752 states and 115323 transitions. Word has length 96 [2019-12-18 14:08:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:47,228 INFO L462 AbstractCegarLoop]: Abstraction has 45752 states and 115323 transitions. [2019-12-18 14:08:47,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:08:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 45752 states and 115323 transitions. [2019-12-18 14:08:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:47,270 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:47,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:47,271 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:47,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash 393978987, now seen corresponding path program 3 times [2019-12-18 14:08:47,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:47,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058463665] [2019-12-18 14:08:47,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:47,356 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 14:08:47,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058463665] [2019-12-18 14:08:47,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:47,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:47,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672453452] [2019-12-18 14:08:47,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:47,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:47,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:47,358 INFO L87 Difference]: Start difference. First operand 45752 states and 115323 transitions. Second operand 3 states. [2019-12-18 14:08:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:47,561 INFO L93 Difference]: Finished difference Result 45752 states and 115322 transitions. [2019-12-18 14:08:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:47,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-18 14:08:47,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:47,621 INFO L225 Difference]: With dead ends: 45752 [2019-12-18 14:08:47,621 INFO L226 Difference]: Without dead ends: 45752 [2019-12-18 14:08:47,621 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 14:08:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45752 states. [2019-12-18 14:08:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45752 to 39275. [2019-12-18 14:08:48,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39275 states. [2019-12-18 14:08:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39275 states to 39275 states and 99640 transitions. [2019-12-18 14:08:48,188 INFO L78 Accepts]: Start accepts. Automaton has 39275 states and 99640 transitions. Word has length 96 [2019-12-18 14:08:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:48,188 INFO L462 AbstractCegarLoop]: Abstraction has 39275 states and 99640 transitions. [2019-12-18 14:08:48,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 39275 states and 99640 transitions. [2019-12-18 14:08:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:48,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:48,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:48,226 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash -82268492, now seen corresponding path program 7 times [2019-12-18 14:08:48,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:48,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999220219] [2019-12-18 14:08:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:48,295 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 14:08:48,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999220219] [2019-12-18 14:08:48,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:48,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:48,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773455189] [2019-12-18 14:08:48,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:48,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:48,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:48,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:48,297 INFO L87 Difference]: Start difference. First operand 39275 states and 99640 transitions. Second operand 6 states. [2019-12-18 14:08:49,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:49,041 INFO L93 Difference]: Finished difference Result 40070 states and 101254 transitions. [2019-12-18 14:08:49,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:49,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:49,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:49,090 INFO L225 Difference]: With dead ends: 40070 [2019-12-18 14:08:49,091 INFO L226 Difference]: Without dead ends: 40070 [2019-12-18 14:08:49,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40070 states. [2019-12-18 14:08:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40070 to 39422. [2019-12-18 14:08:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39422 states. [2019-12-18 14:08:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39422 states to 39422 states and 99965 transitions. [2019-12-18 14:08:49,604 INFO L78 Accepts]: Start accepts. Automaton has 39422 states and 99965 transitions. Word has length 96 [2019-12-18 14:08:49,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:49,604 INFO L462 AbstractCegarLoop]: Abstraction has 39422 states and 99965 transitions. [2019-12-18 14:08:49,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:49,605 INFO L276 IsEmpty]: Start isEmpty. Operand 39422 states and 99965 transitions. [2019-12-18 14:08:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:49,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:49,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:49,645 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 681291876, now seen corresponding path program 8 times [2019-12-18 14:08:49,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:49,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365085483] [2019-12-18 14:08:49,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:49,781 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 14:08:49,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365085483] [2019-12-18 14:08:49,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:49,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:49,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871745594] [2019-12-18 14:08:49,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:49,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:49,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:49,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:49,784 INFO L87 Difference]: Start difference. First operand 39422 states and 99965 transitions. Second operand 6 states. [2019-12-18 14:08:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:50,228 INFO L93 Difference]: Finished difference Result 37557 states and 95153 transitions. [2019-12-18 14:08:50,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:08:50,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:50,274 INFO L225 Difference]: With dead ends: 37557 [2019-12-18 14:08:50,274 INFO L226 Difference]: Without dead ends: 37557 [2019-12-18 14:08:50,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37557 states. [2019-12-18 14:08:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37557 to 36926. [2019-12-18 14:08:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36926 states. [2019-12-18 14:08:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36926 states to 36926 states and 93779 transitions. [2019-12-18 14:08:51,021 INFO L78 Accepts]: Start accepts. Automaton has 36926 states and 93779 transitions. Word has length 96 [2019-12-18 14:08:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:51,022 INFO L462 AbstractCegarLoop]: Abstraction has 36926 states and 93779 transitions. [2019-12-18 14:08:51,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 36926 states and 93779 transitions. [2019-12-18 14:08:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:51,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:51,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:51,056 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 334801602, now seen corresponding path program 9 times [2019-12-18 14:08:51,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:51,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940180295] [2019-12-18 14:08:51,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:51,211 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 14:08:51,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940180295] [2019-12-18 14:08:51,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:51,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:08:51,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593539194] [2019-12-18 14:08:51,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:08:51,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:51,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:08:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:51,215 INFO L87 Difference]: Start difference. First operand 36926 states and 93779 transitions. Second operand 9 states. [2019-12-18 14:08:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:52,148 INFO L93 Difference]: Finished difference Result 48918 states and 123778 transitions. [2019-12-18 14:08:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:08:52,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:08:52,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:52,210 INFO L225 Difference]: With dead ends: 48918 [2019-12-18 14:08:52,210 INFO L226 Difference]: Without dead ends: 48918 [2019-12-18 14:08:52,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48918 states. [2019-12-18 14:08:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48918 to 38448. [2019-12-18 14:08:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38448 states. [2019-12-18 14:08:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38448 states to 38448 states and 97694 transitions. [2019-12-18 14:08:52,726 INFO L78 Accepts]: Start accepts. Automaton has 38448 states and 97694 transitions. Word has length 96 [2019-12-18 14:08:52,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:52,726 INFO L462 AbstractCegarLoop]: Abstraction has 38448 states and 97694 transitions. [2019-12-18 14:08:52,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:08:52,726 INFO L276 IsEmpty]: Start isEmpty. Operand 38448 states and 97694 transitions. [2019-12-18 14:08:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:52,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:52,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:52,764 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:52,764 INFO L82 PathProgramCache]: Analyzing trace with hash 619233190, now seen corresponding path program 10 times [2019-12-18 14:08:52,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:52,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259709128] [2019-12-18 14:08:52,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:52,934 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 14:08:52,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259709128] [2019-12-18 14:08:52,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:52,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:08:52,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211897133] [2019-12-18 14:08:52,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:08:52,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:52,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:08:52,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:52,936 INFO L87 Difference]: Start difference. First operand 38448 states and 97694 transitions. Second operand 11 states. [2019-12-18 14:08:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:53,783 INFO L93 Difference]: Finished difference Result 57258 states and 144633 transitions. [2019-12-18 14:08:53,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:08:53,784 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:08:53,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:53,848 INFO L225 Difference]: With dead ends: 57258 [2019-12-18 14:08:53,848 INFO L226 Difference]: Without dead ends: 52360 [2019-12-18 14:08:53,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:08:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52360 states. [2019-12-18 14:08:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52360 to 46295. [2019-12-18 14:08:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46295 states. [2019-12-18 14:08:54,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46295 states to 46295 states and 118193 transitions. [2019-12-18 14:08:54,418 INFO L78 Accepts]: Start accepts. Automaton has 46295 states and 118193 transitions. Word has length 96 [2019-12-18 14:08:54,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:54,419 INFO L462 AbstractCegarLoop]: Abstraction has 46295 states and 118193 transitions. [2019-12-18 14:08:54,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:08:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 46295 states and 118193 transitions. [2019-12-18 14:08:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:54,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:54,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:54,462 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:54,462 INFO L82 PathProgramCache]: Analyzing trace with hash -144457054, now seen corresponding path program 11 times [2019-12-18 14:08:54,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:54,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668042461] [2019-12-18 14:08:54,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:54,608 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 14:08:54,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668042461] [2019-12-18 14:08:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:54,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:08:54,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696871691] [2019-12-18 14:08:54,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:08:54,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:08:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:54,609 INFO L87 Difference]: Start difference. First operand 46295 states and 118193 transitions. Second operand 12 states. [2019-12-18 14:08:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:56,075 INFO L93 Difference]: Finished difference Result 57826 states and 146748 transitions. [2019-12-18 14:08:56,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:08:56,076 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 14:08:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:56,146 INFO L225 Difference]: With dead ends: 57826 [2019-12-18 14:08:56,146 INFO L226 Difference]: Without dead ends: 56464 [2019-12-18 14:08:56,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:08:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56464 states. [2019-12-18 14:08:56,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56464 to 43374. [2019-12-18 14:08:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43374 states. [2019-12-18 14:08:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43374 states to 43374 states and 110776 transitions. [2019-12-18 14:08:56,746 INFO L78 Accepts]: Start accepts. Automaton has 43374 states and 110776 transitions. Word has length 96 [2019-12-18 14:08:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:56,746 INFO L462 AbstractCegarLoop]: Abstraction has 43374 states and 110776 transitions. [2019-12-18 14:08:56,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:08:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43374 states and 110776 transitions. [2019-12-18 14:08:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:56,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:56,792 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:56,792 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:56,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:56,793 INFO L82 PathProgramCache]: Analyzing trace with hash 304809122, now seen corresponding path program 12 times [2019-12-18 14:08:56,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:56,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923990422] [2019-12-18 14:08:56,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:56,956 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 14:08:56,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923990422] [2019-12-18 14:08:56,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:56,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:08:56,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070083938] [2019-12-18 14:08:56,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:08:56,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:08:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:56,957 INFO L87 Difference]: Start difference. First operand 43374 states and 110776 transitions. Second operand 11 states. [2019-12-18 14:08:58,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:58,987 INFO L93 Difference]: Finished difference Result 67212 states and 170428 transitions. [2019-12-18 14:08:58,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 14:08:58,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:08:58,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:59,068 INFO L225 Difference]: With dead ends: 67212 [2019-12-18 14:08:59,068 INFO L226 Difference]: Without dead ends: 62303 [2019-12-18 14:08:59,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 14:08:59,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62303 states. [2019-12-18 14:08:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62303 to 45747. [2019-12-18 14:08:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45747 states. [2019-12-18 14:08:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45747 states to 45747 states and 116637 transitions. [2019-12-18 14:08:59,715 INFO L78 Accepts]: Start accepts. Automaton has 45747 states and 116637 transitions. Word has length 96 [2019-12-18 14:08:59,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:59,715 INFO L462 AbstractCegarLoop]: Abstraction has 45747 states and 116637 transitions. [2019-12-18 14:08:59,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:08:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 45747 states and 116637 transitions. [2019-12-18 14:08:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:59,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:59,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, 1, 1, 1, 1, 1, 1, 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 14:08:59,760 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash -458881122, now seen corresponding path program 13 times [2019-12-18 14:08:59,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:59,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836524882] [2019-12-18 14:08:59,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:59,923 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 14:08:59,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836524882] [2019-12-18 14:08:59,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:59,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:08:59,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122495231] [2019-12-18 14:08:59,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:08:59,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:08:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:08:59,925 INFO L87 Difference]: Start difference. First operand 45747 states and 116637 transitions. Second operand 12 states. [2019-12-18 14:09:02,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:02,148 INFO L93 Difference]: Finished difference Result 68524 states and 174541 transitions. [2019-12-18 14:09:02,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:09:02,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 14:09:02,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:02,238 INFO L225 Difference]: With dead ends: 68524 [2019-12-18 14:09:02,238 INFO L226 Difference]: Without dead ends: 67151 [2019-12-18 14:09:02,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 14:09:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67151 states. [2019-12-18 14:09:02,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67151 to 42583. [2019-12-18 14:09:02,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42583 states. [2019-12-18 14:09:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42583 states to 42583 states and 108620 transitions. [2019-12-18 14:09:02,905 INFO L78 Accepts]: Start accepts. Automaton has 42583 states and 108620 transitions. Word has length 96 [2019-12-18 14:09:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:02,905 INFO L462 AbstractCegarLoop]: Abstraction has 42583 states and 108620 transitions. [2019-12-18 14:09:02,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:09:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 42583 states and 108620 transitions. [2019-12-18 14:09:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:02,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:02,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:02,948 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:02,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 14:09:02,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:02,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064562972] [2019-12-18 14:09:02,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:03,290 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 14:09:03,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064562972] [2019-12-18 14:09:03,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:03,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:09:03,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117714558] [2019-12-18 14:09:03,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:09:03,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:03,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:09:03,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:03,292 INFO L87 Difference]: Start difference. First operand 42583 states and 108620 transitions. Second operand 14 states. [2019-12-18 14:09:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:07,995 INFO L93 Difference]: Finished difference Result 90818 states and 230412 transitions. [2019-12-18 14:09:07,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 14:09:07,996 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 14:09:07,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:08,102 INFO L225 Difference]: With dead ends: 90818 [2019-12-18 14:09:08,102 INFO L226 Difference]: Without dead ends: 81480 [2019-12-18 14:09:08,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:09:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81480 states. [2019-12-18 14:09:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81480 to 49214. [2019-12-18 14:09:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49214 states. [2019-12-18 14:09:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49214 states to 49214 states and 125223 transitions. [2019-12-18 14:09:09,327 INFO L78 Accepts]: Start accepts. Automaton has 49214 states and 125223 transitions. Word has length 97 [2019-12-18 14:09:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:09,327 INFO L462 AbstractCegarLoop]: Abstraction has 49214 states and 125223 transitions. [2019-12-18 14:09:09,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:09:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 49214 states and 125223 transitions. [2019-12-18 14:09:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:09,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:09,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:09,375 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:09,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:09,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 14:09:09,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:09,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355437944] [2019-12-18 14:09:09,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:09,501 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 14:09:09,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355437944] [2019-12-18 14:09:09,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:09,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:09:09,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590093959] [2019-12-18 14:09:09,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:09:09,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:09,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:09:09,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:09:09,502 INFO L87 Difference]: Start difference. First operand 49214 states and 125223 transitions. Second operand 6 states. [2019-12-18 14:09:09,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:09,763 INFO L93 Difference]: Finished difference Result 48448 states and 122865 transitions. [2019-12-18 14:09:09,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:09:09,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 14:09:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:09,818 INFO L225 Difference]: With dead ends: 48448 [2019-12-18 14:09:09,818 INFO L226 Difference]: Without dead ends: 48448 [2019-12-18 14:09:09,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48448 states. [2019-12-18 14:09:10,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48448 to 32163. [2019-12-18 14:09:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32163 states. [2019-12-18 14:09:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32163 states to 32163 states and 80985 transitions. [2019-12-18 14:09:10,265 INFO L78 Accepts]: Start accepts. Automaton has 32163 states and 80985 transitions. Word has length 97 [2019-12-18 14:09:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:10,265 INFO L462 AbstractCegarLoop]: Abstraction has 32163 states and 80985 transitions. [2019-12-18 14:09:10,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:09:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 32163 states and 80985 transitions. [2019-12-18 14:09:10,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:10,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:10,295 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:10,295 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:10,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:10,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 1 times [2019-12-18 14:09:10,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:10,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987508943] [2019-12-18 14:09:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:10,974 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 14:09:10,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987508943] [2019-12-18 14:09:10,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:10,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:09:10,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259857594] [2019-12-18 14:09:10,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:09:10,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:09:10,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:09:10,975 INFO L87 Difference]: Start difference. First operand 32163 states and 80985 transitions. Second operand 21 states. [2019-12-18 14:09:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:15,350 INFO L93 Difference]: Finished difference Result 46859 states and 115546 transitions. [2019-12-18 14:09:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 14:09:15,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2019-12-18 14:09:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:15,419 INFO L225 Difference]: With dead ends: 46859 [2019-12-18 14:09:15,419 INFO L226 Difference]: Without dead ends: 40542 [2019-12-18 14:09:15,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=362, Invalid=2608, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:09:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40542 states. [2019-12-18 14:09:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40542 to 34711. [2019-12-18 14:09:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34711 states. [2019-12-18 14:09:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34711 states to 34711 states and 87025 transitions. [2019-12-18 14:09:16,188 INFO L78 Accepts]: Start accepts. Automaton has 34711 states and 87025 transitions. Word has length 97 [2019-12-18 14:09:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:16,189 INFO L462 AbstractCegarLoop]: Abstraction has 34711 states and 87025 transitions. [2019-12-18 14:09:16,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:09:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 34711 states and 87025 transitions. [2019-12-18 14:09:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:16,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:16,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:16,239 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:16,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:16,239 INFO L82 PathProgramCache]: Analyzing trace with hash 2072554265, now seen corresponding path program 2 times [2019-12-18 14:09:16,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:16,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669947497] [2019-12-18 14:09:16,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:16,469 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 14:09:16,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669947497] [2019-12-18 14:09:16,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:16,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:16,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509211745] [2019-12-18 14:09:16,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:16,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:16,470 INFO L87 Difference]: Start difference. First operand 34711 states and 87025 transitions. Second operand 10 states. [2019-12-18 14:09:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:17,552 INFO L93 Difference]: Finished difference Result 36315 states and 90501 transitions. [2019-12-18 14:09:17,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:09:17,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 14:09:17,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:17,594 INFO L225 Difference]: With dead ends: 36315 [2019-12-18 14:09:17,594 INFO L226 Difference]: Without dead ends: 36315 [2019-12-18 14:09:17,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:09:17,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36315 states. [2019-12-18 14:09:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36315 to 34855. [2019-12-18 14:09:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34855 states. [2019-12-18 14:09:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34855 states to 34855 states and 87339 transitions. [2019-12-18 14:09:18,017 INFO L78 Accepts]: Start accepts. Automaton has 34855 states and 87339 transitions. Word has length 97 [2019-12-18 14:09:18,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:18,018 INFO L462 AbstractCegarLoop]: Abstraction has 34855 states and 87339 transitions. [2019-12-18 14:09:18,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34855 states and 87339 transitions. [2019-12-18 14:09:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:18,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:18,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:18,052 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:18,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:18,052 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 3 times [2019-12-18 14:09:18,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:18,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031462360] [2019-12-18 14:09:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:18,192 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 14:09:18,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031462360] [2019-12-18 14:09:18,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:18,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:18,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471544632] [2019-12-18 14:09:18,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:09:18,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:18,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:09:18,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:18,195 INFO L87 Difference]: Start difference. First operand 34855 states and 87339 transitions. Second operand 8 states. [2019-12-18 14:09:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:19,177 INFO L93 Difference]: Finished difference Result 35499 states and 88607 transitions. [2019-12-18 14:09:19,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:19,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 14:09:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:19,220 INFO L225 Difference]: With dead ends: 35499 [2019-12-18 14:09:19,220 INFO L226 Difference]: Without dead ends: 35499 [2019-12-18 14:09:19,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35499 states. [2019-12-18 14:09:19,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35499 to 34378. [2019-12-18 14:09:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34378 states. [2019-12-18 14:09:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34378 states to 34378 states and 86107 transitions. [2019-12-18 14:09:19,635 INFO L78 Accepts]: Start accepts. Automaton has 34378 states and 86107 transitions. Word has length 97 [2019-12-18 14:09:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:19,635 INFO L462 AbstractCegarLoop]: Abstraction has 34378 states and 86107 transitions. [2019-12-18 14:09:19,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:09:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 34378 states and 86107 transitions. [2019-12-18 14:09:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:19,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:19,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:19,666 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 4 times [2019-12-18 14:09:19,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:19,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139746538] [2019-12-18 14:09:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:19,853 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 14:09:19,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139746538] [2019-12-18 14:09:19,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:19,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:19,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825685326] [2019-12-18 14:09:19,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:19,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:19,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:19,855 INFO L87 Difference]: Start difference. First operand 34378 states and 86107 transitions. Second operand 10 states. [2019-12-18 14:09:20,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:20,955 INFO L93 Difference]: Finished difference Result 45309 states and 113044 transitions. [2019-12-18 14:09:20,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:09:20,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 14:09:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:21,010 INFO L225 Difference]: With dead ends: 45309 [2019-12-18 14:09:21,010 INFO L226 Difference]: Without dead ends: 45295 [2019-12-18 14:09:21,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45295 states. [2019-12-18 14:09:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45295 to 37029. [2019-12-18 14:09:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37029 states. [2019-12-18 14:09:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37029 states to 37029 states and 92973 transitions. [2019-12-18 14:09:21,760 INFO L78 Accepts]: Start accepts. Automaton has 37029 states and 92973 transitions. Word has length 97 [2019-12-18 14:09:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 37029 states and 92973 transitions. [2019-12-18 14:09:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 37029 states and 92973 transitions. [2019-12-18 14:09:21,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:21,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:21,795 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:21,795 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 5 times [2019-12-18 14:09:21,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:21,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152270161] [2019-12-18 14:09:21,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:21,925 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 14:09:21,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152270161] [2019-12-18 14:09:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:21,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:21,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512883143] [2019-12-18 14:09:21,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:09:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:09:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:09:21,927 INFO L87 Difference]: Start difference. First operand 37029 states and 92973 transitions. Second operand 9 states. [2019-12-18 14:09:22,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:22,894 INFO L93 Difference]: Finished difference Result 48782 states and 121855 transitions. [2019-12-18 14:09:22,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:09:22,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 14:09:22,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:22,949 INFO L225 Difference]: With dead ends: 48782 [2019-12-18 14:09:22,950 INFO L226 Difference]: Without dead ends: 48782 [2019-12-18 14:09:22,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:09:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48782 states. [2019-12-18 14:09:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48782 to 37479. [2019-12-18 14:09:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37479 states. [2019-12-18 14:09:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37479 states to 37479 states and 94105 transitions. [2019-12-18 14:09:23,445 INFO L78 Accepts]: Start accepts. Automaton has 37479 states and 94105 transitions. Word has length 97 [2019-12-18 14:09:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:23,446 INFO L462 AbstractCegarLoop]: Abstraction has 37479 states and 94105 transitions. [2019-12-18 14:09:23,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:09:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 37479 states and 94105 transitions. [2019-12-18 14:09:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:23,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:23,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:23,482 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:23,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 6 times [2019-12-18 14:09:23,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:23,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251222776] [2019-12-18 14:09:23,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:23,722 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 14:09:23,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251222776] [2019-12-18 14:09:23,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:23,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:23,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233475927] [2019-12-18 14:09:23,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:23,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:23,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:23,727 INFO L87 Difference]: Start difference. First operand 37479 states and 94105 transitions. Second operand 10 states. [2019-12-18 14:09:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:25,263 INFO L93 Difference]: Finished difference Result 54515 states and 136146 transitions. [2019-12-18 14:09:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:09:25,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 14:09:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:25,329 INFO L225 Difference]: With dead ends: 54515 [2019-12-18 14:09:25,329 INFO L226 Difference]: Without dead ends: 54501 [2019-12-18 14:09:25,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54501 states. [2019-12-18 14:09:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54501 to 35365. [2019-12-18 14:09:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35365 states. [2019-12-18 14:09:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35365 states to 35365 states and 88661 transitions. [2019-12-18 14:09:25,842 INFO L78 Accepts]: Start accepts. Automaton has 35365 states and 88661 transitions. Word has length 97 [2019-12-18 14:09:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:25,843 INFO L462 AbstractCegarLoop]: Abstraction has 35365 states and 88661 transitions. [2019-12-18 14:09:25,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35365 states and 88661 transitions. [2019-12-18 14:09:25,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:25,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:25,877 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:25,878 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 7 times [2019-12-18 14:09:25,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:25,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881937452] [2019-12-18 14:09:25,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:26,029 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 14:09:26,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881937452] [2019-12-18 14:09:26,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:26,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:26,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354376702] [2019-12-18 14:09:26,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:09:26,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:09:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:09:26,031 INFO L87 Difference]: Start difference. First operand 35365 states and 88661 transitions. Second operand 9 states. [2019-12-18 14:09:27,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:27,083 INFO L93 Difference]: Finished difference Result 46703 states and 116542 transitions. [2019-12-18 14:09:27,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:27,084 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-18 14:09:27,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:27,142 INFO L225 Difference]: With dead ends: 46703 [2019-12-18 14:09:27,142 INFO L226 Difference]: Without dead ends: 46703 [2019-12-18 14:09:27,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:27,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46703 states. [2019-12-18 14:09:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46703 to 35425. [2019-12-18 14:09:27,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35425 states. [2019-12-18 14:09:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35425 states to 35425 states and 88716 transitions. [2019-12-18 14:09:27,904 INFO L78 Accepts]: Start accepts. Automaton has 35425 states and 88716 transitions. Word has length 97 [2019-12-18 14:09:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:27,904 INFO L462 AbstractCegarLoop]: Abstraction has 35425 states and 88716 transitions. [2019-12-18 14:09:27,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:09:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35425 states and 88716 transitions. [2019-12-18 14:09:27,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:27,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:27,938 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:27,938 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:27,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:27,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1707683571, now seen corresponding path program 8 times [2019-12-18 14:09:27,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:27,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775217143] [2019-12-18 14:09:27,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:28,124 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 14:09:28,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775217143] [2019-12-18 14:09:28,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:28,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:28,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474544402] [2019-12-18 14:09:28,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:28,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:28,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:28,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:28,126 INFO L87 Difference]: Start difference. First operand 35425 states and 88716 transitions. Second operand 11 states. [2019-12-18 14:09:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:29,891 INFO L93 Difference]: Finished difference Result 48481 states and 120497 transitions. [2019-12-18 14:09:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:09:29,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 14:09:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:29,951 INFO L225 Difference]: With dead ends: 48481 [2019-12-18 14:09:29,951 INFO L226 Difference]: Without dead ends: 48481 [2019-12-18 14:09:29,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:09:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48481 states. [2019-12-18 14:09:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48481 to 34611. [2019-12-18 14:09:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34611 states. [2019-12-18 14:09:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34611 states to 34611 states and 86731 transitions. [2019-12-18 14:09:30,430 INFO L78 Accepts]: Start accepts. Automaton has 34611 states and 86731 transitions. Word has length 97 [2019-12-18 14:09:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:30,430 INFO L462 AbstractCegarLoop]: Abstraction has 34611 states and 86731 transitions. [2019-12-18 14:09:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 34611 states and 86731 transitions. [2019-12-18 14:09:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:30,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:30,461 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:30,461 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1094189681, now seen corresponding path program 9 times [2019-12-18 14:09:30,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:30,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752317488] [2019-12-18 14:09:30,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:30,790 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 14:09:30,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752317488] [2019-12-18 14:09:30,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:30,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:09:30,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456037946] [2019-12-18 14:09:30,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:09:30,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:30,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:09:30,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:30,792 INFO L87 Difference]: Start difference. First operand 34611 states and 86731 transitions. Second operand 14 states. [2019-12-18 14:09:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:32,940 INFO L93 Difference]: Finished difference Result 46245 states and 114597 transitions. [2019-12-18 14:09:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:09:32,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 14:09:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:32,994 INFO L225 Difference]: With dead ends: 46245 [2019-12-18 14:09:32,994 INFO L226 Difference]: Without dead ends: 46245 [2019-12-18 14:09:32,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:09:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46245 states. [2019-12-18 14:09:33,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46245 to 34685. [2019-12-18 14:09:33,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34685 states. [2019-12-18 14:09:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34685 states to 34685 states and 86896 transitions. [2019-12-18 14:09:33,467 INFO L78 Accepts]: Start accepts. Automaton has 34685 states and 86896 transitions. Word has length 97 [2019-12-18 14:09:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:33,468 INFO L462 AbstractCegarLoop]: Abstraction has 34685 states and 86896 transitions. [2019-12-18 14:09:33,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:09:33,468 INFO L276 IsEmpty]: Start isEmpty. Operand 34685 states and 86896 transitions. [2019-12-18 14:09:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:09:33,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:33,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:33,500 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 1 times [2019-12-18 14:09:33,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528321710] [2019-12-18 14:09:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:33,970 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2019-12-18 14:09:34,329 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 14:09:34,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528321710] [2019-12-18 14:09:34,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:34,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 14:09:34,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290485173] [2019-12-18 14:09:34,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:09:34,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:34,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:09:34,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:09:34,330 INFO L87 Difference]: Start difference. First operand 34685 states and 86896 transitions. Second operand 17 states. [2019-12-18 14:09:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:39,512 INFO L93 Difference]: Finished difference Result 45549 states and 113586 transitions. [2019-12-18 14:09:39,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 14:09:39,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-18 14:09:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:39,571 INFO L225 Difference]: With dead ends: 45549 [2019-12-18 14:09:39,571 INFO L226 Difference]: Without dead ends: 44264 [2019-12-18 14:09:39,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=436, Invalid=2216, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 14:09:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44264 states. [2019-12-18 14:09:39,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44264 to 34739. [2019-12-18 14:09:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34739 states. [2019-12-18 14:09:40,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34739 states to 34739 states and 87007 transitions. [2019-12-18 14:09:40,030 INFO L78 Accepts]: Start accepts. Automaton has 34739 states and 87007 transitions. Word has length 98 [2019-12-18 14:09:40,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:40,030 INFO L462 AbstractCegarLoop]: Abstraction has 34739 states and 87007 transitions. [2019-12-18 14:09:40,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:09:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34739 states and 87007 transitions. [2019-12-18 14:09:40,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:09:40,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:40,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:40,064 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:40,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:40,065 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 2 times [2019-12-18 14:09:40,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:40,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562303623] [2019-12-18 14:09:40,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:40,530 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 14:09:40,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562303623] [2019-12-18 14:09:40,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:40,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:09:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085354684] [2019-12-18 14:09:40,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:09:40,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:40,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:09:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:09:40,533 INFO L87 Difference]: Start difference. First operand 34739 states and 87007 transitions. Second operand 19 states. [2019-12-18 14:09:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:43,439 INFO L93 Difference]: Finished difference Result 50403 states and 124885 transitions. [2019-12-18 14:09:43,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 14:09:43,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-18 14:09:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:43,494 INFO L225 Difference]: With dead ends: 50403 [2019-12-18 14:09:43,495 INFO L226 Difference]: Without dead ends: 46163 [2019-12-18 14:09:43,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:09:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46163 states. [2019-12-18 14:09:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46163 to 37916. [2019-12-18 14:09:44,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37916 states. [2019-12-18 14:09:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37916 states to 37916 states and 95544 transitions. [2019-12-18 14:09:44,258 INFO L78 Accepts]: Start accepts. Automaton has 37916 states and 95544 transitions. Word has length 98 [2019-12-18 14:09:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:44,258 INFO L462 AbstractCegarLoop]: Abstraction has 37916 states and 95544 transitions. [2019-12-18 14:09:44,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:09:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37916 states and 95544 transitions. [2019-12-18 14:09:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:09:44,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:44,301 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:44,301 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:44,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 3 times [2019-12-18 14:09:44,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:44,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443117076] [2019-12-18 14:09:44,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:45,052 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 14:09:45,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443117076] [2019-12-18 14:09:45,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:45,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:09:45,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331481296] [2019-12-18 14:09:45,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:09:45,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:45,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:09:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:09:45,054 INFO L87 Difference]: Start difference. First operand 37916 states and 95544 transitions. Second operand 21 states. [2019-12-18 14:09:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:53,171 INFO L93 Difference]: Finished difference Result 63578 states and 160436 transitions. [2019-12-18 14:09:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-18 14:09:53,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 98 [2019-12-18 14:09:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:53,251 INFO L225 Difference]: With dead ends: 63578 [2019-12-18 14:09:53,251 INFO L226 Difference]: Without dead ends: 62348 [2019-12-18 14:09:53,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=873, Invalid=6609, Unknown=0, NotChecked=0, Total=7482 [2019-12-18 14:09:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62348 states. [2019-12-18 14:09:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62348 to 38792. [2019-12-18 14:09:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38792 states. [2019-12-18 14:09:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38792 states to 38792 states and 97560 transitions. [2019-12-18 14:09:53,824 INFO L78 Accepts]: Start accepts. Automaton has 38792 states and 97560 transitions. Word has length 98 [2019-12-18 14:09:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:53,825 INFO L462 AbstractCegarLoop]: Abstraction has 38792 states and 97560 transitions. [2019-12-18 14:09:53,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:09:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 38792 states and 97560 transitions. [2019-12-18 14:09:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:09:53,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:53,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:53,863 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:53,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:53,863 INFO L82 PathProgramCache]: Analyzing trace with hash 438799118, now seen corresponding path program 4 times [2019-12-18 14:09:53,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:53,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179630337] [2019-12-18 14:09:53,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:55,040 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 18 [2019-12-18 14:09:55,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 14:09:55,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179630337] [2019-12-18 14:09:55,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:55,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 14:09:55,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820568604] [2019-12-18 14:09:55,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 14:09:55,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:55,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 14:09:55,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-18 14:09:55,306 INFO L87 Difference]: Start difference. First operand 38792 states and 97560 transitions. Second operand 23 states. [2019-12-18 14:10:03,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:03,955 INFO L93 Difference]: Finished difference Result 60971 states and 153482 transitions. [2019-12-18 14:10:03,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-18 14:10:03,955 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-18 14:10:03,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:04,033 INFO L225 Difference]: With dead ends: 60971 [2019-12-18 14:10:04,034 INFO L226 Difference]: Without dead ends: 60465 [2019-12-18 14:10:04,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=762, Invalid=5558, Unknown=0, NotChecked=0, Total=6320 [2019-12-18 14:10:04,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60465 states. [2019-12-18 14:10:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60465 to 38802. [2019-12-18 14:10:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38802 states. [2019-12-18 14:10:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38802 states to 38802 states and 97576 transitions. [2019-12-18 14:10:04,591 INFO L78 Accepts]: Start accepts. Automaton has 38802 states and 97576 transitions. Word has length 98 [2019-12-18 14:10:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:04,591 INFO L462 AbstractCegarLoop]: Abstraction has 38802 states and 97576 transitions. [2019-12-18 14:10:04,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 14:10:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 38802 states and 97576 transitions. [2019-12-18 14:10:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:10:04,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:04,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:04,627 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:04,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:04,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1094549086, now seen corresponding path program 5 times [2019-12-18 14:10:04,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:04,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286001227] [2019-12-18 14:10:04,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:04,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:05,166 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 14:10:05,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286001227] [2019-12-18 14:10:05,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:05,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:10:05,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490164694] [2019-12-18 14:10:05,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:10:05,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:05,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:10:05,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:10:05,167 INFO L87 Difference]: Start difference. First operand 38802 states and 97576 transitions. Second operand 19 states. [2019-12-18 14:10:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:12,778 INFO L93 Difference]: Finished difference Result 75090 states and 189039 transitions. [2019-12-18 14:10:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-18 14:10:12,778 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-18 14:10:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:12,864 INFO L225 Difference]: With dead ends: 75090 [2019-12-18 14:10:12,865 INFO L226 Difference]: Without dead ends: 72005 [2019-12-18 14:10:12,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=776, Invalid=5866, Unknown=0, NotChecked=0, Total=6642 [2019-12-18 14:10:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72005 states. [2019-12-18 14:10:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72005 to 44522. [2019-12-18 14:10:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44522 states. [2019-12-18 14:10:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44522 states to 44522 states and 112768 transitions. [2019-12-18 14:10:13,548 INFO L78 Accepts]: Start accepts. Automaton has 44522 states and 112768 transitions. Word has length 98 [2019-12-18 14:10:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:13,549 INFO L462 AbstractCegarLoop]: Abstraction has 44522 states and 112768 transitions. [2019-12-18 14:10:13,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:10:13,549 INFO L276 IsEmpty]: Start isEmpty. Operand 44522 states and 112768 transitions. [2019-12-18 14:10:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:10:13,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:13,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:13,592 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:13,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1521203020, now seen corresponding path program 6 times [2019-12-18 14:10:13,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:13,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610943681] [2019-12-18 14:10:13,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:14,308 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 14:10:14,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610943681] [2019-12-18 14:10:14,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:14,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:10:14,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323643335] [2019-12-18 14:10:14,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:10:14,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:10:14,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:10:14,310 INFO L87 Difference]: Start difference. First operand 44522 states and 112768 transitions. Second operand 19 states. [2019-12-18 14:10:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:20,802 INFO L93 Difference]: Finished difference Result 75364 states and 192176 transitions. [2019-12-18 14:10:20,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 14:10:20,802 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-18 14:10:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:20,903 INFO L225 Difference]: With dead ends: 75364 [2019-12-18 14:10:20,903 INFO L226 Difference]: Without dead ends: 75113 [2019-12-18 14:10:20,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=548, Invalid=3612, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 14:10:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75113 states. [2019-12-18 14:10:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75113 to 46802. [2019-12-18 14:10:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46802 states. [2019-12-18 14:10:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46802 states to 46802 states and 118014 transitions. [2019-12-18 14:10:21,612 INFO L78 Accepts]: Start accepts. Automaton has 46802 states and 118014 transitions. Word has length 98 [2019-12-18 14:10:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:21,612 INFO L462 AbstractCegarLoop]: Abstraction has 46802 states and 118014 transitions. [2019-12-18 14:10:21,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:10:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 46802 states and 118014 transitions. [2019-12-18 14:10:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 14:10:21,657 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:21,657 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:21,657 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:21,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash -299791706, now seen corresponding path program 7 times [2019-12-18 14:10:21,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:21,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675632244] [2019-12-18 14:10:21,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:22,744 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 14:10:22,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675632244] [2019-12-18 14:10:22,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:22,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-18 14:10:22,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579669170] [2019-12-18 14:10:22,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 14:10:22,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:22,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 14:10:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:10:22,746 INFO L87 Difference]: Start difference. First operand 46802 states and 118014 transitions. Second operand 25 states. Received shutdown request... [2019-12-18 14:10:26,712 WARN L209 SmtUtils]: Removed 4 from assertion stack [2019-12-18 14:10:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-18 14:10:26,713 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 14:10:26,715 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 14:10:26,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:10:26 BasicIcfg [2019-12-18 14:10:26,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:10:26,717 INFO L168 Benchmark]: Toolchain (without parser) took 219741.52 ms. Allocated memory was 146.8 MB in the beginning and 4.0 GB in the end (delta: 3.9 GB). Free memory was 101.9 MB in the beginning and 1.0 GB in the end (delta: -941.2 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,717 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 14:10:26,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.05 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.9 MB in the beginning and 153.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.93 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,718 INFO L168 Benchmark]: Boogie Preprocessor took 50.49 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 147.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,719 INFO L168 Benchmark]: RCFGBuilder took 1282.45 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 147.2 MB in the beginning and 186.8 MB in the end (delta: -39.6 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,719 INFO L168 Benchmark]: TraceAbstraction took 217510.39 ms. Allocated memory was 233.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 186.8 MB in the beginning and 1.0 GB in the end (delta: -856.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:10:26,721 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.25 ms. Allocated memory is still 146.8 MB. Free memory is still 121.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.05 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 101.9 MB in the beginning and 153.7 MB in the end (delta: -51.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.93 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.0 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.49 ms. Allocated memory is still 202.9 MB. Free memory was 150.0 MB in the beginning and 147.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1282.45 ms. Allocated memory was 202.9 MB in the beginning and 233.8 MB in the end (delta: 30.9 MB). Free memory was 147.2 MB in the beginning and 186.8 MB in the end (delta: -39.6 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 217510.39 ms. Allocated memory was 233.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 186.8 MB in the beginning and 1.0 GB in the end (delta: -856.4 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.4s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.3s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (46802states) and FLOYD_HOARE automaton (currently 57 states, 25 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 19 for 11ms.. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (46802states) and FLOYD_HOARE automaton (currently 57 states, 25 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 19 for 11ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 217.3s, OverallIterations: 54, TraceHistogramMax: 1, AutomataDifference: 125.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 24129 SDtfs, 34240 SDslu, 133668 SDs, 0 SdLazy, 81499 SolverSat, 2009 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 66.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1528 GetRequests, 194 SyntacticMatches, 113 SemanticMatches, 1220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15725 ImplicationChecksByTransitivity, 30.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184484occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 52.8s AutomataMinimizationTime, 53 MinimizatonAttempts, 467217 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 4671 NumberOfCodeBlocks, 4671 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900684 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 54 InterpolantComputations, 54 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