/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_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:11:02,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:11:02,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:11:02,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:11:02,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:11:02,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:11:02,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:11:02,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:11:02,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:11:02,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:11:02,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:11:02,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:11:02,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:11:02,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:11:02,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:11:02,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:11:02,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:11:02,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:11:02,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:11:02,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:11:02,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:11:02,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:11:02,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:11:02,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:11:02,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:11:02,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:11:02,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:11:02,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:11:02,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:11:02,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:11:02,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:11:02,214 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:11:02,215 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:11:02,216 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:11:02,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:11:02,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:11:02,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:11:02,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:11:02,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:11:02,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:11:02,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:11:02,225 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-26 23:11:02,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:11:02,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:11:02,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:11:02,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:11:02,248 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:11:02,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:11:02,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:11:02,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:11:02,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:11:02,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:11:02,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:11:02,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:11:02,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:11:02,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:11:02,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:11:02,250 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:11:02,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:11:02,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:11:02,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:11:02,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:11:02,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:11:02,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:11:02,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:11:02,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:11:02,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:11:02,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:11:02,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:11:02,579 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:11:02,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:11:02,581 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:11:02,582 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-26 23:11:02,654 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3213db210/a64b177a96d84764807cdf46f92867f3/FLAG02fab538f [2019-12-26 23:11:03,260 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:11:03,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-26 23:11:03,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3213db210/a64b177a96d84764807cdf46f92867f3/FLAG02fab538f [2019-12-26 23:11:03,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3213db210/a64b177a96d84764807cdf46f92867f3 [2019-12-26 23:11:03,506 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:11:03,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:11:03,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:03,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:11:03,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:11:03,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:03" (1/1) ... [2019-12-26 23:11:03,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7126c0fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:03, skipping insertion in model container [2019-12-26 23:11:03,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:11:03" (1/1) ... [2019-12-26 23:11:03,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:11:03,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:11:04,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:04,168 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:11:04,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:11:04,340 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:11:04,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04 WrapperNode [2019-12-26 23:11:04,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:11:04,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:04,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:11:04,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:11:04,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:11:04,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:11:04,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:11:04,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:11:04,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,464 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,470 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (1/1) ... [2019-12-26 23:11:04,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:11:04,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:11:04,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:11:04,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:11:04,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (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-26 23:11:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:11:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:11:04,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:11:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:11:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:11:04,575 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:11:04,575 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:11:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:11:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:11:04,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:11:04,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:11:04,578 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:11:05,627 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:11:05,627 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:11:05,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:05 BoogieIcfgContainer [2019-12-26 23:11:05,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:11:05,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:11:05,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:11:05,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:11:05,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:11:03" (1/3) ... [2019-12-26 23:11:05,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469c593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:05, skipping insertion in model container [2019-12-26 23:11:05,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:11:04" (2/3) ... [2019-12-26 23:11:05,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5469c593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:11:05, skipping insertion in model container [2019-12-26 23:11:05,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:11:05" (3/3) ... [2019-12-26 23:11:05,637 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.oepc.i [2019-12-26 23:11:05,647 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:11:05,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:11:05,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:11:05,657 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:11:05,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,747 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:11:05,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:11:05,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:11:05,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:11:05,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:11:05,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:11:05,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:11:05,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:11:05,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:11:05,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:11:05,857 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-26 23:11:05,859 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:06,039 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:06,039 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:06,098 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. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:06,212 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-26 23:11:06,353 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-26 23:11:06,353 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:11:06,377 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. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-26 23:11:06,430 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-26 23:11:06,431 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:11:14,100 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-26 23:11:14,353 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-26 23:11:14,353 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-26 23:11:14,357 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-26 23:11:29,022 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-26 23:11:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-26 23:11:29,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:11:29,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:29,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:11:29,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:29,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:29,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-26 23:11:29,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:29,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817735435] [2019-12-26 23:11:29,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:29,273 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-26 23:11:29,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817735435] [2019-12-26 23:11:29,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:29,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:11:29,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717510045] [2019-12-26 23:11:29,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:11:29,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:29,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:11:29,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:11:29,301 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-26 23:11:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:32,469 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-26 23:11:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:11:32,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:11:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:33,078 INFO L225 Difference]: With dead ends: 116456 [2019-12-26 23:11:33,078 INFO L226 Difference]: Without dead ends: 114036 [2019-12-26 23:11:33,080 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-26 23:11:38,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-26 23:11:43,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-26 23:11:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-26 23:11:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-26 23:11:44,042 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-26 23:11:44,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:44,042 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-26 23:11:44,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:11:44,042 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-26 23:11:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:44,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:44,044 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:44,045 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:44,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:44,045 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-26 23:11:44,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:44,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015787457] [2019-12-26 23:11:44,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:44,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-26 23:11:44,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015787457] [2019-12-26 23:11:44,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:44,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:44,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510207185] [2019-12-26 23:11:44,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:44,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:44,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:44,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:44,168 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-26 23:11:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:11:49,909 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-26 23:11:49,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:11:49,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:11:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:11:50,445 INFO L225 Difference]: With dead ends: 152998 [2019-12-26 23:11:50,446 INFO L226 Difference]: Without dead ends: 152998 [2019-12-26 23:11:50,447 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-26 23:11:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-26 23:11:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-26 23:11:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-26 23:11:59,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-26 23:11:59,170 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-26 23:11:59,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:11:59,171 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-26 23:11:59,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:11:59,171 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-26 23:11:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:11:59,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:11:59,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:11:59,174 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:11:59,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:11:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-26 23:11:59,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:11:59,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600631690] [2019-12-26 23:11:59,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:11:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:11:59,258 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-26 23:11:59,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600631690] [2019-12-26 23:11:59,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:11:59,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:11:59,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484684887] [2019-12-26 23:11:59,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:11:59,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:11:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:11:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:11:59,261 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-26 23:12:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:05,867 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-26 23:12:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:12:05,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:12:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:06,359 INFO L225 Difference]: With dead ends: 198503 [2019-12-26 23:12:06,360 INFO L226 Difference]: Without dead ends: 198503 [2019-12-26 23:12:06,360 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-26 23:12:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-26 23:12:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-26 23:12:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-26 23:12:16,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-26 23:12:16,865 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-26 23:12:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:16,866 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-26 23:12:16,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:12:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-26 23:12:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 23:12:16,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:16,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:12:16,872 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-26 23:12:16,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:16,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386050601] [2019-12-26 23:12:16,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:16,978 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-26 23:12:16,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386050601] [2019-12-26 23:12:16,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:16,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:12:16,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030710080] [2019-12-26 23:12:16,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:12:16,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:16,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:12:16,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:12:16,981 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-26 23:12:18,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:18,824 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-26 23:12:18,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:12:18,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 23:12:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:26,386 INFO L225 Difference]: With dead ends: 244942 [2019-12-26 23:12:26,386 INFO L226 Difference]: Without dead ends: 244942 [2019-12-26 23:12:26,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:12:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-26 23:12:36,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-26 23:12:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-26 23:12:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-26 23:12:37,044 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-26 23:12:37,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:12:37,044 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-26 23:12:37,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:12:37,044 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-26 23:12:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:12:37,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:12:37,068 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-26 23:12:37,068 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:12:37,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:12:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-26 23:12:37,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:12:37,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598263381] [2019-12-26 23:12:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:12:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:12:37,231 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-26 23:12:37,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598263381] [2019-12-26 23:12:37,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:12:37,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:12:37,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222532622] [2019-12-26 23:12:37,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:12:37,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:12:37,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:12:37,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:12:37,233 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 6 states. [2019-12-26 23:12:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:12:44,347 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-26 23:12:44,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:12:44,348 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-26 23:12:44,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:12:44,947 INFO L225 Difference]: With dead ends: 255390 [2019-12-26 23:12:44,947 INFO L226 Difference]: Without dead ends: 255390 [2019-12-26 23:12:44,947 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-26 23:12:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-26 23:12:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-26 23:12:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-26 23:13:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-26 23:13:00,473 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-26 23:13:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:00,474 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-26 23:13:00,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:00,474 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-26 23:13:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:13:00,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:00,498 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-26 23:13:00,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:00,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-26 23:13:00,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:00,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013044953] [2019-12-26 23:13:00,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:00,616 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-26 23:13:00,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013044953] [2019-12-26 23:13:00,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:00,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:13:00,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581685750] [2019-12-26 23:13:00,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:13:00,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:13:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:13:00,619 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-26 23:13:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:00,695 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-26 23:13:00,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:13:00,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:13:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:00,710 INFO L225 Difference]: With dead ends: 14741 [2019-12-26 23:13:00,710 INFO L226 Difference]: Without dead ends: 10693 [2019-12-26 23:13:00,710 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-26 23:13:00,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-26 23:13:00,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-26 23:13:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-26 23:13:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-26 23:13:00,857 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-26 23:13:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:00,858 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-26 23:13:00,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:13:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-26 23:13:00,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-26 23:13:00,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:00,862 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-26 23:13:00,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:00,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-26 23:13:00,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:00,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605959141] [2019-12-26 23:13:00,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:00,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:00,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605959141] [2019-12-26 23:13:00,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:00,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:13:00,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176435312] [2019-12-26 23:13:00,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:00,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:00,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:00,961 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-26 23:13:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:03,170 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-26 23:13:03,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:13:03,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-26 23:13:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:03,185 INFO L225 Difference]: With dead ends: 11962 [2019-12-26 23:13:03,185 INFO L226 Difference]: Without dead ends: 11914 [2019-12-26 23:13:03,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-26 23:13:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-26 23:13:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-26 23:13:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-26 23:13:03,321 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-26 23:13:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:03,322 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-26 23:13:03,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-26 23:13:03,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-26 23:13:03,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:03,328 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-26 23:13:03,329 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:03,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:03,329 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-26 23:13:03,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:03,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616926553] [2019-12-26 23:13:03,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:03,507 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-26 23:13:03,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616926553] [2019-12-26 23:13:03,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:03,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:03,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364249253] [2019-12-26 23:13:03,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:03,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:03,509 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 7 states. [2019-12-26 23:13:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:04,759 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-26 23:13:04,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:13:04,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-26 23:13:04,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:04,775 INFO L225 Difference]: With dead ends: 13314 [2019-12-26 23:13:04,775 INFO L226 Difference]: Without dead ends: 13314 [2019-12-26 23:13:04,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-26 23:13:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-26 23:13:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-26 23:13:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-26 23:13:04,915 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-26 23:13:04,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:04,916 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-26 23:13:04,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-26 23:13:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 23:13:04,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:04,924 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] [2019-12-26 23:13:04,925 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:04,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-26 23:13:04,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:04,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329855855] [2019-12-26 23:13:04,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:05,017 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-26 23:13:05,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329855855] [2019-12-26 23:13:05,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:05,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:05,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956296455] [2019-12-26 23:13:05,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:13:05,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:13:05,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:13:05,020 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-26 23:13:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:05,918 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-26 23:13:05,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:13:05,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-26 23:13:05,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:05,937 INFO L225 Difference]: With dead ends: 13152 [2019-12-26 23:13:05,937 INFO L226 Difference]: Without dead ends: 13152 [2019-12-26 23:13:05,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-26 23:13:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-26 23:13:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-26 23:13:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-26 23:13:06,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-26 23:13:06,149 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-26 23:13:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:06,150 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-26 23:13:06,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:13:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-26 23:13:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 23:13:06,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:06,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:13:06,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-26 23:13:06,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:06,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282895733] [2019-12-26 23:13:06,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:06,326 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-26 23:13:06,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282895733] [2019-12-26 23:13:06,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:06,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:13:06,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439461962] [2019-12-26 23:13:06,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:13:06,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:06,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:13:06,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:13:06,329 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-26 23:13:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:06,501 INFO L93 Difference]: Finished difference Result 13209 states and 31846 transitions. [2019-12-26 23:13:06,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:13:06,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-26 23:13:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:06,520 INFO L225 Difference]: With dead ends: 13209 [2019-12-26 23:13:06,521 INFO L226 Difference]: Without dead ends: 13009 [2019-12-26 23:13:06,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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-26 23:13:06,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13009 states. [2019-12-26 23:13:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13009 to 12709. [2019-12-26 23:13:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12709 states. [2019-12-26 23:13:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12709 states to 12709 states and 30712 transitions. [2019-12-26 23:13:07,778 INFO L78 Accepts]: Start accepts. Automaton has 12709 states and 30712 transitions. Word has length 58 [2019-12-26 23:13:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:07,779 INFO L462 AbstractCegarLoop]: Abstraction has 12709 states and 30712 transitions. [2019-12-26 23:13:07,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:13:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12709 states and 30712 transitions. [2019-12-26 23:13:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:13:07,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:07,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:13:07,790 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1587335685, now seen corresponding path program 1 times [2019-12-26 23:13:07,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:07,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441714317] [2019-12-26 23:13:07,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:07,896 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-26 23:13:07,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441714317] [2019-12-26 23:13:07,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:07,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:13:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363881513] [2019-12-26 23:13:07,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:13:07,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:07,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:13:07,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:13:07,899 INFO L87 Difference]: Start difference. First operand 12709 states and 30712 transitions. Second operand 5 states. [2019-12-26 23:13:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:07,957 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-26 23:13:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:13:07,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-26 23:13:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:07,967 INFO L225 Difference]: With dead ends: 5405 [2019-12-26 23:13:07,967 INFO L226 Difference]: Without dead ends: 5151 [2019-12-26 23:13:07,968 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-26 23:13:07,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-26 23:13:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-26 23:13:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-26 23:13:08,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-26 23:13:08,080 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 64 [2019-12-26 23:13:08,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:08,082 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-26 23:13:08,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:13:08,082 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-26 23:13:08,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:08,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:08,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:08,095 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:08,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:08,096 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-26 23:13:08,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:08,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576734987] [2019-12-26 23:13:08,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:08,269 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-26 23:13:08,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576734987] [2019-12-26 23:13:08,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:08,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:08,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120806814] [2019-12-26 23:13:08,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:08,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:08,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:08,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:08,272 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-26 23:13:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:09,018 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-26 23:13:09,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:13:09,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:13:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:09,028 INFO L225 Difference]: With dead ends: 6626 [2019-12-26 23:13:09,028 INFO L226 Difference]: Without dead ends: 6626 [2019-12-26 23:13:09,028 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-26 23:13:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-26 23:13:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-26 23:13:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-26 23:13:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-26 23:13:09,099 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-26 23:13:09,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:09,100 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-26 23:13:09,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-26 23:13:09,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:09,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:09,108 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-26 23:13:09,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-26 23:13:09,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:09,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743333985] [2019-12-26 23:13:09,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:09,225 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-26 23:13:09,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743333985] [2019-12-26 23:13:09,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:09,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:09,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391566637] [2019-12-26 23:13:09,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:09,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:09,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:09,227 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-26 23:13:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:10,328 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-26 23:13:10,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:10,328 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:13:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:10,342 INFO L225 Difference]: With dead ends: 7484 [2019-12-26 23:13:10,343 INFO L226 Difference]: Without dead ends: 7484 [2019-12-26 23:13:10,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:10,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-26 23:13:10,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-26 23:13:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-26 23:13:10,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-26 23:13:10,506 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-26 23:13:10,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:10,507 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-26 23:13:10,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:10,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-26 23:13:10,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:10,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:10,523 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-26 23:13:10,524 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:10,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:10,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-26 23:13:10,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:10,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425176050] [2019-12-26 23:13:10,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:13:10,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425176050] [2019-12-26 23:13:10,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:10,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:10,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408538539] [2019-12-26 23:13:10,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:13:10,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:10,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:13:10,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:13:10,645 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-26 23:13:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:11,198 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-26 23:13:11,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:13:11,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-26 23:13:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:11,209 INFO L225 Difference]: With dead ends: 7181 [2019-12-26 23:13:11,209 INFO L226 Difference]: Without dead ends: 7181 [2019-12-26 23:13:11,209 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-26 23:13:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-26 23:13:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-26 23:13:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-26 23:13:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-26 23:13:11,290 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-26 23:13:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:11,290 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-26 23:13:11,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:13:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-26 23:13:11,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:11,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:11,297 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-26 23:13:11,297 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:11,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-26 23:13:11,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:11,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569530107] [2019-12-26 23:13:11,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:11,407 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-26 23:13:11,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569530107] [2019-12-26 23:13:11,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:11,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:11,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014085740] [2019-12-26 23:13:11,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:11,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:11,409 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 6 states. [2019-12-26 23:13:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:12,088 INFO L93 Difference]: Finished difference Result 7132 states and 16535 transitions. [2019-12-26 23:13:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:13:12,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:13:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:12,098 INFO L225 Difference]: With dead ends: 7132 [2019-12-26 23:13:12,098 INFO L226 Difference]: Without dead ends: 7132 [2019-12-26 23:13:12,099 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-26 23:13:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7132 states. [2019-12-26 23:13:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7132 to 6891. [2019-12-26 23:13:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6891 states. [2019-12-26 23:13:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6891 states to 6891 states and 16087 transitions. [2019-12-26 23:13:13,736 INFO L78 Accepts]: Start accepts. Automaton has 6891 states and 16087 transitions. Word has length 94 [2019-12-26 23:13:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:13,736 INFO L462 AbstractCegarLoop]: Abstraction has 6891 states and 16087 transitions. [2019-12-26 23:13:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 6891 states and 16087 transitions. [2019-12-26 23:13:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:13,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:13,745 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-26 23:13:13,745 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-26 23:13:13,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:13,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843889759] [2019-12-26 23:13:13,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:13,859 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-26 23:13:13,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843889759] [2019-12-26 23:13:13,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:13,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:13,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588015467] [2019-12-26 23:13:13,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:13,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:13,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:13,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:13,862 INFO L87 Difference]: Start difference. First operand 6891 states and 16087 transitions. Second operand 7 states. [2019-12-26 23:13:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:14,698 INFO L93 Difference]: Finished difference Result 19479 states and 46072 transitions. [2019-12-26 23:13:14,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:13:14,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:13:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:14,720 INFO L225 Difference]: With dead ends: 19479 [2019-12-26 23:13:14,721 INFO L226 Difference]: Without dead ends: 19479 [2019-12-26 23:13:14,721 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-26 23:13:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19479 states. [2019-12-26 23:13:14,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19479 to 7369. [2019-12-26 23:13:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7369 states. [2019-12-26 23:13:14,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7369 states to 7369 states and 17329 transitions. [2019-12-26 23:13:14,859 INFO L78 Accepts]: Start accepts. Automaton has 7369 states and 17329 transitions. Word has length 94 [2019-12-26 23:13:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:14,861 INFO L462 AbstractCegarLoop]: Abstraction has 7369 states and 17329 transitions. [2019-12-26 23:13:14,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:14,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7369 states and 17329 transitions. [2019-12-26 23:13:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:14,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:14,871 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-26 23:13:14,871 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:14,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1832696303, now seen corresponding path program 6 times [2019-12-26 23:13:14,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:14,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710723184] [2019-12-26 23:13:14,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:14,979 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-26 23:13:14,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710723184] [2019-12-26 23:13:14,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:14,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:14,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135375012] [2019-12-26 23:13:14,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:14,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:14,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:14,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:14,981 INFO L87 Difference]: Start difference. First operand 7369 states and 17329 transitions. Second operand 6 states. [2019-12-26 23:13:15,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:15,897 INFO L93 Difference]: Finished difference Result 12275 states and 28172 transitions. [2019-12-26 23:13:15,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:15,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:13:15,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:15,913 INFO L225 Difference]: With dead ends: 12275 [2019-12-26 23:13:15,913 INFO L226 Difference]: Without dead ends: 12275 [2019-12-26 23:13:15,913 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-26 23:13:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12275 states. [2019-12-26 23:13:16,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12275 to 9247. [2019-12-26 23:13:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9247 states. [2019-12-26 23:13:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9247 states to 9247 states and 21913 transitions. [2019-12-26 23:13:16,038 INFO L78 Accepts]: Start accepts. Automaton has 9247 states and 21913 transitions. Word has length 94 [2019-12-26 23:13:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 9247 states and 21913 transitions. [2019-12-26 23:13:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9247 states and 21913 transitions. [2019-12-26 23:13:16,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:16,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:16,048 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-26 23:13:16,048 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 7 times [2019-12-26 23:13:16,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:16,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495010770] [2019-12-26 23:13:16,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:16,151 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-26 23:13:16,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495010770] [2019-12-26 23:13:16,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:16,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:16,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686599111] [2019-12-26 23:13:16,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:16,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:16,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:16,154 INFO L87 Difference]: Start difference. First operand 9247 states and 21913 transitions. Second operand 6 states. [2019-12-26 23:13:16,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:16,900 INFO L93 Difference]: Finished difference Result 9697 states and 22790 transitions. [2019-12-26 23:13:16,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:13:16,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-26 23:13:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:16,914 INFO L225 Difference]: With dead ends: 9697 [2019-12-26 23:13:16,914 INFO L226 Difference]: Without dead ends: 9697 [2019-12-26 23:13:16,917 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-26 23:13:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9697 states. [2019-12-26 23:13:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9697 to 9359. [2019-12-26 23:13:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9359 states. [2019-12-26 23:13:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9359 states to 9359 states and 22142 transitions. [2019-12-26 23:13:17,077 INFO L78 Accepts]: Start accepts. Automaton has 9359 states and 22142 transitions. Word has length 94 [2019-12-26 23:13:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:17,078 INFO L462 AbstractCegarLoop]: Abstraction has 9359 states and 22142 transitions. [2019-12-26 23:13:17,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 9359 states and 22142 transitions. [2019-12-26 23:13:17,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:17,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:17,090 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-26 23:13:17,090 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2023312549, now seen corresponding path program 8 times [2019-12-26 23:13:17,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:17,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111510738] [2019-12-26 23:13:17,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:17,222 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-26 23:13:17,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111510738] [2019-12-26 23:13:17,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:17,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:17,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115092917] [2019-12-26 23:13:17,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:17,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:17,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:17,224 INFO L87 Difference]: Start difference. First operand 9359 states and 22142 transitions. Second operand 7 states. [2019-12-26 23:13:18,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:18,257 INFO L93 Difference]: Finished difference Result 12350 states and 28323 transitions. [2019-12-26 23:13:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:13:18,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:13:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:18,271 INFO L225 Difference]: With dead ends: 12350 [2019-12-26 23:13:18,272 INFO L226 Difference]: Without dead ends: 12350 [2019-12-26 23:13:18,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:13:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12350 states. [2019-12-26 23:13:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12350 to 9199. [2019-12-26 23:13:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9199 states. [2019-12-26 23:13:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9199 states to 9199 states and 21782 transitions. [2019-12-26 23:13:18,390 INFO L78 Accepts]: Start accepts. Automaton has 9199 states and 21782 transitions. Word has length 94 [2019-12-26 23:13:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:18,390 INFO L462 AbstractCegarLoop]: Abstraction has 9199 states and 21782 transitions. [2019-12-26 23:13:18,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:18,390 INFO L276 IsEmpty]: Start isEmpty. Operand 9199 states and 21782 transitions. [2019-12-26 23:13:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:18,400 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:18,400 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-26 23:13:18,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -171487305, now seen corresponding path program 9 times [2019-12-26 23:13:18,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:18,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101621276] [2019-12-26 23:13:18,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:18,503 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-26 23:13:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101621276] [2019-12-26 23:13:18,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:18,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:18,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722798031] [2019-12-26 23:13:18,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:18,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:18,505 INFO L87 Difference]: Start difference. First operand 9199 states and 21782 transitions. Second operand 7 states. [2019-12-26 23:13:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:19,439 INFO L93 Difference]: Finished difference Result 12949 states and 30242 transitions. [2019-12-26 23:13:19,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:13:19,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:13:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:19,454 INFO L225 Difference]: With dead ends: 12949 [2019-12-26 23:13:19,454 INFO L226 Difference]: Without dead ends: 12949 [2019-12-26 23:13:19,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12949 states. [2019-12-26 23:13:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12949 to 9286. [2019-12-26 23:13:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9286 states. [2019-12-26 23:13:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9286 states to 9286 states and 21992 transitions. [2019-12-26 23:13:19,568 INFO L78 Accepts]: Start accepts. Automaton has 9286 states and 21992 transitions. Word has length 94 [2019-12-26 23:13:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:19,569 INFO L462 AbstractCegarLoop]: Abstraction has 9286 states and 21992 transitions. [2019-12-26 23:13:19,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 9286 states and 21992 transitions. [2019-12-26 23:13:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-26 23:13:19,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:19,583 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-26 23:13:19,584 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash 340897079, now seen corresponding path program 10 times [2019-12-26 23:13:19,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:19,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370507305] [2019-12-26 23:13:19,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:19,670 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-26 23:13:19,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370507305] [2019-12-26 23:13:19,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:19,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:19,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871058169] [2019-12-26 23:13:19,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:13:19,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:19,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:13:19,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:13:19,672 INFO L87 Difference]: Start difference. First operand 9286 states and 21992 transitions. Second operand 7 states. [2019-12-26 23:13:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:20,688 INFO L93 Difference]: Finished difference Result 12337 states and 28790 transitions. [2019-12-26 23:13:20,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:20,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-26 23:13:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:20,704 INFO L225 Difference]: With dead ends: 12337 [2019-12-26 23:13:20,704 INFO L226 Difference]: Without dead ends: 12337 [2019-12-26 23:13:20,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12337 states. [2019-12-26 23:13:20,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12337 to 9232. [2019-12-26 23:13:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9232 states. [2019-12-26 23:13:20,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9232 states to 9232 states and 21869 transitions. [2019-12-26 23:13:20,816 INFO L78 Accepts]: Start accepts. Automaton has 9232 states and 21869 transitions. Word has length 94 [2019-12-26 23:13:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:20,816 INFO L462 AbstractCegarLoop]: Abstraction has 9232 states and 21869 transitions. [2019-12-26 23:13:20,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:13:20,816 INFO L276 IsEmpty]: Start isEmpty. Operand 9232 states and 21869 transitions. [2019-12-26 23:13:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:13:20,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:20,824 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-26 23:13:20,824 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:20,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 1 times [2019-12-26 23:13:20,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:20,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908604041] [2019-12-26 23:13:20,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:20,889 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-26 23:13:20,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908604041] [2019-12-26 23:13:20,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:20,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:13:20,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648404533] [2019-12-26 23:13:20,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:13:20,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:20,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:13:20,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:13:20,891 INFO L87 Difference]: Start difference. First operand 9232 states and 21869 transitions. Second operand 3 states. [2019-12-26 23:13:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:20,946 INFO L93 Difference]: Finished difference Result 9232 states and 21868 transitions. [2019-12-26 23:13:20,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:13:20,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-26 23:13:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:20,958 INFO L225 Difference]: With dead ends: 9232 [2019-12-26 23:13:20,959 INFO L226 Difference]: Without dead ends: 9232 [2019-12-26 23:13:20,959 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-26 23:13:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-12-26 23:13:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 8865. [2019-12-26 23:13:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8865 states. [2019-12-26 23:13:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 21136 transitions. [2019-12-26 23:13:21,149 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 21136 transitions. Word has length 95 [2019-12-26 23:13:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:21,149 INFO L462 AbstractCegarLoop]: Abstraction has 8865 states and 21136 transitions. [2019-12-26 23:13:21,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:13:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 21136 transitions. [2019-12-26 23:13:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:13:21,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:21,165 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-26 23:13:21,165 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-26 23:13:21,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:21,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183756297] [2019-12-26 23:13:21,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:21,478 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-26 23:13:21,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183756297] [2019-12-26 23:13:21,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:21,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:21,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963368339] [2019-12-26 23:13:21,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:21,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:21,483 INFO L87 Difference]: Start difference. First operand 8865 states and 21136 transitions. Second operand 9 states. [2019-12-26 23:13:22,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:22,300 INFO L93 Difference]: Finished difference Result 15510 states and 36799 transitions. [2019-12-26 23:13:22,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:13:22,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-26 23:13:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:22,316 INFO L225 Difference]: With dead ends: 15510 [2019-12-26 23:13:22,316 INFO L226 Difference]: Without dead ends: 12898 [2019-12-26 23:13:22,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:13:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12898 states. [2019-12-26 23:13:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12898 to 10644. [2019-12-26 23:13:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10644 states. [2019-12-26 23:13:22,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10644 states to 10644 states and 25526 transitions. [2019-12-26 23:13:22,445 INFO L78 Accepts]: Start accepts. Automaton has 10644 states and 25526 transitions. Word has length 95 [2019-12-26 23:13:22,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:22,445 INFO L462 AbstractCegarLoop]: Abstraction has 10644 states and 25526 transitions. [2019-12-26 23:13:22,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 10644 states and 25526 transitions. [2019-12-26 23:13:22,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:13:22,454 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:22,454 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-26 23:13:22,455 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:22,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:22,455 INFO L82 PathProgramCache]: Analyzing trace with hash 283458299, now seen corresponding path program 2 times [2019-12-26 23:13:22,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:22,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817530940] [2019-12-26 23:13:22,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:22,613 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-26 23:13:22,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817530940] [2019-12-26 23:13:22,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:22,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:22,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412369737] [2019-12-26 23:13:22,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:22,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:22,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:22,615 INFO L87 Difference]: Start difference. First operand 10644 states and 25526 transitions. Second operand 10 states. [2019-12-26 23:13:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:23,640 INFO L93 Difference]: Finished difference Result 17379 states and 41516 transitions. [2019-12-26 23:13:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:13:23,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-26 23:13:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:23,659 INFO L225 Difference]: With dead ends: 17379 [2019-12-26 23:13:23,659 INFO L226 Difference]: Without dead ends: 15524 [2019-12-26 23:13:23,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:13:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15524 states. [2019-12-26 23:13:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15524 to 10834. [2019-12-26 23:13:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10834 states. [2019-12-26 23:13:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10834 states to 10834 states and 25975 transitions. [2019-12-26 23:13:23,808 INFO L78 Accepts]: Start accepts. Automaton has 10834 states and 25975 transitions. Word has length 95 [2019-12-26 23:13:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:23,808 INFO L462 AbstractCegarLoop]: Abstraction has 10834 states and 25975 transitions. [2019-12-26 23:13:23,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 10834 states and 25975 transitions. [2019-12-26 23:13:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-26 23:13:23,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:23,818 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-26 23:13:23,818 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1595101307, now seen corresponding path program 3 times [2019-12-26 23:13:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389957041] [2019-12-26 23:13:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:23,887 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-26 23:13:23,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389957041] [2019-12-26 23:13:23,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:23,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:13:23,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566360618] [2019-12-26 23:13:23,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:13:23,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:23,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:13:23,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:13:23,889 INFO L87 Difference]: Start difference. First operand 10834 states and 25975 transitions. Second operand 4 states. [2019-12-26 23:13:24,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:24,273 INFO L93 Difference]: Finished difference Result 12625 states and 30125 transitions. [2019-12-26 23:13:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:13:24,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-26 23:13:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:24,290 INFO L225 Difference]: With dead ends: 12625 [2019-12-26 23:13:24,290 INFO L226 Difference]: Without dead ends: 12625 [2019-12-26 23:13:24,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:13:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2019-12-26 23:13:24,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 10641. [2019-12-26 23:13:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10641 states. [2019-12-26 23:13:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10641 states to 10641 states and 25427 transitions. [2019-12-26 23:13:24,419 INFO L78 Accepts]: Start accepts. Automaton has 10641 states and 25427 transitions. Word has length 95 [2019-12-26 23:13:24,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:24,419 INFO L462 AbstractCegarLoop]: Abstraction has 10641 states and 25427 transitions. [2019-12-26 23:13:24,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:13:24,419 INFO L276 IsEmpty]: Start isEmpty. Operand 10641 states and 25427 transitions. [2019-12-26 23:13:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:24,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:24,429 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-26 23:13:24,429 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-26 23:13:24,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:24,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556902848] [2019-12-26 23:13:24,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:24,527 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-26 23:13:24,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556902848] [2019-12-26 23:13:24,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:24,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:24,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375783548] [2019-12-26 23:13:24,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:24,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:24,529 INFO L87 Difference]: Start difference. First operand 10641 states and 25427 transitions. Second operand 6 states. [2019-12-26 23:13:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:24,763 INFO L93 Difference]: Finished difference Result 12572 states and 29661 transitions. [2019-12-26 23:13:24,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:24,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:13:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:24,778 INFO L225 Difference]: With dead ends: 12572 [2019-12-26 23:13:24,779 INFO L226 Difference]: Without dead ends: 11301 [2019-12-26 23:13:24,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11301 states. [2019-12-26 23:13:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11301 to 10801. [2019-12-26 23:13:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10801 states. [2019-12-26 23:13:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10801 states to 10801 states and 25818 transitions. [2019-12-26 23:13:24,932 INFO L78 Accepts]: Start accepts. Automaton has 10801 states and 25818 transitions. Word has length 96 [2019-12-26 23:13:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:24,932 INFO L462 AbstractCegarLoop]: Abstraction has 10801 states and 25818 transitions. [2019-12-26 23:13:24,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:24,933 INFO L276 IsEmpty]: Start isEmpty. Operand 10801 states and 25818 transitions. [2019-12-26 23:13:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:24,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:24,942 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-26 23:13:24,943 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-26 23:13:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658597388] [2019-12-26 23:13:24,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:25,033 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-26 23:13:25,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658597388] [2019-12-26 23:13:25,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:25,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:25,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719813994] [2019-12-26 23:13:25,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:13:25,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:25,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:13:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:13:25,035 INFO L87 Difference]: Start difference. First operand 10801 states and 25818 transitions. Second operand 5 states. [2019-12-26 23:13:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:25,665 INFO L93 Difference]: Finished difference Result 13184 states and 31614 transitions. [2019-12-26 23:13:25,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:13:25,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-26 23:13:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:25,685 INFO L225 Difference]: With dead ends: 13184 [2019-12-26 23:13:25,685 INFO L226 Difference]: Without dead ends: 13184 [2019-12-26 23:13:25,686 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-26 23:13:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13184 states. [2019-12-26 23:13:25,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13184 to 11232. [2019-12-26 23:13:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11232 states. [2019-12-26 23:13:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11232 states to 11232 states and 26895 transitions. [2019-12-26 23:13:25,852 INFO L78 Accepts]: Start accepts. Automaton has 11232 states and 26895 transitions. Word has length 96 [2019-12-26 23:13:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:25,852 INFO L462 AbstractCegarLoop]: Abstraction has 11232 states and 26895 transitions. [2019-12-26 23:13:25,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:13:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11232 states and 26895 transitions. [2019-12-26 23:13:25,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:25,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:25,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:25,864 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 3 times [2019-12-26 23:13:25,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:25,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091702027] [2019-12-26 23:13:25,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:26,039 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-26 23:13:26,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091702027] [2019-12-26 23:13:26,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:26,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:26,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028418039] [2019-12-26 23:13:26,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:26,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:26,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:26,041 INFO L87 Difference]: Start difference. First operand 11232 states and 26895 transitions. Second operand 10 states. [2019-12-26 23:13:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:27,022 INFO L93 Difference]: Finished difference Result 20017 states and 47594 transitions. [2019-12-26 23:13:27,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:13:27,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:13:27,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:27,044 INFO L225 Difference]: With dead ends: 20017 [2019-12-26 23:13:27,044 INFO L226 Difference]: Without dead ends: 18742 [2019-12-26 23:13:27,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:13:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18742 states. [2019-12-26 23:13:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18742 to 13580. [2019-12-26 23:13:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13580 states. [2019-12-26 23:13:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13580 states to 13580 states and 33209 transitions. [2019-12-26 23:13:27,241 INFO L78 Accepts]: Start accepts. Automaton has 13580 states and 33209 transitions. Word has length 96 [2019-12-26 23:13:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:27,241 INFO L462 AbstractCegarLoop]: Abstraction has 13580 states and 33209 transitions. [2019-12-26 23:13:27,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:27,242 INFO L276 IsEmpty]: Start isEmpty. Operand 13580 states and 33209 transitions. [2019-12-26 23:13:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:27,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:27,254 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-26 23:13:27,254 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:27,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1281102864, now seen corresponding path program 4 times [2019-12-26 23:13:27,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:27,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152983274] [2019-12-26 23:13:27,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:27,397 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-26 23:13:27,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152983274] [2019-12-26 23:13:27,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:27,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:27,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517404414] [2019-12-26 23:13:27,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:27,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:27,399 INFO L87 Difference]: Start difference. First operand 13580 states and 33209 transitions. Second operand 9 states. [2019-12-26 23:13:27,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:27,870 INFO L93 Difference]: Finished difference Result 17509 states and 42192 transitions. [2019-12-26 23:13:27,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:13:27,870 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:13:27,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:27,895 INFO L225 Difference]: With dead ends: 17509 [2019-12-26 23:13:27,895 INFO L226 Difference]: Without dead ends: 16261 [2019-12-26 23:13:27,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:13:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16261 states. [2019-12-26 23:13:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16261 to 14243. [2019-12-26 23:13:28,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14243 states. [2019-12-26 23:13:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14243 states to 14243 states and 34829 transitions. [2019-12-26 23:13:28,265 INFO L78 Accepts]: Start accepts. Automaton has 14243 states and 34829 transitions. Word has length 96 [2019-12-26 23:13:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:28,266 INFO L462 AbstractCegarLoop]: Abstraction has 14243 states and 34829 transitions. [2019-12-26 23:13:28,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 14243 states and 34829 transitions. [2019-12-26 23:13:28,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:28,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:28,287 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-26 23:13:28,287 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:28,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-26 23:13:28,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:28,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454663240] [2019-12-26 23:13:28,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:28,500 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-26 23:13:28,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454663240] [2019-12-26 23:13:28,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:28,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:28,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10919175] [2019-12-26 23:13:28,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:28,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:28,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:28,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:28,506 INFO L87 Difference]: Start difference. First operand 14243 states and 34829 transitions. Second operand 10 states. [2019-12-26 23:13:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:29,494 INFO L93 Difference]: Finished difference Result 27347 states and 65612 transitions. [2019-12-26 23:13:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:13:29,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:13:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:29,526 INFO L225 Difference]: With dead ends: 27347 [2019-12-26 23:13:29,526 INFO L226 Difference]: Without dead ends: 26692 [2019-12-26 23:13:29,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:13:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26692 states. [2019-12-26 23:13:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26692 to 16534. [2019-12-26 23:13:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16534 states. [2019-12-26 23:13:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16534 states to 16534 states and 40420 transitions. [2019-12-26 23:13:29,797 INFO L78 Accepts]: Start accepts. Automaton has 16534 states and 40420 transitions. Word has length 96 [2019-12-26 23:13:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:29,797 INFO L462 AbstractCegarLoop]: Abstraction has 16534 states and 40420 transitions. [2019-12-26 23:13:29,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 16534 states and 40420 transitions. [2019-12-26 23:13:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:29,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:29,813 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-26 23:13:29,813 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:29,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1826167002, now seen corresponding path program 6 times [2019-12-26 23:13:29,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:29,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710185156] [2019-12-26 23:13:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:29,995 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-26 23:13:29,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710185156] [2019-12-26 23:13:29,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:29,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:13:29,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454904564] [2019-12-26 23:13:29,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:13:29,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:29,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:13:29,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:29,997 INFO L87 Difference]: Start difference. First operand 16534 states and 40420 transitions. Second operand 12 states. [2019-12-26 23:13:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:31,544 INFO L93 Difference]: Finished difference Result 35741 states and 88154 transitions. [2019-12-26 23:13:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:13:31,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-26 23:13:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:31,577 INFO L225 Difference]: With dead ends: 35741 [2019-12-26 23:13:31,578 INFO L226 Difference]: Without dead ends: 30890 [2019-12-26 23:13:31,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2019-12-26 23:13:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30890 states. [2019-12-26 23:13:31,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30890 to 23395. [2019-12-26 23:13:31,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23395 states. [2019-12-26 23:13:31,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23395 states to 23395 states and 58460 transitions. [2019-12-26 23:13:31,902 INFO L78 Accepts]: Start accepts. Automaton has 23395 states and 58460 transitions. Word has length 96 [2019-12-26 23:13:31,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:31,902 INFO L462 AbstractCegarLoop]: Abstraction has 23395 states and 58460 transitions. [2019-12-26 23:13:31,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:13:31,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23395 states and 58460 transitions. [2019-12-26 23:13:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:31,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:31,928 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:31,929 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 7 times [2019-12-26 23:13:31,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:31,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505523866] [2019-12-26 23:13:31,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:32,343 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-26 23:13:32,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505523866] [2019-12-26 23:13:32,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:32,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:13:32,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239994082] [2019-12-26 23:13:32,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:13:32,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:32,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:13:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:13:32,346 INFO L87 Difference]: Start difference. First operand 23395 states and 58460 transitions. Second operand 18 states. [2019-12-26 23:13:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:35,367 INFO L93 Difference]: Finished difference Result 26321 states and 65409 transitions. [2019-12-26 23:13:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:13:35,367 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-26 23:13:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:35,398 INFO L225 Difference]: With dead ends: 26321 [2019-12-26 23:13:35,398 INFO L226 Difference]: Without dead ends: 26280 [2019-12-26 23:13:35,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:13:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26280 states. [2019-12-26 23:13:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26280 to 24852. [2019-12-26 23:13:35,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24852 states. [2019-12-26 23:13:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24852 states to 24852 states and 62245 transitions. [2019-12-26 23:13:35,817 INFO L78 Accepts]: Start accepts. Automaton has 24852 states and 62245 transitions. Word has length 96 [2019-12-26 23:13:35,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:35,817 INFO L462 AbstractCegarLoop]: Abstraction has 24852 states and 62245 transitions. [2019-12-26 23:13:35,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:13:35,817 INFO L276 IsEmpty]: Start isEmpty. Operand 24852 states and 62245 transitions. [2019-12-26 23:13:35,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:35,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:35,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:35,841 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:35,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1841780696, now seen corresponding path program 8 times [2019-12-26 23:13:35,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:35,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410438994] [2019-12-26 23:13:35,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:36,106 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-26 23:13:36,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410438994] [2019-12-26 23:13:36,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:36,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:13:36,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967416372] [2019-12-26 23:13:36,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:13:36,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:13:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:36,108 INFO L87 Difference]: Start difference. First operand 24852 states and 62245 transitions. Second operand 13 states. [2019-12-26 23:13:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:36,877 INFO L93 Difference]: Finished difference Result 29398 states and 73249 transitions. [2019-12-26 23:13:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:13:36,877 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-26 23:13:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:36,912 INFO L225 Difference]: With dead ends: 29398 [2019-12-26 23:13:36,912 INFO L226 Difference]: Without dead ends: 29368 [2019-12-26 23:13:36,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:13:36,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29368 states. [2019-12-26 23:13:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29368 to 26551. [2019-12-26 23:13:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26551 states. [2019-12-26 23:13:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26551 states to 26551 states and 66513 transitions. [2019-12-26 23:13:37,287 INFO L78 Accepts]: Start accepts. Automaton has 26551 states and 66513 transitions. Word has length 96 [2019-12-26 23:13:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:37,287 INFO L462 AbstractCegarLoop]: Abstraction has 26551 states and 66513 transitions. [2019-12-26 23:13:37,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:13:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 26551 states and 66513 transitions. [2019-12-26 23:13:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:37,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:37,311 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-26 23:13:37,311 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:37,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash -82268492, now seen corresponding path program 9 times [2019-12-26 23:13:37,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:37,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128284236] [2019-12-26 23:13:37,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:37,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-26 23:13:37,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128284236] [2019-12-26 23:13:37,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:37,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:13:37,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175349734] [2019-12-26 23:13:37,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:37,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:37,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:37,393 INFO L87 Difference]: Start difference. First operand 26551 states and 66513 transitions. Second operand 6 states. [2019-12-26 23:13:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:38,076 INFO L93 Difference]: Finished difference Result 27307 states and 68025 transitions. [2019-12-26 23:13:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:13:38,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:13:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:38,108 INFO L225 Difference]: With dead ends: 27307 [2019-12-26 23:13:38,108 INFO L226 Difference]: Without dead ends: 27307 [2019-12-26 23:13:38,109 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-26 23:13:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27307 states. [2019-12-26 23:13:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27307 to 26646. [2019-12-26 23:13:38,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26646 states. [2019-12-26 23:13:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26646 states to 26646 states and 66719 transitions. [2019-12-26 23:13:38,554 INFO L78 Accepts]: Start accepts. Automaton has 26646 states and 66719 transitions. Word has length 96 [2019-12-26 23:13:38,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:38,554 INFO L462 AbstractCegarLoop]: Abstraction has 26646 states and 66719 transitions. [2019-12-26 23:13:38,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 26646 states and 66719 transitions. [2019-12-26 23:13:38,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:38,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:38,579 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-26 23:13:38,579 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:38,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:38,579 INFO L82 PathProgramCache]: Analyzing trace with hash 681291876, now seen corresponding path program 10 times [2019-12-26 23:13:38,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:38,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608028174] [2019-12-26 23:13:38,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:38,733 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-26 23:13:38,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608028174] [2019-12-26 23:13:38,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:38,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:13:38,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107755782] [2019-12-26 23:13:38,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:13:38,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:13:38,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:13:38,734 INFO L87 Difference]: Start difference. First operand 26646 states and 66719 transitions. Second operand 10 states. [2019-12-26 23:13:39,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:39,819 INFO L93 Difference]: Finished difference Result 41724 states and 102017 transitions. [2019-12-26 23:13:39,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:13:39,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-26 23:13:39,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:39,865 INFO L225 Difference]: With dead ends: 41724 [2019-12-26 23:13:39,865 INFO L226 Difference]: Without dead ends: 39881 [2019-12-26 23:13:39,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:13:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39881 states. [2019-12-26 23:13:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39881 to 29058. [2019-12-26 23:13:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29058 states. [2019-12-26 23:13:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29058 states to 29058 states and 72929 transitions. [2019-12-26 23:13:40,282 INFO L78 Accepts]: Start accepts. Automaton has 29058 states and 72929 transitions. Word has length 96 [2019-12-26 23:13:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:40,282 INFO L462 AbstractCegarLoop]: Abstraction has 29058 states and 72929 transitions. [2019-12-26 23:13:40,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:13:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 29058 states and 72929 transitions. [2019-12-26 23:13:40,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:40,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:40,309 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-26 23:13:40,309 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1560206146, now seen corresponding path program 11 times [2019-12-26 23:13:40,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:40,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819292538] [2019-12-26 23:13:40,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:40,574 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-12-26 23:13:40,629 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-26 23:13:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819292538] [2019-12-26 23:13:40,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:40,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:13:40,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948706585] [2019-12-26 23:13:40,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:13:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:40,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:13:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:13:40,631 INFO L87 Difference]: Start difference. First operand 29058 states and 72929 transitions. Second operand 8 states. [2019-12-26 23:13:41,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:41,256 INFO L93 Difference]: Finished difference Result 37727 states and 94592 transitions. [2019-12-26 23:13:41,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:13:41,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-26 23:13:41,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:41,304 INFO L225 Difference]: With dead ends: 37727 [2019-12-26 23:13:41,305 INFO L226 Difference]: Without dead ends: 34643 [2019-12-26 23:13:41,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:13:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34643 states. [2019-12-26 23:13:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34643 to 30024. [2019-12-26 23:13:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30024 states. [2019-12-26 23:13:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30024 states to 30024 states and 75221 transitions. [2019-12-26 23:13:41,717 INFO L78 Accepts]: Start accepts. Automaton has 30024 states and 75221 transitions. Word has length 96 [2019-12-26 23:13:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:41,717 INFO L462 AbstractCegarLoop]: Abstraction has 30024 states and 75221 transitions. [2019-12-26 23:13:41,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:13:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 30024 states and 75221 transitions. [2019-12-26 23:13:41,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:41,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:41,750 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-26 23:13:41,750 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:41,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:41,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1463895870, now seen corresponding path program 12 times [2019-12-26 23:13:41,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:41,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189909741] [2019-12-26 23:13:41,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:42,073 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-26 23:13:42,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189909741] [2019-12-26 23:13:42,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:42,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:13:42,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565132055] [2019-12-26 23:13:42,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-26 23:13:42,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-26 23:13:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:13:42,075 INFO L87 Difference]: Start difference. First operand 30024 states and 75221 transitions. Second operand 17 states. [2019-12-26 23:13:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:45,142 INFO L93 Difference]: Finished difference Result 43192 states and 108032 transitions. [2019-12-26 23:13:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 23:13:45,143 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-26 23:13:45,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:45,193 INFO L225 Difference]: With dead ends: 43192 [2019-12-26 23:13:45,194 INFO L226 Difference]: Without dead ends: 40153 [2019-12-26 23:13:45,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1132, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 23:13:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40153 states. [2019-12-26 23:13:45,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40153 to 30579. [2019-12-26 23:13:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30579 states. [2019-12-26 23:13:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30579 states to 30579 states and 76658 transitions. [2019-12-26 23:13:45,648 INFO L78 Accepts]: Start accepts. Automaton has 30579 states and 76658 transitions. Word has length 96 [2019-12-26 23:13:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:45,648 INFO L462 AbstractCegarLoop]: Abstraction has 30579 states and 76658 transitions. [2019-12-26 23:13:45,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-26 23:13:45,649 INFO L276 IsEmpty]: Start isEmpty. Operand 30579 states and 76658 transitions. [2019-12-26 23:13:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:45,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:45,681 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-26 23:13:45,681 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:45,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1519428418, now seen corresponding path program 13 times [2019-12-26 23:13:45,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:45,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781585929] [2019-12-26 23:13:45,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:45,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-26 23:13:45,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781585929] [2019-12-26 23:13:45,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:45,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:13:45,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505185554] [2019-12-26 23:13:45,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:13:45,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:13:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:13:45,935 INFO L87 Difference]: Start difference. First operand 30579 states and 76658 transitions. Second operand 15 states. [2019-12-26 23:13:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:47,270 INFO L93 Difference]: Finished difference Result 38229 states and 97057 transitions. [2019-12-26 23:13:47,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 23:13:47,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-26 23:13:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:47,316 INFO L225 Difference]: With dead ends: 38229 [2019-12-26 23:13:47,316 INFO L226 Difference]: Without dead ends: 36552 [2019-12-26 23:13:47,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:13:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36552 states. [2019-12-26 23:13:47,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36552 to 26469. [2019-12-26 23:13:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26469 states. [2019-12-26 23:13:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26469 states to 26469 states and 66844 transitions. [2019-12-26 23:13:47,945 INFO L78 Accepts]: Start accepts. Automaton has 26469 states and 66844 transitions. Word has length 96 [2019-12-26 23:13:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:47,946 INFO L462 AbstractCegarLoop]: Abstraction has 26469 states and 66844 transitions. [2019-12-26 23:13:47,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:13:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 26469 states and 66844 transitions. [2019-12-26 23:13:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:47,974 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:47,974 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-26 23:13:47,974 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:47,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:47,975 INFO L82 PathProgramCache]: Analyzing trace with hash 2132573420, now seen corresponding path program 14 times [2019-12-26 23:13:47,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:47,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467784803] [2019-12-26 23:13:47,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:48,372 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-26 23:13:48,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467784803] [2019-12-26 23:13:48,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:48,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-26 23:13:48,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964100467] [2019-12-26 23:13:48,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-26 23:13:48,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-26 23:13:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:13:48,373 INFO L87 Difference]: Start difference. First operand 26469 states and 66844 transitions. Second operand 21 states. [2019-12-26 23:13:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:54,401 INFO L93 Difference]: Finished difference Result 48973 states and 125705 transitions. [2019-12-26 23:13:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-26 23:13:54,402 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 96 [2019-12-26 23:13:54,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:54,457 INFO L225 Difference]: With dead ends: 48973 [2019-12-26 23:13:54,457 INFO L226 Difference]: Without dead ends: 46708 [2019-12-26 23:13:54,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=2784, Unknown=0, NotChecked=0, Total=3192 [2019-12-26 23:13:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46708 states. [2019-12-26 23:13:54,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46708 to 30552. [2019-12-26 23:13:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30552 states. [2019-12-26 23:13:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30552 states to 30552 states and 78158 transitions. [2019-12-26 23:13:55,042 INFO L78 Accepts]: Start accepts. Automaton has 30552 states and 78158 transitions. Word has length 96 [2019-12-26 23:13:55,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:55,042 INFO L462 AbstractCegarLoop]: Abstraction has 30552 states and 78158 transitions. [2019-12-26 23:13:55,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-26 23:13:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30552 states and 78158 transitions. [2019-12-26 23:13:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:55,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:55,082 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-26 23:13:55,083 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1495670690, now seen corresponding path program 15 times [2019-12-26 23:13:55,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:55,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223716715] [2019-12-26 23:13:55,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:55,249 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-26 23:13:55,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223716715] [2019-12-26 23:13:55,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:55,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:13:55,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509054158] [2019-12-26 23:13:55,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:13:55,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:13:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:13:55,251 INFO L87 Difference]: Start difference. First operand 30552 states and 78158 transitions. Second operand 12 states. [2019-12-26 23:13:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:56,607 INFO L93 Difference]: Finished difference Result 44332 states and 113186 transitions. [2019-12-26 23:13:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:13:56,608 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-26 23:13:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:56,660 INFO L225 Difference]: With dead ends: 44332 [2019-12-26 23:13:56,660 INFO L226 Difference]: Without dead ends: 42024 [2019-12-26 23:13:56,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-26 23:13:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42024 states. [2019-12-26 23:13:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42024 to 25414. [2019-12-26 23:13:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25414 states. [2019-12-26 23:13:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25414 states to 25414 states and 64200 transitions. [2019-12-26 23:13:57,073 INFO L78 Accepts]: Start accepts. Automaton has 25414 states and 64200 transitions. Word has length 96 [2019-12-26 23:13:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:57,073 INFO L462 AbstractCegarLoop]: Abstraction has 25414 states and 64200 transitions. [2019-12-26 23:13:57,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:13:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25414 states and 64200 transitions. [2019-12-26 23:13:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:57,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:57,100 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-26 23:13:57,100 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:57,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1245782078, now seen corresponding path program 16 times [2019-12-26 23:13:57,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:57,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376318928] [2019-12-26 23:13:57,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:57,414 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-26 23:13:57,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376318928] [2019-12-26 23:13:57,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:57,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:13:57,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999438009] [2019-12-26 23:13:57,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:13:57,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:13:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:13:57,416 INFO L87 Difference]: Start difference. First operand 25414 states and 64200 transitions. Second operand 6 states. [2019-12-26 23:13:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:57,928 INFO L93 Difference]: Finished difference Result 26059 states and 65604 transitions. [2019-12-26 23:13:57,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:13:57,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-26 23:13:57,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:57,962 INFO L225 Difference]: With dead ends: 26059 [2019-12-26 23:13:57,962 INFO L226 Difference]: Without dead ends: 26059 [2019-12-26 23:13:57,962 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-26 23:13:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26059 states. [2019-12-26 23:13:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26059 to 25410. [2019-12-26 23:13:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25410 states. [2019-12-26 23:13:58,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25410 states to 25410 states and 64140 transitions. [2019-12-26 23:13:58,297 INFO L78 Accepts]: Start accepts. Automaton has 25410 states and 64140 transitions. Word has length 96 [2019-12-26 23:13:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:58,297 INFO L462 AbstractCegarLoop]: Abstraction has 25410 states and 64140 transitions. [2019-12-26 23:13:58,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:13:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 25410 states and 64140 transitions. [2019-12-26 23:13:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:58,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:58,324 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-26 23:13:58,324 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:58,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash -743312710, now seen corresponding path program 17 times [2019-12-26 23:13:58,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:58,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977846269] [2019-12-26 23:13:58,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:13:58,527 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-26 23:13:58,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977846269] [2019-12-26 23:13:58,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:13:58,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:13:58,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221413177] [2019-12-26 23:13:58,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:13:58,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:13:58,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:13:58,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:13:58,529 INFO L87 Difference]: Start difference. First operand 25410 states and 64140 transitions. Second operand 9 states. [2019-12-26 23:13:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:13:59,361 INFO L93 Difference]: Finished difference Result 35185 states and 88895 transitions. [2019-12-26 23:13:59,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:13:59,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-26 23:13:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:13:59,403 INFO L225 Difference]: With dead ends: 35185 [2019-12-26 23:13:59,403 INFO L226 Difference]: Without dead ends: 35185 [2019-12-26 23:13:59,403 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-26 23:13:59,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35185 states. [2019-12-26 23:13:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35185 to 25345. [2019-12-26 23:13:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25345 states. [2019-12-26 23:13:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25345 states to 25345 states and 63984 transitions. [2019-12-26 23:13:59,764 INFO L78 Accepts]: Start accepts. Automaton has 25345 states and 63984 transitions. Word has length 96 [2019-12-26 23:13:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:13:59,764 INFO L462 AbstractCegarLoop]: Abstraction has 25345 states and 63984 transitions. [2019-12-26 23:13:59,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:13:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25345 states and 63984 transitions. [2019-12-26 23:13:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-26 23:13:59,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:13:59,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:13:59,788 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:13:59,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:13:59,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1003945260, now seen corresponding path program 18 times [2019-12-26 23:13:59,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:13:59,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619669734] [2019-12-26 23:13:59,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:13:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:14:00,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619669734] [2019-12-26 23:14:00,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:00,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 23:14:00,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529310418] [2019-12-26 23:14:00,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 23:14:00,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 23:14:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-26 23:14:00,004 INFO L87 Difference]: Start difference. First operand 25345 states and 63984 transitions. Second operand 15 states. [2019-12-26 23:14:02,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:02,598 INFO L93 Difference]: Finished difference Result 41981 states and 106142 transitions. [2019-12-26 23:14:02,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:14:02,598 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-26 23:14:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:02,644 INFO L225 Difference]: With dead ends: 41981 [2019-12-26 23:14:02,644 INFO L226 Difference]: Without dead ends: 37557 [2019-12-26 23:14:02,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 23:14:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37557 states. [2019-12-26 23:14:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37557 to 24967. [2019-12-26 23:14:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-26 23:14:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 62817 transitions. [2019-12-26 23:14:03,013 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 62817 transitions. Word has length 96 [2019-12-26 23:14:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:03,013 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 62817 transitions. [2019-12-26 23:14:03,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 23:14:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 62817 transitions. [2019-12-26 23:14:03,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:03,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:03,038 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-26 23:14:03,038 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-26 23:14:03,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:03,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185835219] [2019-12-26 23:14:03,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:03,360 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-26 23:14:03,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185835219] [2019-12-26 23:14:03,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:03,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:14:03,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266230485] [2019-12-26 23:14:03,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 23:14:03,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:03,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 23:14:03,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:14:03,361 INFO L87 Difference]: Start difference. First operand 24967 states and 62817 transitions. Second operand 13 states. [2019-12-26 23:14:06,319 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-26 23:14:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:09,889 INFO L93 Difference]: Finished difference Result 54920 states and 137043 transitions. [2019-12-26 23:14:09,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-26 23:14:09,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2019-12-26 23:14:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:09,946 INFO L225 Difference]: With dead ends: 54920 [2019-12-26 23:14:09,946 INFO L226 Difference]: Without dead ends: 48198 [2019-12-26 23:14:09,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=3099, Unknown=0, NotChecked=0, Total=3540 [2019-12-26 23:14:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48198 states. [2019-12-26 23:14:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48198 to 30332. [2019-12-26 23:14:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30332 states. [2019-12-26 23:14:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30332 states to 30332 states and 77011 transitions. [2019-12-26 23:14:10,409 INFO L78 Accepts]: Start accepts. Automaton has 30332 states and 77011 transitions. Word has length 97 [2019-12-26 23:14:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:10,409 INFO L462 AbstractCegarLoop]: Abstraction has 30332 states and 77011 transitions. [2019-12-26 23:14:10,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 23:14:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 30332 states and 77011 transitions. [2019-12-26 23:14:10,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:10,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:10,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:14:10,437 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:10,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:10,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-26 23:14:10,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:10,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738052877] [2019-12-26 23:14:10,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:10,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-26 23:14:10,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738052877] [2019-12-26 23:14:10,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:10,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:14:10,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801544879] [2019-12-26 23:14:10,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:14:10,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:14:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:14:10,547 INFO L87 Difference]: Start difference. First operand 30332 states and 77011 transitions. Second operand 6 states. [2019-12-26 23:14:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:10,832 INFO L93 Difference]: Finished difference Result 29842 states and 75645 transitions. [2019-12-26 23:14:10,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:14:10,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:14:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:10,890 INFO L225 Difference]: With dead ends: 29842 [2019-12-26 23:14:10,890 INFO L226 Difference]: Without dead ends: 29842 [2019-12-26 23:14:10,891 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-26 23:14:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29842 states. [2019-12-26 23:14:11,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29842 to 24364. [2019-12-26 23:14:11,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24364 states. [2019-12-26 23:14:11,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24364 states to 24364 states and 61297 transitions. [2019-12-26 23:14:11,501 INFO L78 Accepts]: Start accepts. Automaton has 24364 states and 61297 transitions. Word has length 97 [2019-12-26 23:14:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:11,502 INFO L462 AbstractCegarLoop]: Abstraction has 24364 states and 61297 transitions. [2019-12-26 23:14:11,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:14:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24364 states and 61297 transitions. [2019-12-26 23:14:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:11,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:11,525 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-26 23:14:11,525 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-26 23:14:11,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:11,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696730469] [2019-12-26 23:14:11,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:11,641 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-26 23:14:11,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696730469] [2019-12-26 23:14:11,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:11,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:14:11,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662011535] [2019-12-26 23:14:11,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:14:11,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:11,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:14:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:14:11,643 INFO L87 Difference]: Start difference. First operand 24364 states and 61297 transitions. Second operand 7 states. [2019-12-26 23:14:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:12,528 INFO L93 Difference]: Finished difference Result 36728 states and 91774 transitions. [2019-12-26 23:14:12,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:14:12,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:14:12,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:12,574 INFO L225 Difference]: With dead ends: 36728 [2019-12-26 23:14:12,574 INFO L226 Difference]: Without dead ends: 36721 [2019-12-26 23:14:12,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:14:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36721 states. [2019-12-26 23:14:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36721 to 29332. [2019-12-26 23:14:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29332 states. [2019-12-26 23:14:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29332 states to 29332 states and 73865 transitions. [2019-12-26 23:14:13,026 INFO L78 Accepts]: Start accepts. Automaton has 29332 states and 73865 transitions. Word has length 97 [2019-12-26 23:14:13,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:13,026 INFO L462 AbstractCegarLoop]: Abstraction has 29332 states and 73865 transitions. [2019-12-26 23:14:13,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:14:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29332 states and 73865 transitions. [2019-12-26 23:14:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:13,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:13,059 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-26 23:14:13,059 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash 559739879, now seen corresponding path program 2 times [2019-12-26 23:14:13,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:13,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992252834] [2019-12-26 23:14:13,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:13,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-26 23:14:13,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992252834] [2019-12-26 23:14:13,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:13,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:14:13,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596454519] [2019-12-26 23:14:13,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:14:13,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:13,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:14:13,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:14:13,131 INFO L87 Difference]: Start difference. First operand 29332 states and 73865 transitions. Second operand 6 states. [2019-12-26 23:14:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:13,745 INFO L93 Difference]: Finished difference Result 37344 states and 93608 transitions. [2019-12-26 23:14:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:14:13,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-26 23:14:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:13,788 INFO L225 Difference]: With dead ends: 37344 [2019-12-26 23:14:13,788 INFO L226 Difference]: Without dead ends: 37344 [2019-12-26 23:14:13,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:14:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37344 states. [2019-12-26 23:14:14,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37344 to 29407. [2019-12-26 23:14:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29407 states. [2019-12-26 23:14:14,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29407 states to 29407 states and 74055 transitions. [2019-12-26 23:14:14,333 INFO L78 Accepts]: Start accepts. Automaton has 29407 states and 74055 transitions. Word has length 97 [2019-12-26 23:14:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:14,334 INFO L462 AbstractCegarLoop]: Abstraction has 29407 states and 74055 transitions. [2019-12-26 23:14:14,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:14:14,334 INFO L276 IsEmpty]: Start isEmpty. Operand 29407 states and 74055 transitions. [2019-12-26 23:14:14,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:14,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:14,361 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-26 23:14:14,361 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 3 times [2019-12-26 23:14:14,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:14,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779402529] [2019-12-26 23:14:14,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:14,505 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-26 23:14:14,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779402529] [2019-12-26 23:14:14,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:14,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:14,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661491419] [2019-12-26 23:14:14,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 23:14:14,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 23:14:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:14:14,507 INFO L87 Difference]: Start difference. First operand 29407 states and 74055 transitions. Second operand 8 states. [2019-12-26 23:14:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:15,408 INFO L93 Difference]: Finished difference Result 36874 states and 91805 transitions. [2019-12-26 23:14:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:14:15,409 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-26 23:14:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:15,450 INFO L225 Difference]: With dead ends: 36874 [2019-12-26 23:14:15,451 INFO L226 Difference]: Without dead ends: 36867 [2019-12-26 23:14:15,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:14:15,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36867 states. [2019-12-26 23:14:15,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36867 to 29380. [2019-12-26 23:14:15,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29380 states. [2019-12-26 23:14:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29380 states to 29380 states and 73976 transitions. [2019-12-26 23:14:15,868 INFO L78 Accepts]: Start accepts. Automaton has 29380 states and 73976 transitions. Word has length 97 [2019-12-26 23:14:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:15,869 INFO L462 AbstractCegarLoop]: Abstraction has 29380 states and 73976 transitions. [2019-12-26 23:14:15,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 23:14:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 29380 states and 73976 transitions. [2019-12-26 23:14:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:15,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:15,903 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-26 23:14:15,903 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 4 times [2019-12-26 23:14:15,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:15,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230629465] [2019-12-26 23:14:15,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:16,006 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-26 23:14:16,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230629465] [2019-12-26 23:14:16,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:16,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 23:14:16,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812600606] [2019-12-26 23:14:16,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:14:16,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:14:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:14:16,008 INFO L87 Difference]: Start difference. First operand 29380 states and 73976 transitions. Second operand 7 states. [2019-12-26 23:14:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:16,943 INFO L93 Difference]: Finished difference Result 38895 states and 97543 transitions. [2019-12-26 23:14:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 23:14:16,944 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-26 23:14:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:16,988 INFO L225 Difference]: With dead ends: 38895 [2019-12-26 23:14:16,988 INFO L226 Difference]: Without dead ends: 38881 [2019-12-26 23:14:16,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:14:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38881 states. [2019-12-26 23:14:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38881 to 31083. [2019-12-26 23:14:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31083 states. [2019-12-26 23:14:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31083 states to 31083 states and 78281 transitions. [2019-12-26 23:14:17,549 INFO L78 Accepts]: Start accepts. Automaton has 31083 states and 78281 transitions. Word has length 97 [2019-12-26 23:14:17,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:17,549 INFO L462 AbstractCegarLoop]: Abstraction has 31083 states and 78281 transitions. [2019-12-26 23:14:17,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:14:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 31083 states and 78281 transitions. [2019-12-26 23:14:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:17,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:17,578 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-26 23:14:17,578 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 5 times [2019-12-26 23:14:17,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:17,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242661416] [2019-12-26 23:14:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:18,055 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-26 23:14:18,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242661416] [2019-12-26 23:14:18,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:18,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 23:14:18,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446557551] [2019-12-26 23:14:18,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 23:14:18,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:18,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 23:14:18,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:14:18,056 INFO L87 Difference]: Start difference. First operand 31083 states and 78281 transitions. Second operand 18 states. [2019-12-26 23:14:21,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:21,862 INFO L93 Difference]: Finished difference Result 51291 states and 127328 transitions. [2019-12-26 23:14:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-26 23:14:21,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 97 [2019-12-26 23:14:21,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:21,914 INFO L225 Difference]: With dead ends: 51291 [2019-12-26 23:14:21,915 INFO L226 Difference]: Without dead ends: 44414 [2019-12-26 23:14:21,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=322, Invalid=2648, Unknown=0, NotChecked=0, Total=2970 [2019-12-26 23:14:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44414 states. [2019-12-26 23:14:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44414 to 39079. [2019-12-26 23:14:22,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39079 states. [2019-12-26 23:14:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39079 states to 39079 states and 99318 transitions. [2019-12-26 23:14:22,630 INFO L78 Accepts]: Start accepts. Automaton has 39079 states and 99318 transitions. Word has length 97 [2019-12-26 23:14:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:22,630 INFO L462 AbstractCegarLoop]: Abstraction has 39079 states and 99318 transitions. [2019-12-26 23:14:22,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 23:14:22,630 INFO L276 IsEmpty]: Start isEmpty. Operand 39079 states and 99318 transitions. [2019-12-26 23:14:22,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:22,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:22,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-26 23:14:22,666 INFO L410 AbstractCegarLoop]: === Iteration 51 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 2072554265, now seen corresponding path program 6 times [2019-12-26 23:14:22,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:22,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930086798] [2019-12-26 23:14:22,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:22,819 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-26 23:14:22,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930086798] [2019-12-26 23:14:22,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:22,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 23:14:22,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642298667] [2019-12-26 23:14:22,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:14:22,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:14:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:14:22,821 INFO L87 Difference]: Start difference. First operand 39079 states and 99318 transitions. Second operand 12 states. [2019-12-26 23:14:24,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:24,242 INFO L93 Difference]: Finished difference Result 57128 states and 145205 transitions. [2019-12-26 23:14:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-26 23:14:24,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-26 23:14:24,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:24,359 INFO L225 Difference]: With dead ends: 57128 [2019-12-26 23:14:24,359 INFO L226 Difference]: Without dead ends: 55790 [2019-12-26 23:14:24,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2019-12-26 23:14:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55790 states. [2019-12-26 23:14:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55790 to 44177. [2019-12-26 23:14:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44177 states. [2019-12-26 23:14:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44177 states to 44177 states and 113285 transitions. [2019-12-26 23:14:25,298 INFO L78 Accepts]: Start accepts. Automaton has 44177 states and 113285 transitions. Word has length 97 [2019-12-26 23:14:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:25,298 INFO L462 AbstractCegarLoop]: Abstraction has 44177 states and 113285 transitions. [2019-12-26 23:14:25,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:14:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 44177 states and 113285 transitions. [2019-12-26 23:14:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:25,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:25,340 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:14:25,340 INFO L410 AbstractCegarLoop]: === Iteration 52 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:25,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:25,340 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 7 times [2019-12-26 23:14:25,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:25,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459163353] [2019-12-26 23:14:25,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:25,557 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-26 23:14:25,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459163353] [2019-12-26 23:14:25,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:25,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:25,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832218662] [2019-12-26 23:14:25,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:14:25,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:14:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:14:25,561 INFO L87 Difference]: Start difference. First operand 44177 states and 113285 transitions. Second operand 9 states. [2019-12-26 23:14:26,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:26,721 INFO L93 Difference]: Finished difference Result 44673 states and 114266 transitions. [2019-12-26 23:14:26,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:14:26,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-12-26 23:14:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:26,772 INFO L225 Difference]: With dead ends: 44673 [2019-12-26 23:14:26,772 INFO L226 Difference]: Without dead ends: 44673 [2019-12-26 23:14:26,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:14:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44673 states. [2019-12-26 23:14:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44673 to 43473. [2019-12-26 23:14:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43473 states. [2019-12-26 23:14:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43473 states to 43473 states and 111514 transitions. [2019-12-26 23:14:27,289 INFO L78 Accepts]: Start accepts. Automaton has 43473 states and 111514 transitions. Word has length 97 [2019-12-26 23:14:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:27,289 INFO L462 AbstractCegarLoop]: Abstraction has 43473 states and 111514 transitions. [2019-12-26 23:14:27,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:14:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 43473 states and 111514 transitions. [2019-12-26 23:14:27,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:27,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:27,329 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-26 23:14:27,329 INFO L410 AbstractCegarLoop]: === Iteration 53 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:27,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 8 times [2019-12-26 23:14:27,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:27,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133043484] [2019-12-26 23:14:27,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:27,521 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-26 23:14:27,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133043484] [2019-12-26 23:14:27,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:27,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:14:27,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425871650] [2019-12-26 23:14:27,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:14:27,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:14:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:14:27,523 INFO L87 Difference]: Start difference. First operand 43473 states and 111514 transitions. Second operand 10 states. [2019-12-26 23:14:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:14:28,768 INFO L93 Difference]: Finished difference Result 60872 states and 155533 transitions. [2019-12-26 23:14:28,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:14:28,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-26 23:14:28,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:14:28,852 INFO L225 Difference]: With dead ends: 60872 [2019-12-26 23:14:28,852 INFO L226 Difference]: Without dead ends: 60865 [2019-12-26 23:14:28,853 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-26 23:14:28,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60865 states. [2019-12-26 23:14:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60865 to 41390. [2019-12-26 23:14:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41390 states. [2019-12-26 23:14:29,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41390 states to 41390 states and 106024 transitions. [2019-12-26 23:14:29,720 INFO L78 Accepts]: Start accepts. Automaton has 41390 states and 106024 transitions. Word has length 97 [2019-12-26 23:14:29,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:14:29,720 INFO L462 AbstractCegarLoop]: Abstraction has 41390 states and 106024 transitions. [2019-12-26 23:14:29,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:14:29,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41390 states and 106024 transitions. [2019-12-26 23:14:29,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-26 23:14:29,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:14:29,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, 1] [2019-12-26 23:14:29,760 INFO L410 AbstractCegarLoop]: === Iteration 54 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:14:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:14:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 9 times [2019-12-26 23:14:29,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:14:29,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025598276] [2019-12-26 23:14:29,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:14:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:14:29,891 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-26 23:14:29,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025598276] [2019-12-26 23:14:29,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:14:29,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:14:29,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150415468] [2019-12-26 23:14:29,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:14:29,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:14:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:14:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:14:29,893 INFO L87 Difference]: Start difference. First operand 41390 states and 106024 transitions. Second operand 9 states. Received shutdown request... [2019-12-26 23:14:30,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 23:14:30,598 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-26 23:14:30,604 WARN L227 ceAbstractionStarter]: Timeout [2019-12-26 23:14:30,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:14:30 BasicIcfg [2019-12-26 23:14:30,604 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:14:30,606 INFO L168 Benchmark]: Toolchain (without parser) took 207098.31 ms. Allocated memory was 138.4 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.3 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 830.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,606 INFO L168 Benchmark]: CDTParser took 1.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.94 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 154.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.62 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 150.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,607 INFO L168 Benchmark]: Boogie Preprocessor took 53.78 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,608 INFO L168 Benchmark]: RCFGBuilder took 1146.05 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 147.6 MB in the beginning and 191.8 MB in the end (delta: -44.2 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,608 INFO L168 Benchmark]: TraceAbstraction took 204974.92 ms. Allocated memory was 236.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 191.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 822.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:14:30,611 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.52 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 831.94 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 154.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.62 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 150.8 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.78 ms. Allocated memory is still 202.9 MB. Free memory was 150.2 MB in the beginning and 147.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1146.05 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 147.6 MB in the beginning and 191.8 MB in the end (delta: -44.2 MB). Peak memory consumption was 65.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204974.92 ms. Allocated memory was 236.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 191.8 MB in the beginning and 1.8 GB in the end (delta: -1.6 GB). Peak memory consumption was 822.6 MB. 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 (41390states) and FLOYD_HOARE automaton (currently 11 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (12837 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (41390states) and FLOYD_HOARE automaton (currently 11 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (12837 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 204.7s, OverallIterations: 54, TraceHistogramMax: 1, AutomataDifference: 96.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 24089 SDtfs, 27038 SDslu, 111308 SDs, 0 SdLazy, 49301 SolverSat, 1247 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1019 GetRequests, 169 SyntacticMatches, 81 SemanticMatches, 769 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4713 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.4s AutomataMinimizationTime, 53 MinimizatonAttempts, 344176 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 4476 NumberOfCodeBlocks, 4476 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 4422 ConstructedInterpolants, 0 QuantifiedInterpolants, 1513397 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