/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/rfi002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:02:32,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:02:32,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:02:32,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:02:32,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:02:32,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:02:32,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:02:32,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:02:32,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:02:32,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:02:32,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:02:32,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:02:32,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:02:32,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:02:32,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:02:32,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:02:32,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:02:32,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:02:32,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:02:32,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:02:32,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:02:32,397 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:02:32,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:02:32,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:02:32,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:02:32,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:02:32,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:02:32,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:02:32,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:02:32,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:02:32,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:02:32,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:02:32,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:02:32,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:02:32,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:02:32,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:02:32,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:02:32,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:02:32,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:02:32,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:02:32,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:02:32,412 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-18 18:02:32,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:02:32,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:02:32,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:02:32,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:02:32,428 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:02:32,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:02:32,428 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:02:32,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:02:32,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:02:32,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:02:32,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:02:32,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:02:32,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:02:32,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:02:32,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:02:32,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:02:32,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:02:32,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:02:32,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:02:32,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:02:32,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:02:32,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:32,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:02:32,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:02:32,432 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:02:32,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:02:32,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:02:32,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:02:32,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:02:32,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:02:32,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:02:32,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:02:32,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:02:32,739 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:02:32,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-18 18:02:32,813 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30689ae5a/9f55246867e1450697ee56327fb31d3d/FLAGbf816466c [2019-12-18 18:02:33,421 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:02:33,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.opt.i [2019-12-18 18:02:33,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30689ae5a/9f55246867e1450697ee56327fb31d3d/FLAGbf816466c [2019-12-18 18:02:33,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30689ae5a/9f55246867e1450697ee56327fb31d3d [2019-12-18 18:02:33,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:02:33,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:02:33,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:33,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:02:33,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:02:33,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:33" (1/1) ... [2019-12-18 18:02:33,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:33, skipping insertion in model container [2019-12-18 18:02:33,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:33" (1/1) ... [2019-12-18 18:02:33,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:02:33,777 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:02:34,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:34,315 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:02:34,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:34,521 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:02:34,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34 WrapperNode [2019-12-18 18:02:34,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:34,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:34,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:02:34,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:02:34,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:34,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:02:34,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:02:34,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:02:34,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... [2019-12-18 18:02:34,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:02:34,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:02:34,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:02:34,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:02:34,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:34,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:02:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:02:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:02:34,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:02:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:02:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:02:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:02:34,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:02:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:02:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:02:34,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:02:34,722 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:02:35,986 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:02:35,986 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:02:35,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:35 BoogieIcfgContainer [2019-12-18 18:02:35,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:02:35,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:02:35,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:02:35,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:02:35,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:02:33" (1/3) ... [2019-12-18 18:02:35,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d67040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:35, skipping insertion in model container [2019-12-18 18:02:35,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:34" (2/3) ... [2019-12-18 18:02:35,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d67040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:35, skipping insertion in model container [2019-12-18 18:02:35,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:35" (3/3) ... [2019-12-18 18:02:35,998 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.opt.i [2019-12-18 18:02:36,008 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:02:36,009 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:02:36,022 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:02:36,022 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:02:36,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,071 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,082 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,083 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,084 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,085 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,086 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,087 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,089 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,090 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,103 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,118 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,134 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,143 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,145 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,147 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:36,166 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:02:36,190 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:02:36,190 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:02:36,190 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:02:36,190 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:02:36,190 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:02:36,191 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:02:36,191 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:02:36,191 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:02:36,216 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 18:02:36,218 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:36,370 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:36,370 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:36,425 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:36,539 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:36,659 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:36,660 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:36,681 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 18:02:36,733 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 18:02:36,734 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:02:44,360 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:02:44,474 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:02:44,623 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 18:02:44,623 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 18:02:44,628 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 18:02:58,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 18:02:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 18:02:58,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:02:58,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:02:58,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:02:58,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:02:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:02:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 18:02:58,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:02:58,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976279680] [2019-12-18 18:02:58,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:02:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:02:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:02:59,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976279680] [2019-12-18 18:02:59,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:02:59,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:02:59,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671562786] [2019-12-18 18:02:59,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:02:59,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:02:59,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:02:59,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:02:59,191 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 18:03:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:01,966 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 18:03:01,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:03:01,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:03:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:02,629 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 18:03:02,629 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 18:03:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 18:03:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 18:03:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 18:03:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 18:03:14,048 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 18:03:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:14,048 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 18:03:14,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:03:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 18:03:14,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:14,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:14,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:14,052 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:14,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:14,052 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 18:03:14,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:14,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094655239] [2019-12-18 18:03:14,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094655239] [2019-12-18 18:03:14,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:14,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:14,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221294978] [2019-12-18 18:03:14,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:14,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:14,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:14,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:14,133 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 18:03:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:19,403 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 18:03:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:19,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:19,923 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 18:03:19,923 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 18:03:19,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 18:03:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 18:03:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 18:03:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 18:03:28,849 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 18:03:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:28,849 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 18:03:28,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 18:03:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:28,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:28,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:28,853 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 18:03:28,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:28,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147262981] [2019-12-18 18:03:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:28,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147262981] [2019-12-18 18:03:28,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:28,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:28,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297465316] [2019-12-18 18:03:28,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:28,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:28,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:28,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:28,959 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 18:03:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:34,302 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 18:03:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:34,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:34,808 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 18:03:34,808 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 18:03:34,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 18:03:45,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 18:03:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 18:03:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 18:03:45,929 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 18:03:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:45,929 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 18:03:45,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 18:03:45,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:03:45,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:45,936 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:45,941 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:03:45,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 18:03:45,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:45,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324013496] [2019-12-18 18:03:45,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:03:46,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324013496] [2019-12-18 18:03:46,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:46,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:03:46,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935904641] [2019-12-18 18:03:46,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:46,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:46,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:46,037 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-18 18:03:53,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:53,374 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-18 18:03:53,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:03:53,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:03:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:53,922 INFO L225 Difference]: With dead ends: 244942 [2019-12-18 18:03:53,923 INFO L226 Difference]: Without dead ends: 244942 [2019-12-18 18:03:53,923 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-18 18:04:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-18 18:04:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-18 18:04:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-18 18:04:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-18 18:04:06,541 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-18 18:04:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:06,541 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-18 18:04:06,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-18 18:04:06,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:06,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:06,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:06,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:06,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:06,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 18:04:06,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:06,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600714787] [2019-12-18 18:04:06,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:06,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600714787] [2019-12-18 18:04:06,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:06,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:06,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049663540] [2019-12-18 18:04:06,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:06,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:06,811 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 7 states. [2019-12-18 18:04:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:15,153 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-18 18:04:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:15,154 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-18 18:04:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:15,809 INFO L225 Difference]: With dead ends: 255390 [2019-12-18 18:04:15,809 INFO L226 Difference]: Without dead ends: 255390 [2019-12-18 18:04:15,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:22,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-18 18:04:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-18 18:04:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-18 18:04:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-18 18:04:28,040 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-18 18:04:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:28,041 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-18 18:04:28,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:28,041 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-18 18:04:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:28,064 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:28,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:28,065 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:28,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-18 18:04:28,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:28,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368737990] [2019-12-18 18:04:28,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:28,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368737990] [2019-12-18 18:04:28,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:28,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:04:28,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303548239] [2019-12-18 18:04:28,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:04:28,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:28,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:04:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:04:28,128 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-18 18:04:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:28,198 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-18 18:04:28,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:04:28,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:04:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:28,212 INFO L225 Difference]: With dead ends: 14741 [2019-12-18 18:04:28,212 INFO L226 Difference]: Without dead ends: 10693 [2019-12-18 18:04:28,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-18 18:04:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-18 18:04:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-18 18:04:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-18 18:04:28,360 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-18 18:04:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:28,360 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-18 18:04:28,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:04:28,360 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-18 18:04:28,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 18:04:28,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:28,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:28,366 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:28,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:28,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 18:04:28,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:28,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832673071] [2019-12-18 18:04:28,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:28,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832673071] [2019-12-18 18:04:28,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:28,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:28,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673973469] [2019-12-18 18:04:28,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:04:28,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:28,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:04:28,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:28,565 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 8 states. [2019-12-18 18:04:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:31,863 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-18 18:04:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:31,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-12-18 18:04:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:31,879 INFO L225 Difference]: With dead ends: 11962 [2019-12-18 18:04:31,879 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 18:04:31,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 18:04:32,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-18 18:04:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 18:04:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-18 18:04:32,016 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-18 18:04:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:32,017 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-18 18:04:32,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:04:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-18 18:04:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:04:32,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:32,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:32,024 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:32,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:32,025 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 18:04:32,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:32,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388072520] [2019-12-18 18:04:32,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:32,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:32,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388072520] [2019-12-18 18:04:32,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:32,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:04:32,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294022000] [2019-12-18 18:04:32,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:32,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:32,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:32,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:32,109 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 5 states. [2019-12-18 18:04:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:32,158 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-18 18:04:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:04:32,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-18 18:04:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:32,165 INFO L225 Difference]: With dead ends: 4762 [2019-12-18 18:04:32,165 INFO L226 Difference]: Without dead ends: 4575 [2019-12-18 18:04:32,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:32,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-18 18:04:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-18 18:04:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-18 18:04:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-18 18:04:32,212 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-18 18:04:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:32,213 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-18 18:04:32,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-18 18:04:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:32,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:32,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:32,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:32,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:32,220 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 18:04:32,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:32,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796095483] [2019-12-18 18:04:32,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:32,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796095483] [2019-12-18 18:04:32,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:32,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:04:32,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131729218] [2019-12-18 18:04:32,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:04:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:04:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:32,398 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 3 states. [2019-12-18 18:04:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:32,460 INFO L93 Difference]: Finished difference Result 4507 states and 10719 transitions. [2019-12-18 18:04:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:04:32,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 18:04:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:32,468 INFO L225 Difference]: With dead ends: 4507 [2019-12-18 18:04:32,468 INFO L226 Difference]: Without dead ends: 4507 [2019-12-18 18:04:32,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:32,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-18 18:04:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4507. [2019-12-18 18:04:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-18 18:04:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10719 transitions. [2019-12-18 18:04:32,518 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10719 transitions. Word has length 94 [2019-12-18 18:04:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:32,518 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10719 transitions. [2019-12-18 18:04:32,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:04:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10719 transitions. [2019-12-18 18:04:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:32,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:32,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:32,524 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:32,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash 154163826, now seen corresponding path program 1 times [2019-12-18 18:04:32,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:32,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826297442] [2019-12-18 18:04:32,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:32,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:32,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826297442] [2019-12-18 18:04:32,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:32,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:32,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672058106] [2019-12-18 18:04:32,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:32,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:32,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:32,643 INFO L87 Difference]: Start difference. First operand 4507 states and 10719 transitions. Second operand 6 states. [2019-12-18 18:04:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:33,293 INFO L93 Difference]: Finished difference Result 5117 states and 11960 transitions. [2019-12-18 18:04:33,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:33,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:04:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:33,301 INFO L225 Difference]: With dead ends: 5117 [2019-12-18 18:04:33,301 INFO L226 Difference]: Without dead ends: 5117 [2019-12-18 18:04:33,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2019-12-18 18:04:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 4935. [2019-12-18 18:04:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-12-18 18:04:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 11615 transitions. [2019-12-18 18:04:33,354 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 11615 transitions. Word has length 95 [2019-12-18 18:04:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:33,354 INFO L462 AbstractCegarLoop]: Abstraction has 4935 states and 11615 transitions. [2019-12-18 18:04:33,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 11615 transitions. [2019-12-18 18:04:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:33,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:33,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:33,361 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:33,361 INFO L82 PathProgramCache]: Analyzing trace with hash 594436802, now seen corresponding path program 2 times [2019-12-18 18:04:33,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:33,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037160981] [2019-12-18 18:04:33,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:33,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037160981] [2019-12-18 18:04:33,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:33,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:33,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779392616] [2019-12-18 18:04:33,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:33,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:33,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:33,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:33,474 INFO L87 Difference]: Start difference. First operand 4935 states and 11615 transitions. Second operand 5 states. [2019-12-18 18:04:34,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:34,031 INFO L93 Difference]: Finished difference Result 5423 states and 12622 transitions. [2019-12-18 18:04:34,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:34,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-18 18:04:34,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:34,040 INFO L225 Difference]: With dead ends: 5423 [2019-12-18 18:04:34,041 INFO L226 Difference]: Without dead ends: 5423 [2019-12-18 18:04:34,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2019-12-18 18:04:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 4999. [2019-12-18 18:04:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-18 18:04:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11771 transitions. [2019-12-18 18:04:34,124 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11771 transitions. Word has length 95 [2019-12-18 18:04:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:34,126 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11771 transitions. [2019-12-18 18:04:34,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11771 transitions. [2019-12-18 18:04:34,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:34,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:34,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:34,135 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:34,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:34,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1854124544, now seen corresponding path program 3 times [2019-12-18 18:04:34,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:34,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402122234] [2019-12-18 18:04:34,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:34,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402122234] [2019-12-18 18:04:34,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:34,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:34,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156018049] [2019-12-18 18:04:34,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:34,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:34,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:34,306 INFO L87 Difference]: Start difference. First operand 4999 states and 11771 transitions. Second operand 6 states. [2019-12-18 18:04:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:35,005 INFO L93 Difference]: Finished difference Result 5310 states and 12365 transitions. [2019-12-18 18:04:35,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:35,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:04:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:35,011 INFO L225 Difference]: With dead ends: 5310 [2019-12-18 18:04:35,011 INFO L226 Difference]: Without dead ends: 5310 [2019-12-18 18:04:35,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-18 18:04:35,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 4999. [2019-12-18 18:04:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-18 18:04:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11771 transitions. [2019-12-18 18:04:35,062 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11771 transitions. Word has length 95 [2019-12-18 18:04:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:35,063 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11771 transitions. [2019-12-18 18:04:35,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11771 transitions. [2019-12-18 18:04:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:35,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:35,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:35,069 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1605437190, now seen corresponding path program 4 times [2019-12-18 18:04:35,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:35,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827797179] [2019-12-18 18:04:35,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:35,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827797179] [2019-12-18 18:04:35,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:35,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:35,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996053974] [2019-12-18 18:04:35,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:35,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:35,230 INFO L87 Difference]: Start difference. First operand 4999 states and 11771 transitions. Second operand 10 states. [2019-12-18 18:04:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:36,327 INFO L93 Difference]: Finished difference Result 12171 states and 27836 transitions. [2019-12-18 18:04:36,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:04:36,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 18:04:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:36,348 INFO L225 Difference]: With dead ends: 12171 [2019-12-18 18:04:36,348 INFO L226 Difference]: Without dead ends: 10548 [2019-12-18 18:04:36,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:04:36,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2019-12-18 18:04:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 6670. [2019-12-18 18:04:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2019-12-18 18:04:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 16056 transitions. [2019-12-18 18:04:36,563 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 16056 transitions. Word has length 95 [2019-12-18 18:04:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:36,563 INFO L462 AbstractCegarLoop]: Abstraction has 6670 states and 16056 transitions. [2019-12-18 18:04:36,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 16056 transitions. [2019-12-18 18:04:36,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:36,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:36,578 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:36,578 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:36,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:36,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1454072868, now seen corresponding path program 5 times [2019-12-18 18:04:36,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:36,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229450176] [2019-12-18 18:04:36,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:36,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229450176] [2019-12-18 18:04:36,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:36,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:36,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540388765] [2019-12-18 18:04:36,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:36,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:36,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:36,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:36,730 INFO L87 Difference]: Start difference. First operand 6670 states and 16056 transitions. Second operand 6 states. [2019-12-18 18:04:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:37,471 INFO L93 Difference]: Finished difference Result 7144 states and 16993 transitions. [2019-12-18 18:04:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:37,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:04:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:37,480 INFO L225 Difference]: With dead ends: 7144 [2019-12-18 18:04:37,481 INFO L226 Difference]: Without dead ends: 7144 [2019-12-18 18:04:37,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:04:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7144 states. [2019-12-18 18:04:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7144 to 6835. [2019-12-18 18:04:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6835 states. [2019-12-18 18:04:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6835 states to 6835 states and 16405 transitions. [2019-12-18 18:04:37,566 INFO L78 Accepts]: Start accepts. Automaton has 6835 states and 16405 transitions. Word has length 95 [2019-12-18 18:04:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:37,566 INFO L462 AbstractCegarLoop]: Abstraction has 6835 states and 16405 transitions. [2019-12-18 18:04:37,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 6835 states and 16405 transitions. [2019-12-18 18:04:37,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:37,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:37,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:37,576 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash 822691358, now seen corresponding path program 6 times [2019-12-18 18:04:37,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:37,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507402914] [2019-12-18 18:04:37,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:37,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:37,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507402914] [2019-12-18 18:04:37,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:37,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:37,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47280248] [2019-12-18 18:04:37,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:37,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:37,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:37,689 INFO L87 Difference]: Start difference. First operand 6835 states and 16405 transitions. Second operand 6 states. [2019-12-18 18:04:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:38,565 INFO L93 Difference]: Finished difference Result 12533 states and 29639 transitions. [2019-12-18 18:04:38,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:38,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:04:38,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:38,584 INFO L225 Difference]: With dead ends: 12533 [2019-12-18 18:04:38,584 INFO L226 Difference]: Without dead ends: 12533 [2019-12-18 18:04:38,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12533 states. [2019-12-18 18:04:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12533 to 10132. [2019-12-18 18:04:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10132 states. [2019-12-18 18:04:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10132 states to 10132 states and 24670 transitions. [2019-12-18 18:04:38,760 INFO L78 Accepts]: Start accepts. Automaton has 10132 states and 24670 transitions. Word has length 95 [2019-12-18 18:04:38,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:38,760 INFO L462 AbstractCegarLoop]: Abstraction has 10132 states and 24670 transitions. [2019-12-18 18:04:38,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:38,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10132 states and 24670 transitions. [2019-12-18 18:04:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:38,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:38,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:38,772 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 75442206, now seen corresponding path program 7 times [2019-12-18 18:04:38,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:38,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139383576] [2019-12-18 18:04:38,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:38,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139383576] [2019-12-18 18:04:38,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:38,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:38,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57546768] [2019-12-18 18:04:38,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:38,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:38,932 INFO L87 Difference]: Start difference. First operand 10132 states and 24670 transitions. Second operand 10 states. [2019-12-18 18:04:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:39,728 INFO L93 Difference]: Finished difference Result 24200 states and 58260 transitions. [2019-12-18 18:04:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 18:04:39,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-18 18:04:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:39,755 INFO L225 Difference]: With dead ends: 24200 [2019-12-18 18:04:39,755 INFO L226 Difference]: Without dead ends: 21867 [2019-12-18 18:04:39,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:04:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21867 states. [2019-12-18 18:04:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21867 to 16198. [2019-12-18 18:04:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16198 states. [2019-12-18 18:04:39,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16198 states to 16198 states and 40163 transitions. [2019-12-18 18:04:39,990 INFO L78 Accepts]: Start accepts. Automaton has 16198 states and 40163 transitions. Word has length 95 [2019-12-18 18:04:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:39,990 INFO L462 AbstractCegarLoop]: Abstraction has 16198 states and 40163 transitions. [2019-12-18 18:04:39,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:39,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16198 states and 40163 transitions. [2019-12-18 18:04:40,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:40,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:40,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:40,012 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:40,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1283023010, now seen corresponding path program 8 times [2019-12-18 18:04:40,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:40,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081698588] [2019-12-18 18:04:40,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:40,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081698588] [2019-12-18 18:04:40,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:40,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:40,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880622829] [2019-12-18 18:04:40,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:40,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:40,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:40,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:40,128 INFO L87 Difference]: Start difference. First operand 16198 states and 40163 transitions. Second operand 7 states. [2019-12-18 18:04:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:40,930 INFO L93 Difference]: Finished difference Result 36533 states and 90597 transitions. [2019-12-18 18:04:40,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:40,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:40,975 INFO L225 Difference]: With dead ends: 36533 [2019-12-18 18:04:40,975 INFO L226 Difference]: Without dead ends: 36533 [2019-12-18 18:04:40,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:41,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36533 states. [2019-12-18 18:04:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36533 to 16260. [2019-12-18 18:04:41,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16260 states. [2019-12-18 18:04:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16260 states to 16260 states and 40310 transitions. [2019-12-18 18:04:41,281 INFO L78 Accepts]: Start accepts. Automaton has 16260 states and 40310 transitions. Word has length 95 [2019-12-18 18:04:41,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:41,282 INFO L462 AbstractCegarLoop]: Abstraction has 16260 states and 40310 transitions. [2019-12-18 18:04:41,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 16260 states and 40310 transitions. [2019-12-18 18:04:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:41,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:41,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:41,299 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:41,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -821045652, now seen corresponding path program 9 times [2019-12-18 18:04:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:41,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164387309] [2019-12-18 18:04:41,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:41,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164387309] [2019-12-18 18:04:41,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:41,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:41,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816126427] [2019-12-18 18:04:41,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:41,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:41,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:41,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:41,413 INFO L87 Difference]: Start difference. First operand 16260 states and 40310 transitions. Second operand 7 states. [2019-12-18 18:04:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:42,447 INFO L93 Difference]: Finished difference Result 19268 states and 46641 transitions. [2019-12-18 18:04:42,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:42,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:42,466 INFO L225 Difference]: With dead ends: 19268 [2019-12-18 18:04:42,466 INFO L226 Difference]: Without dead ends: 19268 [2019-12-18 18:04:42,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-12-18 18:04:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 16146. [2019-12-18 18:04:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16146 states. [2019-12-18 18:04:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16146 states to 16146 states and 40065 transitions. [2019-12-18 18:04:42,686 INFO L78 Accepts]: Start accepts. Automaton has 16146 states and 40065 transitions. Word has length 95 [2019-12-18 18:04:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:42,686 INFO L462 AbstractCegarLoop]: Abstraction has 16146 states and 40065 transitions. [2019-12-18 18:04:42,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 16146 states and 40065 transitions. [2019-12-18 18:04:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:42,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:42,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:42,706 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:42,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 10 times [2019-12-18 18:04:42,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:42,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453279350] [2019-12-18 18:04:42,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:42,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453279350] [2019-12-18 18:04:42,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:42,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:42,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846220608] [2019-12-18 18:04:42,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:42,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:42,824 INFO L87 Difference]: Start difference. First operand 16146 states and 40065 transitions. Second operand 7 states. [2019-12-18 18:04:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:43,549 INFO L93 Difference]: Finished difference Result 17149 states and 42143 transitions. [2019-12-18 18:04:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:43,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:43,569 INFO L225 Difference]: With dead ends: 17149 [2019-12-18 18:04:43,569 INFO L226 Difference]: Without dead ends: 17149 [2019-12-18 18:04:43,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17149 states. [2019-12-18 18:04:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17149 to 16221. [2019-12-18 18:04:43,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16221 states. [2019-12-18 18:04:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16221 states to 16221 states and 40248 transitions. [2019-12-18 18:04:43,769 INFO L78 Accepts]: Start accepts. Automaton has 16221 states and 40248 transitions. Word has length 95 [2019-12-18 18:04:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:43,770 INFO L462 AbstractCegarLoop]: Abstraction has 16221 states and 40248 transitions. [2019-12-18 18:04:43,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16221 states and 40248 transitions. [2019-12-18 18:04:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:43,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:43,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:43,785 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1018864798, now seen corresponding path program 11 times [2019-12-18 18:04:43,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:43,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181663262] [2019-12-18 18:04:43,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:43,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181663262] [2019-12-18 18:04:43,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:43,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:43,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668366197] [2019-12-18 18:04:43,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:43,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:43,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:43,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:43,893 INFO L87 Difference]: Start difference. First operand 16221 states and 40248 transitions. Second operand 7 states. [2019-12-18 18:04:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:44,625 INFO L93 Difference]: Finished difference Result 17066 states and 41947 transitions. [2019-12-18 18:04:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:44,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:44,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:44,645 INFO L225 Difference]: With dead ends: 17066 [2019-12-18 18:04:44,645 INFO L226 Difference]: Without dead ends: 17066 [2019-12-18 18:04:44,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17066 states. [2019-12-18 18:04:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17066 to 16179. [2019-12-18 18:04:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16179 states. [2019-12-18 18:04:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 40152 transitions. [2019-12-18 18:04:44,843 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 40152 transitions. Word has length 95 [2019-12-18 18:04:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:44,843 INFO L462 AbstractCegarLoop]: Abstraction has 16179 states and 40152 transitions. [2019-12-18 18:04:44,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 40152 transitions. [2019-12-18 18:04:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:44,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:44,859 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:44,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash -282359162, now seen corresponding path program 12 times [2019-12-18 18:04:44,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:44,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103269347] [2019-12-18 18:04:44,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:45,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:45,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103269347] [2019-12-18 18:04:45,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:45,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:04:45,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931120395] [2019-12-18 18:04:45,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:04:45,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:45,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:04:45,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:04:45,341 INFO L87 Difference]: Start difference. First operand 16179 states and 40152 transitions. Second operand 13 states. [2019-12-18 18:04:47,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:47,280 INFO L93 Difference]: Finished difference Result 22701 states and 56541 transitions. [2019-12-18 18:04:47,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 18:04:47,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-18 18:04:47,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:47,310 INFO L225 Difference]: With dead ends: 22701 [2019-12-18 18:04:47,311 INFO L226 Difference]: Without dead ends: 22659 [2019-12-18 18:04:47,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:04:47,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22659 states. [2019-12-18 18:04:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22659 to 15041. [2019-12-18 18:04:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15041 states. [2019-12-18 18:04:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15041 states to 15041 states and 37387 transitions. [2019-12-18 18:04:47,543 INFO L78 Accepts]: Start accepts. Automaton has 15041 states and 37387 transitions. Word has length 95 [2019-12-18 18:04:47,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:47,544 INFO L462 AbstractCegarLoop]: Abstraction has 15041 states and 37387 transitions. [2019-12-18 18:04:47,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:04:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 15041 states and 37387 transitions. [2019-12-18 18:04:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:47,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:47,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:47,559 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:47,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1607730014, now seen corresponding path program 1 times [2019-12-18 18:04:47,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:47,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414285553] [2019-12-18 18:04:47,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:47,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414285553] [2019-12-18 18:04:47,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:47,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:47,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334510538] [2019-12-18 18:04:47,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:47,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:47,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:47,648 INFO L87 Difference]: Start difference. First operand 15041 states and 37387 transitions. Second operand 6 states. [2019-12-18 18:04:47,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:47,904 INFO L93 Difference]: Finished difference Result 16858 states and 41336 transitions. [2019-12-18 18:04:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:47,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 18:04:47,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:47,934 INFO L225 Difference]: With dead ends: 16858 [2019-12-18 18:04:47,934 INFO L226 Difference]: Without dead ends: 15428 [2019-12-18 18:04:47,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:47,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15428 states. [2019-12-18 18:04:48,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15428 to 15354. [2019-12-18 18:04:48,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15354 states. [2019-12-18 18:04:48,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15354 states to 15354 states and 38139 transitions. [2019-12-18 18:04:48,290 INFO L78 Accepts]: Start accepts. Automaton has 15354 states and 38139 transitions. Word has length 96 [2019-12-18 18:04:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:48,290 INFO L462 AbstractCegarLoop]: Abstraction has 15354 states and 38139 transitions. [2019-12-18 18:04:48,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15354 states and 38139 transitions. [2019-12-18 18:04:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:48,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:48,317 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:48,317 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:48,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:48,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1923547038, now seen corresponding path program 2 times [2019-12-18 18:04:48,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:48,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901352239] [2019-12-18 18:04:48,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:48,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901352239] [2019-12-18 18:04:48,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:48,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:04:48,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903605200] [2019-12-18 18:04:48,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 18:04:48,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:48,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 18:04:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:04:48,687 INFO L87 Difference]: Start difference. First operand 15354 states and 38139 transitions. Second operand 17 states. [2019-12-18 18:04:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:51,933 INFO L93 Difference]: Finished difference Result 27870 states and 67832 transitions. [2019-12-18 18:04:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 18:04:51,935 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-12-18 18:04:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:51,966 INFO L225 Difference]: With dead ends: 27870 [2019-12-18 18:04:51,966 INFO L226 Difference]: Without dead ends: 26822 [2019-12-18 18:04:51,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 18:04:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26822 states. [2019-12-18 18:04:52,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26822 to 20450. [2019-12-18 18:04:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20450 states. [2019-12-18 18:04:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20450 states to 20450 states and 51023 transitions. [2019-12-18 18:04:52,274 INFO L78 Accepts]: Start accepts. Automaton has 20450 states and 51023 transitions. Word has length 96 [2019-12-18 18:04:52,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:52,274 INFO L462 AbstractCegarLoop]: Abstraction has 20450 states and 51023 transitions. [2019-12-18 18:04:52,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 18:04:52,274 INFO L276 IsEmpty]: Start isEmpty. Operand 20450 states and 51023 transitions. [2019-12-18 18:04:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:52,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:52,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:52,293 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:52,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:52,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1937169854, now seen corresponding path program 3 times [2019-12-18 18:04:52,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:52,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134652097] [2019-12-18 18:04:52,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:52,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:52,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134652097] [2019-12-18 18:04:52,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:52,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:52,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657106915] [2019-12-18 18:04:52,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:52,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:52,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:52,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:52,412 INFO L87 Difference]: Start difference. First operand 20450 states and 51023 transitions. Second operand 5 states. [2019-12-18 18:04:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:53,028 INFO L93 Difference]: Finished difference Result 25703 states and 64119 transitions. [2019-12-18 18:04:53,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:53,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-18 18:04:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:53,070 INFO L225 Difference]: With dead ends: 25703 [2019-12-18 18:04:53,071 INFO L226 Difference]: Without dead ends: 25703 [2019-12-18 18:04:53,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:53,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-18 18:04:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 21653. [2019-12-18 18:04:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21653 states. [2019-12-18 18:04:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21653 states to 21653 states and 54057 transitions. [2019-12-18 18:04:53,545 INFO L78 Accepts]: Start accepts. Automaton has 21653 states and 54057 transitions. Word has length 96 [2019-12-18 18:04:53,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:53,545 INFO L462 AbstractCegarLoop]: Abstraction has 21653 states and 54057 transitions. [2019-12-18 18:04:53,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 21653 states and 54057 transitions. [2019-12-18 18:04:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:53,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:53,565 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:53,565 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 4 times [2019-12-18 18:04:53,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:53,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24683452] [2019-12-18 18:04:53,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:53,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-18 18:04:53,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24683452] [2019-12-18 18:04:53,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:53,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:53,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049046187] [2019-12-18 18:04:53,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:53,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:53,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:53,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:53,738 INFO L87 Difference]: Start difference. First operand 21653 states and 54057 transitions. Second operand 10 states. [2019-12-18 18:04:54,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:54,723 INFO L93 Difference]: Finished difference Result 33983 states and 83649 transitions. [2019-12-18 18:04:54,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:04:54,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:54,763 INFO L225 Difference]: With dead ends: 33983 [2019-12-18 18:04:54,764 INFO L226 Difference]: Without dead ends: 32542 [2019-12-18 18:04:54,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:04:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32542 states. [2019-12-18 18:04:55,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32542 to 26667. [2019-12-18 18:04:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26667 states. [2019-12-18 18:04:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26667 states to 26667 states and 67477 transitions. [2019-12-18 18:04:55,169 INFO L78 Accepts]: Start accepts. Automaton has 26667 states and 67477 transitions. Word has length 96 [2019-12-18 18:04:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:55,169 INFO L462 AbstractCegarLoop]: Abstraction has 26667 states and 67477 transitions. [2019-12-18 18:04:55,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26667 states and 67477 transitions. [2019-12-18 18:04:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:55,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:55,198 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:55,198 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:55,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1267480048, now seen corresponding path program 5 times [2019-12-18 18:04:55,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:55,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610936893] [2019-12-18 18:04:55,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:55,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610936893] [2019-12-18 18:04:55,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:55,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:55,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243805483] [2019-12-18 18:04:55,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:55,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:55,355 INFO L87 Difference]: Start difference. First operand 26667 states and 67477 transitions. Second operand 10 states. [2019-12-18 18:04:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:56,554 INFO L93 Difference]: Finished difference Result 39692 states and 98216 transitions. [2019-12-18 18:04:56,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:04:56,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:56,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:56,599 INFO L225 Difference]: With dead ends: 39692 [2019-12-18 18:04:56,599 INFO L226 Difference]: Without dead ends: 38988 [2019-12-18 18:04:56,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:04:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38988 states. [2019-12-18 18:04:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38988 to 27176. [2019-12-18 18:04:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27176 states. [2019-12-18 18:04:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27176 states to 27176 states and 68753 transitions. [2019-12-18 18:04:57,027 INFO L78 Accepts]: Start accepts. Automaton has 27176 states and 68753 transitions. Word has length 96 [2019-12-18 18:04:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:57,028 INFO L462 AbstractCegarLoop]: Abstraction has 27176 states and 68753 transitions. [2019-12-18 18:04:57,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27176 states and 68753 transitions. [2019-12-18 18:04:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:57,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:57,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:57,055 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:04:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1036038953, now seen corresponding path program 1 times [2019-12-18 18:04:57,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:57,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439421932] [2019-12-18 18:04:57,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:57,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439421932] [2019-12-18 18:04:57,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:57,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:04:57,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765543944] [2019-12-18 18:04:57,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:04:57,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:04:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:57,257 INFO L87 Difference]: Start difference. First operand 27176 states and 68753 transitions. Second operand 11 states. [2019-12-18 18:05:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:00,691 INFO L93 Difference]: Finished difference Result 51785 states and 131441 transitions. [2019-12-18 18:05:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 18:05:00,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:05:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:00,750 INFO L225 Difference]: With dead ends: 51785 [2019-12-18 18:05:00,750 INFO L226 Difference]: Without dead ends: 51785 [2019-12-18 18:05:00,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=694, Unknown=0, NotChecked=0, Total=870 [2019-12-18 18:05:00,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51785 states. [2019-12-18 18:05:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51785 to 39995. [2019-12-18 18:05:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39995 states. [2019-12-18 18:05:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39995 states to 39995 states and 102446 transitions. [2019-12-18 18:05:01,319 INFO L78 Accepts]: Start accepts. Automaton has 39995 states and 102446 transitions. Word has length 96 [2019-12-18 18:05:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:01,319 INFO L462 AbstractCegarLoop]: Abstraction has 39995 states and 102446 transitions. [2019-12-18 18:05:01,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:01,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39995 states and 102446 transitions. [2019-12-18 18:05:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:01,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:01,360 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:01,360 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2040794935, now seen corresponding path program 2 times [2019-12-18 18:05:01,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:01,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642337884] [2019-12-18 18:05:01,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:01,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:01,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642337884] [2019-12-18 18:05:01,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:01,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:01,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104221807] [2019-12-18 18:05:01,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:01,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:01,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:01,587 INFO L87 Difference]: Start difference. First operand 39995 states and 102446 transitions. Second operand 11 states. [2019-12-18 18:05:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:02,887 INFO L93 Difference]: Finished difference Result 44746 states and 113871 transitions. [2019-12-18 18:05:02,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:05:02,892 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:05:02,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:02,944 INFO L225 Difference]: With dead ends: 44746 [2019-12-18 18:05:02,944 INFO L226 Difference]: Without dead ends: 44630 [2019-12-18 18:05:02,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:05:03,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44630 states. [2019-12-18 18:05:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44630 to 40157. [2019-12-18 18:05:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40157 states. [2019-12-18 18:05:03,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40157 states to 40157 states and 102857 transitions. [2019-12-18 18:05:03,651 INFO L78 Accepts]: Start accepts. Automaton has 40157 states and 102857 transitions. Word has length 96 [2019-12-18 18:05:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 40157 states and 102857 transitions. [2019-12-18 18:05:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 40157 states and 102857 transitions. [2019-12-18 18:05:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:03,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:03,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:03,692 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:03,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:03,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 6 times [2019-12-18 18:05:03,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:03,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605904923] [2019-12-18 18:05:03,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:03,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605904923] [2019-12-18 18:05:03,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:03,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:05:03,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80176840] [2019-12-18 18:05:03,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:05:03,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:05:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:03,952 INFO L87 Difference]: Start difference. First operand 40157 states and 102857 transitions. Second operand 14 states. [2019-12-18 18:05:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:05,196 INFO L93 Difference]: Finished difference Result 50455 states and 127433 transitions. [2019-12-18 18:05:05,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:05:05,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 18:05:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:05,260 INFO L225 Difference]: With dead ends: 50455 [2019-12-18 18:05:05,260 INFO L226 Difference]: Without dead ends: 50425 [2019-12-18 18:05:05,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:05:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50425 states. [2019-12-18 18:05:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50425 to 45773. [2019-12-18 18:05:06,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45773 states. [2019-12-18 18:05:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45773 states to 45773 states and 116913 transitions. [2019-12-18 18:05:06,116 INFO L78 Accepts]: Start accepts. Automaton has 45773 states and 116913 transitions. Word has length 96 [2019-12-18 18:05:06,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:06,117 INFO L462 AbstractCegarLoop]: Abstraction has 45773 states and 116913 transitions. [2019-12-18 18:05:06,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:05:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 45773 states and 116913 transitions. [2019-12-18 18:05:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:06,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:06,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:06,161 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:06,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash 369838979, now seen corresponding path program 3 times [2019-12-18 18:05:06,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:06,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364032522] [2019-12-18 18:05:06,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:06,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364032522] [2019-12-18 18:05:06,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:06,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 18:05:06,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554125246] [2019-12-18 18:05:06,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:05:06,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:05:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:05:06,564 INFO L87 Difference]: Start difference. First operand 45773 states and 116913 transitions. Second operand 16 states. [2019-12-18 18:05:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:11,178 INFO L93 Difference]: Finished difference Result 81678 states and 207567 transitions. [2019-12-18 18:05:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:05:11,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 18:05:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:11,591 INFO L225 Difference]: With dead ends: 81678 [2019-12-18 18:05:11,592 INFO L226 Difference]: Without dead ends: 81636 [2019-12-18 18:05:11,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=2538, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 18:05:11,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81636 states. [2019-12-18 18:05:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81636 to 42710. [2019-12-18 18:05:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42710 states. [2019-12-18 18:05:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42710 states to 42710 states and 108602 transitions. [2019-12-18 18:05:12,441 INFO L78 Accepts]: Start accepts. Automaton has 42710 states and 108602 transitions. Word has length 96 [2019-12-18 18:05:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:12,442 INFO L462 AbstractCegarLoop]: Abstraction has 42710 states and 108602 transitions. [2019-12-18 18:05:12,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:05:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 42710 states and 108602 transitions. [2019-12-18 18:05:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:12,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:12,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:12,486 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:12,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2082560497, now seen corresponding path program 1 times [2019-12-18 18:05:12,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:12,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607039671] [2019-12-18 18:05:12,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:12,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-18 18:05:12,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607039671] [2019-12-18 18:05:12,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:12,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:05:12,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484103490] [2019-12-18 18:05:12,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:05:12,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:05:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:12,923 INFO L87 Difference]: Start difference. First operand 42710 states and 108602 transitions. Second operand 14 states. [2019-12-18 18:05:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:16,159 INFO L93 Difference]: Finished difference Result 60944 states and 156300 transitions. [2019-12-18 18:05:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 18:05:16,160 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 18:05:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:16,238 INFO L225 Difference]: With dead ends: 60944 [2019-12-18 18:05:16,238 INFO L226 Difference]: Without dead ends: 60944 [2019-12-18 18:05:16,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 18:05:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60944 states. [2019-12-18 18:05:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60944 to 42574. [2019-12-18 18:05:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42574 states. [2019-12-18 18:05:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42574 states to 42574 states and 108292 transitions. [2019-12-18 18:05:16,907 INFO L78 Accepts]: Start accepts. Automaton has 42574 states and 108292 transitions. Word has length 96 [2019-12-18 18:05:16,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:16,908 INFO L462 AbstractCegarLoop]: Abstraction has 42574 states and 108292 transitions. [2019-12-18 18:05:16,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:05:16,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42574 states and 108292 transitions. [2019-12-18 18:05:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:16,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:16,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:16,951 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 18:05:16,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:16,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310116879] [2019-12-18 18:05:16,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:17,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310116879] [2019-12-18 18:05:17,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:17,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:17,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317066273] [2019-12-18 18:05:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:17,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:17,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:17,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:17,170 INFO L87 Difference]: Start difference. First operand 42574 states and 108292 transitions. Second operand 11 states. [2019-12-18 18:05:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:20,147 INFO L93 Difference]: Finished difference Result 89685 states and 225619 transitions. [2019-12-18 18:05:20,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:05:20,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:05:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:20,250 INFO L225 Difference]: With dead ends: 89685 [2019-12-18 18:05:20,250 INFO L226 Difference]: Without dead ends: 75837 [2019-12-18 18:05:20,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 18:05:20,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75837 states. [2019-12-18 18:05:21,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75837 to 52244. [2019-12-18 18:05:21,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52244 states. [2019-12-18 18:05:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52244 states to 52244 states and 132998 transitions. [2019-12-18 18:05:21,132 INFO L78 Accepts]: Start accepts. Automaton has 52244 states and 132998 transitions. Word has length 97 [2019-12-18 18:05:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:21,132 INFO L462 AbstractCegarLoop]: Abstraction has 52244 states and 132998 transitions. [2019-12-18 18:05:21,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:21,133 INFO L276 IsEmpty]: Start isEmpty. Operand 52244 states and 132998 transitions. [2019-12-18 18:05:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:21,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:21,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:21,191 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:21,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 18:05:21,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:21,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599066151] [2019-12-18 18:05:21,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:21,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599066151] [2019-12-18 18:05:21,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:21,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:05:21,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715957824] [2019-12-18 18:05:21,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:05:21,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:05:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:05:21,337 INFO L87 Difference]: Start difference. First operand 52244 states and 132998 transitions. Second operand 6 states. [2019-12-18 18:05:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:21,568 INFO L93 Difference]: Finished difference Result 51009 states and 129599 transitions. [2019-12-18 18:05:21,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:05:21,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:05:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:21,631 INFO L225 Difference]: With dead ends: 51009 [2019-12-18 18:05:21,631 INFO L226 Difference]: Without dead ends: 51009 [2019-12-18 18:05:21,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:05:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51009 states. [2019-12-18 18:05:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51009 to 40559. [2019-12-18 18:05:22,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40559 states. [2019-12-18 18:05:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40559 states to 40559 states and 102161 transitions. [2019-12-18 18:05:22,381 INFO L78 Accepts]: Start accepts. Automaton has 40559 states and 102161 transitions. Word has length 97 [2019-12-18 18:05:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:22,381 INFO L462 AbstractCegarLoop]: Abstraction has 40559 states and 102161 transitions. [2019-12-18 18:05:22,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:05:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 40559 states and 102161 transitions. [2019-12-18 18:05:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:22,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:22,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:22,420 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash 346964984, now seen corresponding path program 1 times [2019-12-18 18:05:22,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:22,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993926107] [2019-12-18 18:05:22,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993926107] [2019-12-18 18:05:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:23,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:05:23,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708239358] [2019-12-18 18:05:23,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:05:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:05:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:05:23,002 INFO L87 Difference]: Start difference. First operand 40559 states and 102161 transitions. Second operand 20 states. [2019-12-18 18:05:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:29,496 INFO L93 Difference]: Finished difference Result 46349 states and 116223 transitions. [2019-12-18 18:05:29,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 18:05:29,497 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-18 18:05:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:29,545 INFO L225 Difference]: With dead ends: 46349 [2019-12-18 18:05:29,545 INFO L226 Difference]: Without dead ends: 45767 [2019-12-18 18:05:29,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=429, Invalid=2993, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 18:05:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45767 states. [2019-12-18 18:05:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45767 to 42187. [2019-12-18 18:05:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42187 states. [2019-12-18 18:05:30,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42187 states to 42187 states and 106386 transitions. [2019-12-18 18:05:30,053 INFO L78 Accepts]: Start accepts. Automaton has 42187 states and 106386 transitions. Word has length 97 [2019-12-18 18:05:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:30,053 INFO L462 AbstractCegarLoop]: Abstraction has 42187 states and 106386 transitions. [2019-12-18 18:05:30,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:05:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 42187 states and 106386 transitions. [2019-12-18 18:05:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:30,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:30,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:30,094 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:30,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1280374088, now seen corresponding path program 2 times [2019-12-18 18:05:30,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:30,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382668990] [2019-12-18 18:05:30,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:30,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382668990] [2019-12-18 18:05:30,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:30,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:05:30,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319789992] [2019-12-18 18:05:30,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:05:30,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:30,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:05:30,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:05:30,161 INFO L87 Difference]: Start difference. First operand 42187 states and 106386 transitions. Second operand 3 states. [2019-12-18 18:05:30,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:30,349 INFO L93 Difference]: Finished difference Result 42187 states and 106385 transitions. [2019-12-18 18:05:30,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:05:30,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-18 18:05:30,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:30,416 INFO L225 Difference]: With dead ends: 42187 [2019-12-18 18:05:30,416 INFO L226 Difference]: Without dead ends: 42187 [2019-12-18 18:05:30,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:05:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42187 states. [2019-12-18 18:05:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42187 to 38504. [2019-12-18 18:05:31,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38504 states. [2019-12-18 18:05:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38504 states to 38504 states and 97062 transitions. [2019-12-18 18:05:31,228 INFO L78 Accepts]: Start accepts. Automaton has 38504 states and 97062 transitions. Word has length 97 [2019-12-18 18:05:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:31,228 INFO L462 AbstractCegarLoop]: Abstraction has 38504 states and 97062 transitions. [2019-12-18 18:05:31,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:05:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 38504 states and 97062 transitions. [2019-12-18 18:05:31,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:31,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:31,267 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:31,267 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:31,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash 901064639, now seen corresponding path program 1 times [2019-12-18 18:05:31,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:31,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783215200] [2019-12-18 18:05:31,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:31,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783215200] [2019-12-18 18:05:31,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:31,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:31,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749688059] [2019-12-18 18:05:31,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:31,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:31,483 INFO L87 Difference]: Start difference. First operand 38504 states and 97062 transitions. Second operand 10 states. [2019-12-18 18:05:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:32,530 INFO L93 Difference]: Finished difference Result 40446 states and 101323 transitions. [2019-12-18 18:05:32,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:05:32,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 18:05:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:32,579 INFO L225 Difference]: With dead ends: 40446 [2019-12-18 18:05:32,579 INFO L226 Difference]: Without dead ends: 40446 [2019-12-18 18:05:32,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:05:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40446 states. [2019-12-18 18:05:33,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40446 to 38571. [2019-12-18 18:05:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38571 states. [2019-12-18 18:05:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38571 states to 38571 states and 97213 transitions. [2019-12-18 18:05:33,099 INFO L78 Accepts]: Start accepts. Automaton has 38571 states and 97213 transitions. Word has length 97 [2019-12-18 18:05:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:33,100 INFO L462 AbstractCegarLoop]: Abstraction has 38571 states and 97213 transitions. [2019-12-18 18:05:33,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 38571 states and 97213 transitions. [2019-12-18 18:05:33,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:33,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:33,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:33,138 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:33,139 INFO L82 PathProgramCache]: Analyzing trace with hash -758422154, now seen corresponding path program 1 times [2019-12-18 18:05:33,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:33,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092173992] [2019-12-18 18:05:33,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:33,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092173992] [2019-12-18 18:05:33,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:33,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:05:33,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670521572] [2019-12-18 18:05:33,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:05:33,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:33,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:05:33,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:05:33,522 INFO L87 Difference]: Start difference. First operand 38571 states and 97213 transitions. Second operand 15 states. [2019-12-18 18:05:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:37,882 INFO L93 Difference]: Finished difference Result 53515 states and 134171 transitions. [2019-12-18 18:05:37,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 18:05:37,883 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-18 18:05:37,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:37,951 INFO L225 Difference]: With dead ends: 53515 [2019-12-18 18:05:37,951 INFO L226 Difference]: Without dead ends: 52172 [2019-12-18 18:05:37,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 18:05:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52172 states. [2019-12-18 18:05:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52172 to 39345. [2019-12-18 18:05:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39345 states. [2019-12-18 18:05:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39345 states to 39345 states and 99251 transitions. [2019-12-18 18:05:38,552 INFO L78 Accepts]: Start accepts. Automaton has 39345 states and 99251 transitions. Word has length 98 [2019-12-18 18:05:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:38,552 INFO L462 AbstractCegarLoop]: Abstraction has 39345 states and 99251 transitions. [2019-12-18 18:05:38,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:05:38,552 INFO L276 IsEmpty]: Start isEmpty. Operand 39345 states and 99251 transitions. [2019-12-18 18:05:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:38,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:38,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:38,592 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:38,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:38,592 INFO L82 PathProgramCache]: Analyzing trace with hash 820119886, now seen corresponding path program 2 times [2019-12-18 18:05:38,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:38,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395699426] [2019-12-18 18:05:38,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:38,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395699426] [2019-12-18 18:05:38,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:38,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:05:38,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400423441] [2019-12-18 18:05:38,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:05:38,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:38,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:05:38,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:05:38,899 INFO L87 Difference]: Start difference. First operand 39345 states and 99251 transitions. Second operand 15 states. [2019-12-18 18:05:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:41,239 INFO L93 Difference]: Finished difference Result 73750 states and 184276 transitions. [2019-12-18 18:05:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 18:05:41,240 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 98 [2019-12-18 18:05:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:41,317 INFO L225 Difference]: With dead ends: 73750 [2019-12-18 18:05:41,317 INFO L226 Difference]: Without dead ends: 68230 [2019-12-18 18:05:41,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=1788, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 18:05:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68230 states. [2019-12-18 18:05:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68230 to 42969. [2019-12-18 18:05:41,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42969 states. [2019-12-18 18:05:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42969 states to 42969 states and 108425 transitions. [2019-12-18 18:05:42,014 INFO L78 Accepts]: Start accepts. Automaton has 42969 states and 108425 transitions. Word has length 98 [2019-12-18 18:05:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:42,014 INFO L462 AbstractCegarLoop]: Abstraction has 42969 states and 108425 transitions. [2019-12-18 18:05:42,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:05:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42969 states and 108425 transitions. [2019-12-18 18:05:42,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:42,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:42,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:42,056 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:42,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1700655026, now seen corresponding path program 3 times [2019-12-18 18:05:42,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:42,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251345713] [2019-12-18 18:05:42,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:42,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251345713] [2019-12-18 18:05:42,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:42,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 18:05:42,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016084674] [2019-12-18 18:05:42,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 18:05:42,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:42,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 18:05:42,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:42,684 INFO L87 Difference]: Start difference. First operand 42969 states and 108425 transitions. Second operand 19 states. [2019-12-18 18:05:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:50,469 INFO L93 Difference]: Finished difference Result 68170 states and 171339 transitions. [2019-12-18 18:05:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-18 18:05:50,469 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2019-12-18 18:05:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:50,590 INFO L225 Difference]: With dead ends: 68170 [2019-12-18 18:05:50,590 INFO L226 Difference]: Without dead ends: 64802 [2019-12-18 18:05:50,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=475, Invalid=3307, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 18:05:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64802 states. [2019-12-18 18:05:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64802 to 42769. [2019-12-18 18:05:51,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42769 states. [2019-12-18 18:05:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42769 states to 42769 states and 108016 transitions. [2019-12-18 18:05:51,291 INFO L78 Accepts]: Start accepts. Automaton has 42769 states and 108016 transitions. Word has length 98 [2019-12-18 18:05:51,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:51,291 INFO L462 AbstractCegarLoop]: Abstraction has 42769 states and 108016 transitions. [2019-12-18 18:05:51,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 18:05:51,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42769 states and 108016 transitions. [2019-12-18 18:05:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:05:51,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:51,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:05:51,332 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 701608270, now seen corresponding path program 4 times [2019-12-18 18:05:51,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:51,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181369759] [2019-12-18 18:05:51,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:52,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181369759] [2019-12-18 18:05:52,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:52,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:05:52,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319522632] [2019-12-18 18:05:52,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:05:52,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:05:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:52,149 INFO L87 Difference]: Start difference. First operand 42769 states and 108016 transitions. Second operand 18 states. [2019-12-18 18:05:59,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:59,706 INFO L93 Difference]: Finished difference Result 64955 states and 163296 transitions. [2019-12-18 18:05:59,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-18 18:05:59,707 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-12-18 18:05:59,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:59,790 INFO L225 Difference]: With dead ends: 64955 [2019-12-18 18:05:59,790 INFO L226 Difference]: Without dead ends: 63111 [2019-12-18 18:05:59,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=697, Invalid=5155, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 18:05:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63111 states. [2019-12-18 18:06:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63111 to 42936. [2019-12-18 18:06:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42936 states. [2019-12-18 18:06:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42936 states to 42936 states and 108390 transitions. [2019-12-18 18:06:00,701 INFO L78 Accepts]: Start accepts. Automaton has 42936 states and 108390 transitions. Word has length 98 [2019-12-18 18:06:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:00,701 INFO L462 AbstractCegarLoop]: Abstraction has 42936 states and 108390 transitions. [2019-12-18 18:06:00,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:06:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 42936 states and 108390 transitions. [2019-12-18 18:06:00,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 18:06:00,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:00,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:00,744 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:00,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988356, now seen corresponding path program 5 times [2019-12-18 18:06:00,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:00,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693942405] [2019-12-18 18:06:00,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:01,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:01,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693942405] [2019-12-18 18:06:01,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:01,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:06:01,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446995486] [2019-12-18 18:06:01,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:06:01,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:06:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:06:01,229 INFO L87 Difference]: Start difference. First operand 42936 states and 108390 transitions. Second operand 20 states. Received shutdown request... [2019-12-18 18:06:06,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 18:06:06,658 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 18:06:06,662 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 18:06:06,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:06:06 BasicIcfg [2019-12-18 18:06:06,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:06:06,664 INFO L168 Benchmark]: Toolchain (without parser) took 212960.63 ms. Allocated memory was 144.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 99.2 MB in the beginning and 1.1 GB in the end (delta: -978.7 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,664 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.82 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.9 MB in the beginning and 151.3 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 147.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,665 INFO L168 Benchmark]: Boogie Preprocessor took 46.53 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 145.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,666 INFO L168 Benchmark]: RCFGBuilder took 1349.35 ms. Allocated memory was 200.8 MB in the beginning and 232.3 MB in the end (delta: 31.5 MB). Free memory was 145.2 MB in the beginning and 190.2 MB in the end (delta: -45.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,666 INFO L168 Benchmark]: TraceAbstraction took 210673.71 ms. Allocated memory was 232.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 188.8 MB in the beginning and 1.1 GB in the end (delta: -889.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:06:06,668 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.66 ms. Allocated memory is still 144.2 MB. Free memory was 119.2 MB in the beginning and 119.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.82 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 98.9 MB in the beginning and 151.3 MB in the end (delta: -52.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.77 ms. Allocated memory is still 200.8 MB. Free memory was 151.3 MB in the beginning and 147.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.53 ms. Allocated memory is still 200.8 MB. Free memory was 147.9 MB in the beginning and 145.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1349.35 ms. Allocated memory was 200.8 MB in the beginning and 232.3 MB in the end (delta: 31.5 MB). Free memory was 145.2 MB in the beginning and 190.2 MB in the end (delta: -45.0 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 210673.71 ms. Allocated memory was 232.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 188.8 MB in the beginning and 1.1 GB in the end (delta: -889.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.4s, 244 ProgramPointsBefore, 154 ProgramPointsAfterwards, 326 TransitionsBefore, 193 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 19062 VarBasedMoverChecksPositive, 524 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 479 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.2s, 0 MoverChecksTotal, 326763 CheckedPairsTotal, 143 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (42936states) and FLOYD_HOARE automaton (currently 49 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (46850 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (42936states) and FLOYD_HOARE automaton (currently 49 states, 20 states before enhancement),while ReachableStatesComputation was computing reachable states (46850 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 210.4s, OverallIterations: 41, TraceHistogramMax: 1, AutomataDifference: 106.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 17601 SDtfs, 26411 SDslu, 93917 SDs, 0 SdLazy, 58598 SolverSat, 1628 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1015 GetRequests, 152 SyntacticMatches, 57 SemanticMatches, 806 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7643 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240862occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 70.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 366485 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 3351 NumberOfCodeBlocks, 3351 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3310 ConstructedInterpolants, 0 QuantifiedInterpolants, 1317041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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