/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 03:39:37,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 03:39:37,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 03:39:37,328 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 03:39:37,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 03:39:37,331 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 03:39:37,333 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 03:39:37,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 03:39:37,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 03:39:37,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 03:39:37,344 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 03:39:37,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 03:39:37,345 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 03:39:37,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 03:39:37,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 03:39:37,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 03:39:37,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 03:39:37,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 03:39:37,351 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 03:39:37,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 03:39:37,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 03:39:37,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 03:39:37,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 03:39:37,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 03:39:37,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 03:39:37,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 03:39:37,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 03:39:37,361 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 03:39:37,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 03:39:37,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 03:39:37,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 03:39:37,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 03:39:37,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 03:39:37,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 03:39:37,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 03:39:37,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 03:39:37,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 03:39:37,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 03:39:37,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 03:39:37,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 03:39:37,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 03:39:37,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 03:39:37,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 03:39:37,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 03:39:37,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 03:39:37,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 03:39:37,392 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 03:39:37,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 03:39:37,392 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 03:39:37,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 03:39:37,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 03:39:37,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 03:39:37,394 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 03:39:37,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 03:39:37,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 03:39:37,395 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 03:39:37,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 03:39:37,396 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 03:39:37,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 03:39:37,396 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 03:39:37,396 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 03:39:37,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 03:39:37,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 03:39:37,397 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:39:37,397 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 03:39:37,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 03:39:37,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 03:39:37,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 03:39:37,672 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 03:39:37,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 03:39:37,673 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 03:39:37,674 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 03:39:37,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1da5339/6090bf4393a94cc7b50a740fbc2cbb57/FLAG807a4c393 [2019-12-27 03:39:38,344 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 03:39:38,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 03:39:38,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1da5339/6090bf4393a94cc7b50a740fbc2cbb57/FLAG807a4c393 [2019-12-27 03:39:38,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1da5339/6090bf4393a94cc7b50a740fbc2cbb57 [2019-12-27 03:39:38,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 03:39:38,620 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 03:39:38,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 03:39:38,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 03:39:38,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 03:39:38,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:38" (1/1) ... [2019-12-27 03:39:38,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81a7e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:38, skipping insertion in model container [2019-12-27 03:39:38,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 03:39:38" (1/1) ... [2019-12-27 03:39:38,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 03:39:38,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 03:39:39,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:39:39,282 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 03:39:39,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 03:39:39,456 INFO L208 MainTranslator]: Completed translation [2019-12-27 03:39:39,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39 WrapperNode [2019-12-27 03:39:39,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 03:39:39,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 03:39:39,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 03:39:39,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 03:39:39,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 03:39:39,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 03:39:39,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 03:39:39,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 03:39:39,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... [2019-12-27 03:39:39,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 03:39:39,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 03:39:39,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 03:39:39,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 03:39:39,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 03:39:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 03:39:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 03:39:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 03:39:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 03:39:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 03:39:39,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 03:39:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 03:39:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 03:39:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 03:39:39,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 03:39:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 03:39:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 03:39:39,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 03:39:39,636 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 03:39:40,378 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 03:39:40,378 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 03:39:40,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:39:40 BoogieIcfgContainer [2019-12-27 03:39:40,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 03:39:40,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 03:39:40,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 03:39:40,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 03:39:40,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 03:39:38" (1/3) ... [2019-12-27 03:39:40,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13acf0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:39:40, skipping insertion in model container [2019-12-27 03:39:40,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 03:39:39" (2/3) ... [2019-12-27 03:39:40,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13acf0ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 03:39:40, skipping insertion in model container [2019-12-27 03:39:40,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 03:39:40" (3/3) ... [2019-12-27 03:39:40,388 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-27 03:39:40,398 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 03:39:40,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 03:39:40,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 03:39:40,409 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 03:39:40,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,455 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,466 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,470 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,471 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,475 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,476 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,477 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,484 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,485 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,486 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,522 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,525 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,526 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,531 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,531 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,535 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 03:39:40,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 03:39:40,574 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 03:39:40,574 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 03:39:40,574 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 03:39:40,574 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 03:39:40,574 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 03:39:40,574 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 03:39:40,575 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 03:39:40,575 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 03:39:40,591 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 03:39:40,593 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:39:40,710 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:39:40,710 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:39:40,730 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:39:40,754 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 03:39:40,809 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 03:39:40,810 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 03:39:40,816 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 03:39:40,836 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 03:39:40,837 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 03:39:46,046 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 03:39:46,154 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 03:39:46,263 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-27 03:39:46,263 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 03:39:46,269 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-27 03:39:56,103 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-27 03:39:56,105 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-27 03:39:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 03:39:56,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:39:56,112 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 03:39:56,113 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:39:56,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:39:56,120 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-27 03:39:56,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:39:56,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756679540] [2019-12-27 03:39:56,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:39:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:39:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:39:56,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756679540] [2019-12-27 03:39:56,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:39:56,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:39:56,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615868511] [2019-12-27 03:39:56,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:39:56,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:39:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:39:56,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:39:56,404 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-27 03:39:57,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:39:57,601 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-27 03:39:57,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:39:57,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 03:39:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:00,437 INFO L225 Difference]: With dead ends: 79136 [2019-12-27 03:40:00,437 INFO L226 Difference]: Without dead ends: 74600 [2019-12-27 03:40:00,439 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-27 03:40:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-27 03:40:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-27 03:40:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-27 03:40:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-27 03:40:06,060 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-27 03:40:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:06,060 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-27 03:40:06,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:40:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-27 03:40:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:06,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:06,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:06,070 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:06,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:06,070 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-27 03:40:06,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:06,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985218847] [2019-12-27 03:40:06,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:06,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985218847] [2019-12-27 03:40:06,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:06,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:06,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634053495] [2019-12-27 03:40:06,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:06,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:06,182 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-27 03:40:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:10,613 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-27 03:40:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:10,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:10,985 INFO L225 Difference]: With dead ends: 114840 [2019-12-27 03:40:10,985 INFO L226 Difference]: Without dead ends: 114749 [2019-12-27 03:40:10,986 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-27 03:40:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-27 03:40:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-27 03:40:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-27 03:40:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-27 03:40:17,833 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-27 03:40:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:17,838 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-27 03:40:17,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:40:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-27 03:40:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 03:40:17,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:17,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:17,842 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-27 03:40:17,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:17,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983197170] [2019-12-27 03:40:17,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:17,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983197170] [2019-12-27 03:40:17,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:17,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:17,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511860791] [2019-12-27 03:40:17,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:17,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:17,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:17,925 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-27 03:40:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:18,852 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-27 03:40:18,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:40:18,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 03:40:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:24,430 INFO L225 Difference]: With dead ends: 148763 [2019-12-27 03:40:24,430 INFO L226 Difference]: Without dead ends: 148659 [2019-12-27 03:40:24,431 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-27 03:40:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-27 03:40:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-27 03:40:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-27 03:40:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-27 03:40:30,771 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-27 03:40:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:30,772 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-27 03:40:30,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:40:30,772 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-27 03:40:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 03:40:30,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:30,778 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:30,778 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-27 03:40:30,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:30,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001981045] [2019-12-27 03:40:30,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:40:30,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001981045] [2019-12-27 03:40:30,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:30,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:40:30,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476964318] [2019-12-27 03:40:30,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:40:30,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:30,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:40:30,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:40:30,887 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-27 03:40:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:33,049 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-27 03:40:33,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 03:40:33,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 03:40:33,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:33,634 INFO L225 Difference]: With dead ends: 172949 [2019-12-27 03:40:33,635 INFO L226 Difference]: Without dead ends: 172813 [2019-12-27 03:40:33,635 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-27 03:40:42,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-27 03:40:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-27 03:40:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-27 03:40:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-27 03:40:46,151 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-27 03:40:46,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:46,151 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-27 03:40:46,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:40:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-27 03:40:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 03:40:46,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:46,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:46,173 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:46,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-27 03:40:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:46,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124737799] [2019-12-27 03:40:46,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:46,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-27 03:40:46,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124737799] [2019-12-27 03:40:46,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:46,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 03:40:46,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545572667] [2019-12-27 03:40:46,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:40:46,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:40:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:40:46,227 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-27 03:40:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:40:46,882 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-27 03:40:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:40:46,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 03:40:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:40:47,310 INFO L225 Difference]: With dead ends: 133799 [2019-12-27 03:40:47,311 INFO L226 Difference]: Without dead ends: 133799 [2019-12-27 03:40:47,311 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-27 03:40:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-27 03:40:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-27 03:40:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-27 03:40:59,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-27 03:40:59,303 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-27 03:40:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:40:59,303 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-27 03:40:59,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:40:59,303 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-27 03:40:59,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:40:59,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:40:59,326 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:40:59,326 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:40:59,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:40:59,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-27 03:40:59,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:40:59,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813385081] [2019-12-27 03:40:59,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:40:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:40:59,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-27 03:40:59,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813385081] [2019-12-27 03:40:59,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:40:59,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:40:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957672457] [2019-12-27 03:40:59,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:40:59,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:40:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:40:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:40:59,394 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-27 03:41:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:00,568 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-27 03:41:00,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:41:00,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 03:41:00,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:07,573 INFO L225 Difference]: With dead ends: 243998 [2019-12-27 03:41:07,573 INFO L226 Difference]: Without dead ends: 133380 [2019-12-27 03:41:07,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:41:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-27 03:41:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-27 03:41:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-27 03:41:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-27 03:41:13,275 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-27 03:41:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-27 03:41:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-27 03:41:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 03:41:13,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:13,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:13,289 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-27 03:41:13,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:13,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190166039] [2019-12-27 03:41:13,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:13,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190166039] [2019-12-27 03:41:13,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:13,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:41:13,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668052170] [2019-12-27 03:41:13,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:41:13,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:41:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:41:13,391 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-27 03:41:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:15,579 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-27 03:41:15,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 03:41:15,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 03:41:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:16,053 INFO L225 Difference]: With dead ends: 182821 [2019-12-27 03:41:16,054 INFO L226 Difference]: Without dead ends: 181141 [2019-12-27 03:41:16,054 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-27 03:41:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-27 03:41:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-27 03:41:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-27 03:41:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-27 03:41:29,350 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-27 03:41:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-27 03:41:29,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:41:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-27 03:41:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 03:41:29,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:29,370 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] [2019-12-27 03:41:29,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:29,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:29,371 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-27 03:41:29,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:29,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236841969] [2019-12-27 03:41:29,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:29,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:29,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236841969] [2019-12-27 03:41:29,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:29,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:29,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794777303] [2019-12-27 03:41:29,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:41:29,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:41:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:41:29,418 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-27 03:41:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:31,981 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-27 03:41:31,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:41:31,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-27 03:41:31,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:32,275 INFO L225 Difference]: With dead ends: 208641 [2019-12-27 03:41:32,275 INFO L226 Difference]: Without dead ends: 95129 [2019-12-27 03:41:32,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:41:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-27 03:41:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-27 03:41:43,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-27 03:41:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-27 03:41:43,314 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-27 03:41:43,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:43,314 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-27 03:41:43,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:41:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-27 03:41:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 03:41:43,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:43,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] [2019-12-27 03:41:43,330 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-27 03:41:43,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:43,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234994076] [2019-12-27 03:41:43,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:43,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:43,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234994076] [2019-12-27 03:41:43,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:43,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:41:43,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119135374] [2019-12-27 03:41:43,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:41:43,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:41:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:41:43,377 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 3 states. [2019-12-27 03:41:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:43,750 INFO L93 Difference]: Finished difference Result 84552 states and 342415 transitions. [2019-12-27 03:41:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:41:43,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-27 03:41:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:43,963 INFO L225 Difference]: With dead ends: 84552 [2019-12-27 03:41:43,964 INFO L226 Difference]: Without dead ends: 84552 [2019-12-27 03:41:43,964 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-27 03:41:47,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84552 states. [2019-12-27 03:41:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84552 to 84552. [2019-12-27 03:41:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84552 states. [2019-12-27 03:41:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84552 states to 84552 states and 342415 transitions. [2019-12-27 03:41:52,105 INFO L78 Accepts]: Start accepts. Automaton has 84552 states and 342415 transitions. Word has length 21 [2019-12-27 03:41:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:41:52,105 INFO L462 AbstractCegarLoop]: Abstraction has 84552 states and 342415 transitions. [2019-12-27 03:41:52,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:41:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 84552 states and 342415 transitions. [2019-12-27 03:41:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:41:52,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:41:52,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:41:52,121 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:41:52,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:41:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash 120078242, now seen corresponding path program 1 times [2019-12-27 03:41:52,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:41:52,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033959457] [2019-12-27 03:41:52,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:41:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:41:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:41:52,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033959457] [2019-12-27 03:41:52,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:41:52,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:41:52,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515204652] [2019-12-27 03:41:52,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:41:52,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:41:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:41:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:41:52,204 INFO L87 Difference]: Start difference. First operand 84552 states and 342415 transitions. Second operand 6 states. [2019-12-27 03:41:54,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:41:54,002 INFO L93 Difference]: Finished difference Result 128943 states and 503000 transitions. [2019-12-27 03:41:54,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 03:41:54,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:41:54,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:41:54,336 INFO L225 Difference]: With dead ends: 128943 [2019-12-27 03:41:54,336 INFO L226 Difference]: Without dead ends: 126131 [2019-12-27 03:41:54,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126131 states. [2019-12-27 03:42:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126131 to 99741. [2019-12-27 03:42:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99741 states. [2019-12-27 03:42:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99741 states to 99741 states and 399345 transitions. [2019-12-27 03:42:03,772 INFO L78 Accepts]: Start accepts. Automaton has 99741 states and 399345 transitions. Word has length 22 [2019-12-27 03:42:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:03,773 INFO L462 AbstractCegarLoop]: Abstraction has 99741 states and 399345 transitions. [2019-12-27 03:42:03,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 99741 states and 399345 transitions. [2019-12-27 03:42:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:03,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:03,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:03,788 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-27 03:42:03,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:03,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399586081] [2019-12-27 03:42:03,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:03,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:03,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399586081] [2019-12-27 03:42:03,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:03,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:03,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883008623] [2019-12-27 03:42:03,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:03,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:03,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:03,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:03,878 INFO L87 Difference]: Start difference. First operand 99741 states and 399345 transitions. Second operand 6 states. [2019-12-27 03:42:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:04,727 INFO L93 Difference]: Finished difference Result 102103 states and 404946 transitions. [2019-12-27 03:42:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 03:42:04,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 03:42:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:04,982 INFO L225 Difference]: With dead ends: 102103 [2019-12-27 03:42:04,983 INFO L226 Difference]: Without dead ends: 99113 [2019-12-27 03:42:04,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 03:42:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99113 states. [2019-12-27 03:42:14,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99113 to 98620. [2019-12-27 03:42:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98620 states. [2019-12-27 03:42:14,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98620 states to 98620 states and 395258 transitions. [2019-12-27 03:42:14,359 INFO L78 Accepts]: Start accepts. Automaton has 98620 states and 395258 transitions. Word has length 22 [2019-12-27 03:42:14,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:14,359 INFO L462 AbstractCegarLoop]: Abstraction has 98620 states and 395258 transitions. [2019-12-27 03:42:14,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand 98620 states and 395258 transitions. [2019-12-27 03:42:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 03:42:14,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:14,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:14,376 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:14,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1221135073, now seen corresponding path program 1 times [2019-12-27 03:42:14,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:14,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326372217] [2019-12-27 03:42:14,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:14,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326372217] [2019-12-27 03:42:14,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:14,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:14,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186775980] [2019-12-27 03:42:14,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 03:42:14,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:14,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 03:42:14,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 03:42:14,456 INFO L87 Difference]: Start difference. First operand 98620 states and 395258 transitions. Second operand 4 states. [2019-12-27 03:42:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:15,191 INFO L93 Difference]: Finished difference Result 19582 states and 68234 transitions. [2019-12-27 03:42:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 03:42:15,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-27 03:42:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:15,227 INFO L225 Difference]: With dead ends: 19582 [2019-12-27 03:42:15,227 INFO L226 Difference]: Without dead ends: 15386 [2019-12-27 03:42:15,228 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-27 03:42:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15386 states. [2019-12-27 03:42:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15386 to 15386. [2019-12-27 03:42:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15386 states. [2019-12-27 03:42:15,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15386 states to 15386 states and 51412 transitions. [2019-12-27 03:42:15,777 INFO L78 Accepts]: Start accepts. Automaton has 15386 states and 51412 transitions. Word has length 22 [2019-12-27 03:42:15,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:15,777 INFO L462 AbstractCegarLoop]: Abstraction has 15386 states and 51412 transitions. [2019-12-27 03:42:15,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 03:42:15,778 INFO L276 IsEmpty]: Start isEmpty. Operand 15386 states and 51412 transitions. [2019-12-27 03:42:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 03:42:15,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:15,791 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] [2019-12-27 03:42:15,791 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-27 03:42:15,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624474000] [2019-12-27 03:42:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:15,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624474000] [2019-12-27 03:42:15,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:15,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 03:42:15,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046334522] [2019-12-27 03:42:15,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 03:42:15,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:15,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 03:42:15,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 03:42:15,878 INFO L87 Difference]: Start difference. First operand 15386 states and 51412 transitions. Second operand 5 states. [2019-12-27 03:42:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:15,966 INFO L93 Difference]: Finished difference Result 6122 states and 19010 transitions. [2019-12-27 03:42:15,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 03:42:15,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 03:42:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:15,978 INFO L225 Difference]: With dead ends: 6122 [2019-12-27 03:42:15,978 INFO L226 Difference]: Without dead ends: 5211 [2019-12-27 03:42:15,982 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-27 03:42:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5211 states. [2019-12-27 03:42:16,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5211 to 5211. [2019-12-27 03:42:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2019-12-27 03:42:16,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 15988 transitions. [2019-12-27 03:42:16,080 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 15988 transitions. Word has length 31 [2019-12-27 03:42:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:16,080 INFO L462 AbstractCegarLoop]: Abstraction has 5211 states and 15988 transitions. [2019-12-27 03:42:16,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 03:42:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 15988 transitions. [2019-12-27 03:42:16,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 03:42:16,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:16,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 03:42:16,088 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:16,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-27 03:42:16,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:16,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515615073] [2019-12-27 03:42:16,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:16,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515615073] [2019-12-27 03:42:16,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:16,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 03:42:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885352999] [2019-12-27 03:42:16,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 03:42:16,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:16,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 03:42:16,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 03:42:16,188 INFO L87 Difference]: Start difference. First operand 5211 states and 15988 transitions. Second operand 6 states. [2019-12-27 03:42:16,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:16,275 INFO L93 Difference]: Finished difference Result 4419 states and 14011 transitions. [2019-12-27 03:42:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 03:42:16,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 03:42:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:16,286 INFO L225 Difference]: With dead ends: 4419 [2019-12-27 03:42:16,286 INFO L226 Difference]: Without dead ends: 3928 [2019-12-27 03:42:16,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2019-12-27 03:42:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3928. [2019-12-27 03:42:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2019-12-27 03:42:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 12986 transitions. [2019-12-27 03:42:16,418 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 12986 transitions. Word has length 40 [2019-12-27 03:42:16,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:16,418 INFO L462 AbstractCegarLoop]: Abstraction has 3928 states and 12986 transitions. [2019-12-27 03:42:16,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 03:42:16,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 12986 transitions. [2019-12-27 03:42:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:16,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:16,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] [2019-12-27 03:42:16,429 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -50307014, now seen corresponding path program 1 times [2019-12-27 03:42:16,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:16,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266022354] [2019-12-27 03:42:16,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:16,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266022354] [2019-12-27 03:42:16,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:16,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 03:42:16,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123394457] [2019-12-27 03:42:16,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:16,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:16,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:16,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:16,497 INFO L87 Difference]: Start difference. First operand 3928 states and 12986 transitions. Second operand 3 states. [2019-12-27 03:42:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:16,574 INFO L93 Difference]: Finished difference Result 5525 states and 17741 transitions. [2019-12-27 03:42:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:16,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:42:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:16,587 INFO L225 Difference]: With dead ends: 5525 [2019-12-27 03:42:16,587 INFO L226 Difference]: Without dead ends: 5525 [2019-12-27 03:42:16,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2019-12-27 03:42:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 4786. [2019-12-27 03:42:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4786 states. [2019-12-27 03:42:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4786 states to 4786 states and 15560 transitions. [2019-12-27 03:42:16,721 INFO L78 Accepts]: Start accepts. Automaton has 4786 states and 15560 transitions. Word has length 55 [2019-12-27 03:42:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:16,722 INFO L462 AbstractCegarLoop]: Abstraction has 4786 states and 15560 transitions. [2019-12-27 03:42:16,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4786 states and 15560 transitions. [2019-12-27 03:42:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:16,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:16,730 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] [2019-12-27 03:42:16,730 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:16,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2065982534, now seen corresponding path program 1 times [2019-12-27 03:42:16,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:16,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481328852] [2019-12-27 03:42:16,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:16,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481328852] [2019-12-27 03:42:16,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:16,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:16,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240130231] [2019-12-27 03:42:16,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:42:16,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:16,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:42:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:16,845 INFO L87 Difference]: Start difference. First operand 4786 states and 15560 transitions. Second operand 7 states. [2019-12-27 03:42:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:17,072 INFO L93 Difference]: Finished difference Result 9078 states and 28967 transitions. [2019-12-27 03:42:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:42:17,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 03:42:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:17,083 INFO L225 Difference]: With dead ends: 9078 [2019-12-27 03:42:17,083 INFO L226 Difference]: Without dead ends: 6572 [2019-12-27 03:42:17,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2019-12-27 03:42:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 5928. [2019-12-27 03:42:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5928 states. [2019-12-27 03:42:17,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5928 states to 5928 states and 19177 transitions. [2019-12-27 03:42:17,180 INFO L78 Accepts]: Start accepts. Automaton has 5928 states and 19177 transitions. Word has length 55 [2019-12-27 03:42:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:17,180 INFO L462 AbstractCegarLoop]: Abstraction has 5928 states and 19177 transitions. [2019-12-27 03:42:17,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:42:17,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5928 states and 19177 transitions. [2019-12-27 03:42:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:17,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:17,187 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] [2019-12-27 03:42:17,187 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:17,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:17,187 INFO L82 PathProgramCache]: Analyzing trace with hash 499320198, now seen corresponding path program 2 times [2019-12-27 03:42:17,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:17,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693310093] [2019-12-27 03:42:17,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:17,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693310093] [2019-12-27 03:42:17,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:17,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 03:42:17,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799259127] [2019-12-27 03:42:17,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 03:42:17,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 03:42:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 03:42:17,284 INFO L87 Difference]: Start difference. First operand 5928 states and 19177 transitions. Second operand 7 states. [2019-12-27 03:42:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:17,505 INFO L93 Difference]: Finished difference Result 11030 states and 34860 transitions. [2019-12-27 03:42:17,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 03:42:17,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-27 03:42:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:17,518 INFO L225 Difference]: With dead ends: 11030 [2019-12-27 03:42:17,518 INFO L226 Difference]: Without dead ends: 8062 [2019-12-27 03:42:17,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 03:42:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8062 states. [2019-12-27 03:42:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8062 to 7236. [2019-12-27 03:42:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7236 states. [2019-12-27 03:42:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 23166 transitions. [2019-12-27 03:42:17,632 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 23166 transitions. Word has length 55 [2019-12-27 03:42:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:17,632 INFO L462 AbstractCegarLoop]: Abstraction has 7236 states and 23166 transitions. [2019-12-27 03:42:17,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 03:42:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 23166 transitions. [2019-12-27 03:42:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:17,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:17,640 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] [2019-12-27 03:42:17,640 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:17,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1644123802, now seen corresponding path program 3 times [2019-12-27 03:42:17,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:17,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298555955] [2019-12-27 03:42:17,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:17,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:17,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298555955] [2019-12-27 03:42:17,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:17,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 03:42:17,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43451279] [2019-12-27 03:42:17,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 03:42:17,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:17,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 03:42:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 03:42:17,749 INFO L87 Difference]: Start difference. First operand 7236 states and 23166 transitions. Second operand 8 states. [2019-12-27 03:42:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:18,954 INFO L93 Difference]: Finished difference Result 13967 states and 42866 transitions. [2019-12-27 03:42:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 03:42:18,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-27 03:42:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:18,972 INFO L225 Difference]: With dead ends: 13967 [2019-12-27 03:42:18,972 INFO L226 Difference]: Without dead ends: 11953 [2019-12-27 03:42:18,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-27 03:42:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11953 states. [2019-12-27 03:42:19,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11953 to 7256. [2019-12-27 03:42:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-27 03:42:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 23173 transitions. [2019-12-27 03:42:19,116 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 23173 transitions. Word has length 55 [2019-12-27 03:42:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:19,116 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 23173 transitions. [2019-12-27 03:42:19,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 03:42:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 23173 transitions. [2019-12-27 03:42:19,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:19,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:19,125 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] [2019-12-27 03:42:19,125 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:19,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:19,125 INFO L82 PathProgramCache]: Analyzing trace with hash -779597912, now seen corresponding path program 4 times [2019-12-27 03:42:19,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:19,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322109292] [2019-12-27 03:42:19,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:19,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:19,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322109292] [2019-12-27 03:42:19,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:19,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:42:19,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360121244] [2019-12-27 03:42:19,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:42:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:42:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:19,237 INFO L87 Difference]: Start difference. First operand 7256 states and 23173 transitions. Second operand 9 states. [2019-12-27 03:42:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:20,170 INFO L93 Difference]: Finished difference Result 19586 states and 60159 transitions. [2019-12-27 03:42:20,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 03:42:20,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 03:42:20,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:20,201 INFO L225 Difference]: With dead ends: 19586 [2019-12-27 03:42:20,201 INFO L226 Difference]: Without dead ends: 17572 [2019-12-27 03:42:20,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-27 03:42:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17572 states. [2019-12-27 03:42:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17572 to 7116. [2019-12-27 03:42:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7116 states. [2019-12-27 03:42:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 22744 transitions. [2019-12-27 03:42:20,398 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 22744 transitions. Word has length 55 [2019-12-27 03:42:20,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:20,398 INFO L462 AbstractCegarLoop]: Abstraction has 7116 states and 22744 transitions. [2019-12-27 03:42:20,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:42:20,398 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 22744 transitions. [2019-12-27 03:42:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:20,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:20,406 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] [2019-12-27 03:42:20,406 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:20,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:20,406 INFO L82 PathProgramCache]: Analyzing trace with hash 500729536, now seen corresponding path program 5 times [2019-12-27 03:42:20,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:20,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618580230] [2019-12-27 03:42:20,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:20,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618580230] [2019-12-27 03:42:20,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:20,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:42:20,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728294707] [2019-12-27 03:42:20,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:42:20,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:20,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:42:20,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:20,510 INFO L87 Difference]: Start difference. First operand 7116 states and 22744 transitions. Second operand 9 states. [2019-12-27 03:42:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:21,909 INFO L93 Difference]: Finished difference Result 26842 states and 82465 transitions. [2019-12-27 03:42:21,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 03:42:21,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 03:42:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:21,950 INFO L225 Difference]: With dead ends: 26842 [2019-12-27 03:42:21,950 INFO L226 Difference]: Without dead ends: 21492 [2019-12-27 03:42:21,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 03:42:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21492 states. [2019-12-27 03:42:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21492 to 9032. [2019-12-27 03:42:22,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9032 states. [2019-12-27 03:42:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9032 states to 9032 states and 28966 transitions. [2019-12-27 03:42:22,778 INFO L78 Accepts]: Start accepts. Automaton has 9032 states and 28966 transitions. Word has length 55 [2019-12-27 03:42:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:22,778 INFO L462 AbstractCegarLoop]: Abstraction has 9032 states and 28966 transitions. [2019-12-27 03:42:22,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 03:42:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9032 states and 28966 transitions. [2019-12-27 03:42:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 03:42:22,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:22,793 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] [2019-12-27 03:42:22,793 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:22,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2073987088, now seen corresponding path program 6 times [2019-12-27 03:42:22,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:22,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184410411] [2019-12-27 03:42:22,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:22,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:22,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184410411] [2019-12-27 03:42:22,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:22,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 03:42:22,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465823314] [2019-12-27 03:42:22,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 03:42:22,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:22,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 03:42:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 03:42:22,860 INFO L87 Difference]: Start difference. First operand 9032 states and 28966 transitions. Second operand 3 states. [2019-12-27 03:42:22,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:22,900 INFO L93 Difference]: Finished difference Result 7554 states and 23664 transitions. [2019-12-27 03:42:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 03:42:22,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 03:42:22,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:22,915 INFO L225 Difference]: With dead ends: 7554 [2019-12-27 03:42:22,916 INFO L226 Difference]: Without dead ends: 7554 [2019-12-27 03:42:22,916 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-27 03:42:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7554 states. [2019-12-27 03:42:23,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7554 to 7534. [2019-12-27 03:42:23,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7534 states. [2019-12-27 03:42:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7534 states to 7534 states and 23613 transitions. [2019-12-27 03:42:23,113 INFO L78 Accepts]: Start accepts. Automaton has 7534 states and 23613 transitions. Word has length 55 [2019-12-27 03:42:23,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:23,114 INFO L462 AbstractCegarLoop]: Abstraction has 7534 states and 23613 transitions. [2019-12-27 03:42:23,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 03:42:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 7534 states and 23613 transitions. [2019-12-27 03:42:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:23,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:23,130 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] [2019-12-27 03:42:23,131 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-27 03:42:23,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:23,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008226313] [2019-12-27 03:42:23,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:23,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:23,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008226313] [2019-12-27 03:42:23,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:23,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:42:23,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082558763] [2019-12-27 03:42:23,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:42:23,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:23,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:42:23,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:42:23,603 INFO L87 Difference]: Start difference. First operand 7534 states and 23613 transitions. Second operand 14 states. [2019-12-27 03:42:26,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:26,828 INFO L93 Difference]: Finished difference Result 13793 states and 41810 transitions. [2019-12-27 03:42:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 03:42:26,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 03:42:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:26,850 INFO L225 Difference]: With dead ends: 13793 [2019-12-27 03:42:26,850 INFO L226 Difference]: Without dead ends: 10683 [2019-12-27 03:42:26,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=1271, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 03:42:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10683 states. [2019-12-27 03:42:26,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10683 to 8949. [2019-12-27 03:42:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8949 states. [2019-12-27 03:42:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8949 states to 8949 states and 27541 transitions. [2019-12-27 03:42:27,013 INFO L78 Accepts]: Start accepts. Automaton has 8949 states and 27541 transitions. Word has length 56 [2019-12-27 03:42:27,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:27,013 INFO L462 AbstractCegarLoop]: Abstraction has 8949 states and 27541 transitions. [2019-12-27 03:42:27,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:42:27,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8949 states and 27541 transitions. [2019-12-27 03:42:27,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:27,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:27,028 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] [2019-12-27 03:42:27,029 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:27,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:27,029 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-27 03:42:27,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:27,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209795700] [2019-12-27 03:42:27,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:27,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:27,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209795700] [2019-12-27 03:42:27,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:27,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:42:27,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092442366] [2019-12-27 03:42:27,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:42:27,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:42:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:42:27,384 INFO L87 Difference]: Start difference. First operand 8949 states and 27541 transitions. Second operand 14 states. [2019-12-27 03:42:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:30,556 INFO L93 Difference]: Finished difference Result 13665 states and 41264 transitions. [2019-12-27 03:42:30,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 03:42:30,557 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 03:42:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:30,574 INFO L225 Difference]: With dead ends: 13665 [2019-12-27 03:42:30,575 INFO L226 Difference]: Without dead ends: 10983 [2019-12-27 03:42:30,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=312, Invalid=1494, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 03:42:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2019-12-27 03:42:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 8617. [2019-12-27 03:42:30,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8617 states. [2019-12-27 03:42:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8617 states to 8617 states and 26510 transitions. [2019-12-27 03:42:30,712 INFO L78 Accepts]: Start accepts. Automaton has 8617 states and 26510 transitions. Word has length 56 [2019-12-27 03:42:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:30,712 INFO L462 AbstractCegarLoop]: Abstraction has 8617 states and 26510 transitions. [2019-12-27 03:42:30,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:42:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 8617 states and 26510 transitions. [2019-12-27 03:42:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:30,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:30,723 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] [2019-12-27 03:42:30,723 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:30,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash -459647168, now seen corresponding path program 3 times [2019-12-27 03:42:30,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:30,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323843287] [2019-12-27 03:42:30,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:31,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323843287] [2019-12-27 03:42:31,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:31,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:42:31,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640267468] [2019-12-27 03:42:31,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:42:31,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:31,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:42:31,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:42:31,042 INFO L87 Difference]: Start difference. First operand 8617 states and 26510 transitions. Second operand 14 states. [2019-12-27 03:42:33,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:33,575 INFO L93 Difference]: Finished difference Result 19751 states and 58688 transitions. [2019-12-27 03:42:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 03:42:33,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 03:42:33,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:33,594 INFO L225 Difference]: With dead ends: 19751 [2019-12-27 03:42:33,594 INFO L226 Difference]: Without dead ends: 12378 [2019-12-27 03:42:33,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=1509, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 03:42:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12378 states. [2019-12-27 03:42:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12378 to 9299. [2019-12-27 03:42:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9299 states. [2019-12-27 03:42:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9299 states to 9299 states and 28300 transitions. [2019-12-27 03:42:33,745 INFO L78 Accepts]: Start accepts. Automaton has 9299 states and 28300 transitions. Word has length 56 [2019-12-27 03:42:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:33,745 INFO L462 AbstractCegarLoop]: Abstraction has 9299 states and 28300 transitions. [2019-12-27 03:42:33,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:42:33,745 INFO L276 IsEmpty]: Start isEmpty. Operand 9299 states and 28300 transitions. [2019-12-27 03:42:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:33,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:33,756 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] [2019-12-27 03:42:33,756 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:33,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1965983168, now seen corresponding path program 4 times [2019-12-27 03:42:33,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:33,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267833079] [2019-12-27 03:42:33,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:34,481 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 9 [2019-12-27 03:42:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:34,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267833079] [2019-12-27 03:42:34,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:34,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 03:42:34,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144585589] [2019-12-27 03:42:34,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 03:42:34,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:34,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 03:42:34,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 03:42:34,588 INFO L87 Difference]: Start difference. First operand 9299 states and 28300 transitions. Second operand 14 states. [2019-12-27 03:42:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:37,346 INFO L93 Difference]: Finished difference Result 14938 states and 44433 transitions. [2019-12-27 03:42:37,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 03:42:37,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 56 [2019-12-27 03:42:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:37,365 INFO L225 Difference]: With dead ends: 14938 [2019-12-27 03:42:37,366 INFO L226 Difference]: Without dead ends: 11846 [2019-12-27 03:42:37,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=329, Invalid=1741, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 03:42:37,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11846 states. [2019-12-27 03:42:37,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11846 to 9277. [2019-12-27 03:42:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9277 states. [2019-12-27 03:42:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9277 states to 9277 states and 28152 transitions. [2019-12-27 03:42:37,520 INFO L78 Accepts]: Start accepts. Automaton has 9277 states and 28152 transitions. Word has length 56 [2019-12-27 03:42:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:37,520 INFO L462 AbstractCegarLoop]: Abstraction has 9277 states and 28152 transitions. [2019-12-27 03:42:37,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 03:42:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9277 states and 28152 transitions. [2019-12-27 03:42:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:37,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:37,530 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] [2019-12-27 03:42:37,530 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -99229424, now seen corresponding path program 5 times [2019-12-27 03:42:37,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:37,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442789131] [2019-12-27 03:42:37,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:37,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442789131] [2019-12-27 03:42:37,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:37,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:42:37,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690742706] [2019-12-27 03:42:37,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:42:37,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:42:37,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:42:37,914 INFO L87 Difference]: Start difference. First operand 9277 states and 28152 transitions. Second operand 15 states. [2019-12-27 03:42:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:41,545 INFO L93 Difference]: Finished difference Result 14649 states and 43565 transitions. [2019-12-27 03:42:41,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 03:42:41,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 03:42:41,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:41,561 INFO L225 Difference]: With dead ends: 14649 [2019-12-27 03:42:41,562 INFO L226 Difference]: Without dead ends: 11794 [2019-12-27 03:42:41,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 03:42:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11794 states. [2019-12-27 03:42:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11794 to 9509. [2019-12-27 03:42:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9509 states. [2019-12-27 03:42:41,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9509 states to 9509 states and 28733 transitions. [2019-12-27 03:42:41,712 INFO L78 Accepts]: Start accepts. Automaton has 9509 states and 28733 transitions. Word has length 56 [2019-12-27 03:42:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:41,712 INFO L462 AbstractCegarLoop]: Abstraction has 9509 states and 28733 transitions. [2019-12-27 03:42:41,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:42:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 9509 states and 28733 transitions. [2019-12-27 03:42:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:41,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:41,723 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] [2019-12-27 03:42:41,723 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1968566384, now seen corresponding path program 6 times [2019-12-27 03:42:41,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:41,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401231290] [2019-12-27 03:42:41,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:42,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401231290] [2019-12-27 03:42:42,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:42,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:42:42,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074870182] [2019-12-27 03:42:42,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:42:42,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:42,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:42:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:42:42,068 INFO L87 Difference]: Start difference. First operand 9509 states and 28733 transitions. Second operand 15 states. [2019-12-27 03:42:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:44,863 INFO L93 Difference]: Finished difference Result 13030 states and 38673 transitions. [2019-12-27 03:42:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 03:42:44,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 03:42:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:44,880 INFO L225 Difference]: With dead ends: 13030 [2019-12-27 03:42:44,881 INFO L226 Difference]: Without dead ends: 11956 [2019-12-27 03:42:44,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=1290, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 03:42:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11956 states. [2019-12-27 03:42:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11956 to 9347. [2019-12-27 03:42:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9347 states. [2019-12-27 03:42:45,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9347 states to 9347 states and 28310 transitions. [2019-12-27 03:42:45,033 INFO L78 Accepts]: Start accepts. Automaton has 9347 states and 28310 transitions. Word has length 56 [2019-12-27 03:42:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:45,033 INFO L462 AbstractCegarLoop]: Abstraction has 9347 states and 28310 transitions. [2019-12-27 03:42:45,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:42:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 9347 states and 28310 transitions. [2019-12-27 03:42:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:45,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:45,042 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] [2019-12-27 03:42:45,043 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1835391846, now seen corresponding path program 7 times [2019-12-27 03:42:45,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:45,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67726782] [2019-12-27 03:42:45,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:45,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67726782] [2019-12-27 03:42:45,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:45,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 03:42:45,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267817849] [2019-12-27 03:42:45,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 03:42:45,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:45,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 03:42:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 03:42:45,353 INFO L87 Difference]: Start difference. First operand 9347 states and 28310 transitions. Second operand 15 states. [2019-12-27 03:42:47,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:47,948 INFO L93 Difference]: Finished difference Result 13090 states and 38976 transitions. [2019-12-27 03:42:47,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 03:42:47,949 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 03:42:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:47,966 INFO L225 Difference]: With dead ends: 13090 [2019-12-27 03:42:47,966 INFO L226 Difference]: Without dead ends: 11828 [2019-12-27 03:42:47,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1221, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 03:42:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11828 states. [2019-12-27 03:42:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11828 to 9315. [2019-12-27 03:42:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9315 states. [2019-12-27 03:42:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9315 states to 9315 states and 28209 transitions. [2019-12-27 03:42:48,117 INFO L78 Accepts]: Start accepts. Automaton has 9315 states and 28209 transitions. Word has length 56 [2019-12-27 03:42:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:48,118 INFO L462 AbstractCegarLoop]: Abstraction has 9315 states and 28209 transitions. [2019-12-27 03:42:48,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 03:42:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 9315 states and 28209 transitions. [2019-12-27 03:42:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:48,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:48,128 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] [2019-12-27 03:42:48,128 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:48,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:48,128 INFO L82 PathProgramCache]: Analyzing trace with hash 369131540, now seen corresponding path program 8 times [2019-12-27 03:42:48,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729416062] [2019-12-27 03:42:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:48,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729416062] [2019-12-27 03:42:48,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:48,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 03:42:48,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780441259] [2019-12-27 03:42:48,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 03:42:48,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 03:42:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:42:48,738 INFO L87 Difference]: Start difference. First operand 9315 states and 28209 transitions. Second operand 18 states. [2019-12-27 03:42:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:51,910 INFO L93 Difference]: Finished difference Result 12667 states and 37421 transitions. [2019-12-27 03:42:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 03:42:51,910 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-12-27 03:42:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:51,928 INFO L225 Difference]: With dead ends: 12667 [2019-12-27 03:42:51,928 INFO L226 Difference]: Without dead ends: 10705 [2019-12-27 03:42:51,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=463, Invalid=2843, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 03:42:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10705 states. [2019-12-27 03:42:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10705 to 9234. [2019-12-27 03:42:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 03:42:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 28056 transitions. [2019-12-27 03:42:52,077 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 28056 transitions. Word has length 56 [2019-12-27 03:42:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 03:42:52,077 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 28056 transitions. [2019-12-27 03:42:52,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 03:42:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 28056 transitions. [2019-12-27 03:42:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 03:42:52,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 03:42:52,087 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] [2019-12-27 03:42:52,087 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 03:42:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 03:42:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1879577232, now seen corresponding path program 9 times [2019-12-27 03:42:52,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 03:42:52,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769972624] [2019-12-27 03:42:52,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 03:42:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 03:42:52,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 03:42:52,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769972624] [2019-12-27 03:42:52,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 03:42:52,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 03:42:52,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343947920] [2019-12-27 03:42:52,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 03:42:52,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 03:42:52,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 03:42:52,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 03:42:52,192 INFO L87 Difference]: Start difference. First operand 9234 states and 28056 transitions. Second operand 9 states. [2019-12-27 03:42:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 03:42:52,914 INFO L93 Difference]: Finished difference Result 14051 states and 42281 transitions. [2019-12-27 03:42:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 03:42:52,915 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 03:42:52,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 03:42:52,930 INFO L225 Difference]: With dead ends: 14051 [2019-12-27 03:42:52,930 INFO L226 Difference]: Without dead ends: 10112 [2019-12-27 03:42:52,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 03:42:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10112 states. Received shutdown request... [2019-12-27 03:42:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10112 to 9046. [2019-12-27 03:42:53,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9046 states. [2019-12-27 03:42:53,620 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 03:42:53,624 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 03:42:53,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 03:42:53 BasicIcfg [2019-12-27 03:42:53,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 03:42:53,627 INFO L168 Benchmark]: Toolchain (without parser) took 195006.64 ms. Allocated memory was 146.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 101.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,627 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 03:42:53,628 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.80 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 154.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,628 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,629 INFO L168 Benchmark]: RCFGBuilder took 812.09 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 105.4 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,629 INFO L168 Benchmark]: TraceAbstraction took 193243.55 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 104.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 03:42:53,632 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 146.3 MB. Free memory is still 121.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.80 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 156.1 MB in the end (delta: -55.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.26 ms. Allocated memory is still 203.9 MB. Free memory was 156.1 MB in the beginning and 154.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 203.9 MB. Free memory was 154.3 MB in the beginning and 151.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.09 ms. Allocated memory is still 203.9 MB. Free memory was 151.5 MB in the beginning and 105.4 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 193243.55 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 104.4 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: TIMEOUT, OverallTime: 193.0s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 66.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5097 SDtfs, 10448 SDslu, 18691 SDs, 0 SdLazy, 22611 SolverSat, 727 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 574 GetRequests, 41 SyntacticMatches, 18 SemanticMatches, 515 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4522 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 104.6s AutomataMinimizationTime, 30 MinimizatonAttempts, 195197 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1138 ConstructedInterpolants, 0 QuantifiedInterpolants, 239805 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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