/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:02:38,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:02:38,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:02:38,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:02:38,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:02:38,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:02:38,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:02:38,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:02:38,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:02:38,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:02:38,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:02:38,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:02:38,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:02:38,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:02:38,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:02:38,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:02:38,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:02:38,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:02:38,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:02:38,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:02:38,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:02:38,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:02:38,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:02:38,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:02:38,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:02:38,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:02:38,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:02:38,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:02:38,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:02:38,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:02:38,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:02:38,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:02:38,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:02:39,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:02:39,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:02:39,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:02:39,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:02:39,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:02:39,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:02:39,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:02:39,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:02:39,005 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:39,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:02:39,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:02:39,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:02:39,021 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:02:39,021 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:02:39,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:02:39,021 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:02:39,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:02:39,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:02:39,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:02:39,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:02:39,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:02:39,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:02:39,023 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:02:39,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:02:39,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:02:39,023 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:02:39,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:02:39,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:02:39,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:02:39,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:02:39,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:02:39,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:02:39,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:02:39,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:02:39,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:02:39,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:02:39,025 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:02:39,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:02:39,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:02:39,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:02:39,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:02:39,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:02:39,328 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:02:39,328 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-18 18:02:39,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb43761e3/9636fa0f92ee48819b5f0f56a19977d4/FLAG44190370d [2019-12-18 18:02:39,964 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:02:39,965 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.opt.i [2019-12-18 18:02:39,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb43761e3/9636fa0f92ee48819b5f0f56a19977d4/FLAG44190370d [2019-12-18 18:02:40,256 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb43761e3/9636fa0f92ee48819b5f0f56a19977d4 [2019-12-18 18:02:40,265 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:02:40,267 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:02:40,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:40,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:02:40,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:02:40,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:40" (1/1) ... [2019-12-18 18:02:40,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2983cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:40, skipping insertion in model container [2019-12-18 18:02:40,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:02:40" (1/1) ... [2019-12-18 18:02:40,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:02:40,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:02:40,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:40,896 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:02:40,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:02:41,071 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:02:41,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:41 WrapperNode [2019-12-18 18:02:41,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:02:41,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:41,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:02:41,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:02:41,083 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:41" (1/1) ... [2019-12-18 18:02:41,105 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:41" (1/1) ... [2019-12-18 18:02:41,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:02:41,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:02:41,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:02:41,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:02:41,156 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:41" (1/1) ... [2019-12-18 18:02:41,156 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:41" (1/1) ... [2019-12-18 18:02:41,162 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:41" (1/1) ... [2019-12-18 18:02:41,163 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:41" (1/1) ... [2019-12-18 18:02:41,177 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:41" (1/1) ... [2019-12-18 18:02:41,184 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:41" (1/1) ... [2019-12-18 18:02:41,189 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:41" (1/1) ... [2019-12-18 18:02:41,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:02:41,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:02:41,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:02:41,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:02:41,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:41" (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:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:02:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:02:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:02:41,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:02:41,276 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:02:41,276 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:02:41,277 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:02:41,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:02:41,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:02:41,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:02:41,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:02:41,284 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:42,427 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:02:42,428 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:02:42,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:42 BoogieIcfgContainer [2019-12-18 18:02:42,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:02:42,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:02:42,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:02:42,434 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:02:42,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:02:40" (1/3) ... [2019-12-18 18:02:42,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d4ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:42, skipping insertion in model container [2019-12-18 18:02:42,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:02:41" (2/3) ... [2019-12-18 18:02:42,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d4ce2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:02:42, skipping insertion in model container [2019-12-18 18:02:42,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:02:42" (3/3) ... [2019-12-18 18:02:42,439 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.opt.i [2019-12-18 18:02:42,450 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:02:42,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:02:42,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:02:42,465 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:02:42,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,554 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,555 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,556 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,557 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,559 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:42,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,560 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,589 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,590 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,593 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,602 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,604 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,604 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:42,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:02:42,620 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:02:42,636 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:02:42,636 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:02:42,636 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:02:42,636 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:02:42,636 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:02:42,636 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:02:42,636 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:02:42,637 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:02:42,658 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 18:02:42,660 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:42,854 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:42,854 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:42,916 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:43,023 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 18:02:43,149 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 18:02:43,149 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:02:43,170 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:43,219 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 18:02:43,220 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:02:50,409 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-18 18:02:50,704 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 18:02:50,825 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 18:02:50,979 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 18:02:50,979 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 18:02:50,983 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 18:03:05,831 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 18:03:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 18:03:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:03:05,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:05,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:03:05,842 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:03:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 18:03:05,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:05,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039367933] [2019-12-18 18:03:05,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:06,113 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:06,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039367933] [2019-12-18 18:03:06,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:06,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:03:06,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79926250] [2019-12-18 18:03:06,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:03:06,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:03:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:03:06,139 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 18:03:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:07,340 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 18:03:07,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:03:07,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:03:07,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:10,914 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 18:03:10,915 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 18:03:10,916 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:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 18:03:18,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 18:03:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 18:03:19,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 18:03:19,229 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 18:03:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:19,229 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 18:03:19,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:03:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 18:03:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:19,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:19,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:19,235 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:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 18:03:19,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:19,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016782908] [2019-12-18 18:03:19,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:19,319 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:19,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016782908] [2019-12-18 18:03:19,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:19,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:19,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052685075] [2019-12-18 18:03:19,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:19,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:19,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:19,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:19,323 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 18:03:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:24,737 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 18:03:24,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:24,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:25,191 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 18:03:25,192 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 18:03:25,193 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:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 18:03:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 18:03:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 18:03:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 18:03:34,547 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 18:03:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:34,547 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 18:03:34,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 18:03:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:03:34,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:34,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:03:34,551 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:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 18:03:34,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:34,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788682234] [2019-12-18 18:03:34,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:34,674 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:34,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788682234] [2019-12-18 18:03:34,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:34,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:03:34,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535022362] [2019-12-18 18:03:34,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:03:34,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:03:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:03:34,677 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 18:03:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:41,665 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 18:03:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:03:41,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:03:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:03:42,141 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 18:03:42,141 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 18:03:42,141 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:47,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 18:03:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 18:03:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 18:03:51,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 18:03:51,634 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 18:03:51,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:03:51,634 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 18:03:51,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:03:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 18:03:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:03:51,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:03:51,642 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:51,642 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:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:03:51,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 18:03:51,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:03:51,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611166485] [2019-12-18 18:03:51,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:03:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:03:51,758 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:51,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611166485] [2019-12-18 18:03:51,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:03:51,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:03:51,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58795579] [2019-12-18 18:03:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:03:51,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:03:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:03:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:03:51,761 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-18 18:03:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:03:59,907 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-18 18:03:59,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:03:59,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 18:03:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:00,527 INFO L225 Difference]: With dead ends: 244942 [2019-12-18 18:04:00,528 INFO L226 Difference]: Without dead ends: 244942 [2019-12-18 18:04:00,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-18 18:04:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-18 18:04:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-18 18:04:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-18 18:04:10,623 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-18 18:04:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:10,623 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-18 18:04:10,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-18 18:04:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:10,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:10,647 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:10,647 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:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:10,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 18:04:10,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:10,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860551848] [2019-12-18 18:04:10,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:10,796 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:10,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860551848] [2019-12-18 18:04:10,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:10,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:04:10,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772271224] [2019-12-18 18:04:10,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:10,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:10,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:10,798 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 5 states. [2019-12-18 18:04:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:17,288 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-18 18:04:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:17,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 18:04:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:17,897 INFO L225 Difference]: With dead ends: 255390 [2019-12-18 18:04:17,897 INFO L226 Difference]: Without dead ends: 255390 [2019-12-18 18:04:17,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-18 18:04:32,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-18 18:04:32,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-18 18:04:33,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-18 18:04:33,350 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-18 18:04:33,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:33,351 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-18 18:04:33,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:33,351 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-18 18:04:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:04:33,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:33,373 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:33,374 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:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:33,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-18 18:04:33,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:33,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723967945] [2019-12-18 18:04:33,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:33,479 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,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723967945] [2019-12-18 18:04:33,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:33,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:04:33,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716439806] [2019-12-18 18:04:33,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:04:33,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:04:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:04:33,482 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-18 18:04:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:33,558 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-18 18:04:33,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:04:33,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:04:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:33,571 INFO L225 Difference]: With dead ends: 14741 [2019-12-18 18:04:33,571 INFO L226 Difference]: Without dead ends: 10693 [2019-12-18 18:04:33,572 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:33,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-18 18:04:33,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-18 18:04:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-18 18:04:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-18 18:04:33,705 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-18 18:04:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:33,706 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-18 18:04:33,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:04:33,706 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-18 18:04:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 18:04:33,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:33,710 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:33,710 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:33,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:33,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 18:04:33,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:33,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388144119] [2019-12-18 18:04:33,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:33,831 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,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388144119] [2019-12-18 18:04:33,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:33,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:04:33,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909242202] [2019-12-18 18:04:33,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:33,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:33,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:33,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:33,834 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-18 18:04:34,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:34,798 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-18 18:04:34,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:34,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 18:04:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:34,816 INFO L225 Difference]: With dead ends: 11962 [2019-12-18 18:04:34,816 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 18:04:34,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 18:04:34,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-18 18:04:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 18:04:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-18 18:04:36,312 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-18 18:04:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:36,313 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-18 18:04:36,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-18 18:04:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 18:04:36,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:36,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,320 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:36,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 18:04:36,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:36,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171414404] [2019-12-18 18:04:36,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:36,431 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,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171414404] [2019-12-18 18:04:36,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:36,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:04:36,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841998305] [2019-12-18 18:04:36,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:36,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:36,433 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 5 states. [2019-12-18 18:04:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:36,492 INFO L93 Difference]: Finished difference Result 4762 states and 11299 transitions. [2019-12-18 18:04:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:04:36,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-18 18:04:36,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:36,499 INFO L225 Difference]: With dead ends: 4762 [2019-12-18 18:04:36,499 INFO L226 Difference]: Without dead ends: 4575 [2019-12-18 18:04:36,500 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:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-18 18:04:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4507. [2019-12-18 18:04:36,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2019-12-18 18:04:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 10763 transitions. [2019-12-18 18:04:36,557 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 10763 transitions. Word has length 50 [2019-12-18 18:04:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:36,557 INFO L462 AbstractCegarLoop]: Abstraction has 4507 states and 10763 transitions. [2019-12-18 18:04:36,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 10763 transitions. [2019-12-18 18:04:36,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:36,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:36,564 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:36,564 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:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:36,564 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 18:04:36,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:36,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406840223] [2019-12-18 18:04:36,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:36,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406840223] [2019-12-18 18:04:36,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:36,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:36,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515368524] [2019-12-18 18:04:36,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:36,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:36,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:36,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:36,744 INFO L87 Difference]: Start difference. First operand 4507 states and 10763 transitions. Second operand 6 states. [2019-12-18 18:04:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:37,619 INFO L93 Difference]: Finished difference Result 6100 states and 14382 transitions. [2019-12-18 18:04:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:37,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:37,628 INFO L225 Difference]: With dead ends: 6100 [2019-12-18 18:04:37,628 INFO L226 Difference]: Without dead ends: 6100 [2019-12-18 18:04:37,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-12-18 18:04:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 5765. [2019-12-18 18:04:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5765 states. [2019-12-18 18:04:37,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5765 states to 5765 states and 13657 transitions. [2019-12-18 18:04:37,732 INFO L78 Accepts]: Start accepts. Automaton has 5765 states and 13657 transitions. Word has length 94 [2019-12-18 18:04:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:37,733 INFO L462 AbstractCegarLoop]: Abstraction has 5765 states and 13657 transitions. [2019-12-18 18:04:37,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:37,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5765 states and 13657 transitions. [2019-12-18 18:04:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:37,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:37,747 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:37,747 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:37,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:37,748 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 18:04:37,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:37,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857834547] [2019-12-18 18:04:37,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:37,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:37,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857834547] [2019-12-18 18:04:37,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:37,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:37,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113981714] [2019-12-18 18:04:37,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:37,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:37,893 INFO L87 Difference]: Start difference. First operand 5765 states and 13657 transitions. Second operand 7 states. [2019-12-18 18:04:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:38,949 INFO L93 Difference]: Finished difference Result 6939 states and 16285 transitions. [2019-12-18 18:04:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:04:38,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 18:04:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:38,958 INFO L225 Difference]: With dead ends: 6939 [2019-12-18 18:04:38,958 INFO L226 Difference]: Without dead ends: 6939 [2019-12-18 18:04:38,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2019-12-18 18:04:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 6214. [2019-12-18 18:04:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6214 states. [2019-12-18 18:04:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6214 states to 6214 states and 14677 transitions. [2019-12-18 18:04:39,068 INFO L78 Accepts]: Start accepts. Automaton has 6214 states and 14677 transitions. Word has length 94 [2019-12-18 18:04:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:39,068 INFO L462 AbstractCegarLoop]: Abstraction has 6214 states and 14677 transitions. [2019-12-18 18:04:39,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 6214 states and 14677 transitions. [2019-12-18 18:04:39,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:39,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:39,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:39,083 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:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 18:04:39,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:39,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153438695] [2019-12-18 18:04:39,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:39,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153438695] [2019-12-18 18:04:39,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:39,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:04:39,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138402297] [2019-12-18 18:04:39,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:04:39,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:39,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:04:39,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:04:39,243 INFO L87 Difference]: Start difference. First operand 6214 states and 14677 transitions. Second operand 5 states. [2019-12-18 18:04:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:39,815 INFO L93 Difference]: Finished difference Result 6709 states and 15705 transitions. [2019-12-18 18:04:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:04:39,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 18:04:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:39,825 INFO L225 Difference]: With dead ends: 6709 [2019-12-18 18:04:39,825 INFO L226 Difference]: Without dead ends: 6709 [2019-12-18 18:04:39,825 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:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6709 states. [2019-12-18 18:04:39,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6709 to 6274. [2019-12-18 18:04:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6274 states. [2019-12-18 18:04:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6274 states to 6274 states and 14825 transitions. [2019-12-18 18:04:39,940 INFO L78 Accepts]: Start accepts. Automaton has 6274 states and 14825 transitions. Word has length 94 [2019-12-18 18:04:39,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:39,940 INFO L462 AbstractCegarLoop]: Abstraction has 6274 states and 14825 transitions. [2019-12-18 18:04:39,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:04:39,940 INFO L276 IsEmpty]: Start isEmpty. Operand 6274 states and 14825 transitions. [2019-12-18 18:04:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:39,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:39,953 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:39,953 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:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 18:04:39,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:39,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732619606] [2019-12-18 18:04:39,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:40,080 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,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732619606] [2019-12-18 18:04:40,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:40,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:40,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094097725] [2019-12-18 18:04:40,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:40,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:40,082 INFO L87 Difference]: Start difference. First operand 6274 states and 14825 transitions. Second operand 6 states. [2019-12-18 18:04:40,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:40,757 INFO L93 Difference]: Finished difference Result 6942 states and 16188 transitions. [2019-12-18 18:04:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:40,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:40,767 INFO L225 Difference]: With dead ends: 6942 [2019-12-18 18:04:40,767 INFO L226 Difference]: Without dead ends: 6942 [2019-12-18 18:04:40,768 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:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2019-12-18 18:04:40,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6667. [2019-12-18 18:04:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6667 states. [2019-12-18 18:04:40,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6667 states to 6667 states and 15654 transitions. [2019-12-18 18:04:40,844 INFO L78 Accepts]: Start accepts. Automaton has 6667 states and 15654 transitions. Word has length 94 [2019-12-18 18:04:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:40,844 INFO L462 AbstractCegarLoop]: Abstraction has 6667 states and 15654 transitions. [2019-12-18 18:04:40,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:40,844 INFO L276 IsEmpty]: Start isEmpty. Operand 6667 states and 15654 transitions. [2019-12-18 18:04:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:40,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:40,853 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:40,853 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:40,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:40,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1442306179, now seen corresponding path program 5 times [2019-12-18 18:04:40,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:40,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985713948] [2019-12-18 18:04:40,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:42,053 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,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985713948] [2019-12-18 18:04:42,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:42,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:42,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472091426] [2019-12-18 18:04:42,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:42,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:42,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:42,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:42,056 INFO L87 Difference]: Start difference. First operand 6667 states and 15654 transitions. Second operand 7 states. [2019-12-18 18:04:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:43,153 INFO L93 Difference]: Finished difference Result 19108 states and 45320 transitions. [2019-12-18 18:04:43,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:43,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 18:04:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:43,187 INFO L225 Difference]: With dead ends: 19108 [2019-12-18 18:04:43,187 INFO L226 Difference]: Without dead ends: 19108 [2019-12-18 18:04:43,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:04:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2019-12-18 18:04:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 7145. [2019-12-18 18:04:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7145 states. [2019-12-18 18:04:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7145 states to 7145 states and 16896 transitions. [2019-12-18 18:04:43,379 INFO L78 Accepts]: Start accepts. Automaton has 7145 states and 16896 transitions. Word has length 94 [2019-12-18 18:04:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:43,379 INFO L462 AbstractCegarLoop]: Abstraction has 7145 states and 16896 transitions. [2019-12-18 18:04:43,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 7145 states and 16896 transitions. [2019-12-18 18:04:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:43,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:43,389 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:43,389 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:43,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:43,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1832696303, now seen corresponding path program 6 times [2019-12-18 18:04:43,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:43,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429510248] [2019-12-18 18:04:43,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:43,492 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,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429510248] [2019-12-18 18:04:43,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:43,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:43,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505444883] [2019-12-18 18:04:43,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:43,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:43,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:43,494 INFO L87 Difference]: Start difference. First operand 7145 states and 16896 transitions. Second operand 6 states. [2019-12-18 18:04:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:44,349 INFO L93 Difference]: Finished difference Result 11949 states and 27558 transitions. [2019-12-18 18:04:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 18:04:44,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 18:04:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:44,364 INFO L225 Difference]: With dead ends: 11949 [2019-12-18 18:04:44,364 INFO L226 Difference]: Without dead ends: 11949 [2019-12-18 18:04:44,364 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:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11949 states. [2019-12-18 18:04:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11949 to 9005. [2019-12-18 18:04:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9005 states. [2019-12-18 18:04:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9005 states to 9005 states and 21437 transitions. [2019-12-18 18:04:44,483 INFO L78 Accepts]: Start accepts. Automaton has 9005 states and 21437 transitions. Word has length 94 [2019-12-18 18:04:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:44,483 INFO L462 AbstractCegarLoop]: Abstraction has 9005 states and 21437 transitions. [2019-12-18 18:04:44,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 9005 states and 21437 transitions. [2019-12-18 18:04:44,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:44,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:44,493 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:44,494 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:44,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1949821147, now seen corresponding path program 7 times [2019-12-18 18:04:44,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:44,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062393733] [2019-12-18 18:04:44,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:44,665 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:44,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062393733] [2019-12-18 18:04:44,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:44,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:44,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828821441] [2019-12-18 18:04:44,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:04:44,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:44,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:04:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:04:44,667 INFO L87 Difference]: Start difference. First operand 9005 states and 21437 transitions. Second operand 9 states. [2019-12-18 18:04:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:45,426 INFO L93 Difference]: Finished difference Result 16040 states and 37941 transitions. [2019-12-18 18:04:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:04:45,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-12-18 18:04:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:45,448 INFO L225 Difference]: With dead ends: 16040 [2019-12-18 18:04:45,448 INFO L226 Difference]: Without dead ends: 13031 [2019-12-18 18:04:45,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:04:45,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13031 states. [2019-12-18 18:04:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13031 to 10812. [2019-12-18 18:04:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10812 states. [2019-12-18 18:04:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 25877 transitions. [2019-12-18 18:04:45,621 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 25877 transitions. Word has length 94 [2019-12-18 18:04:45,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:45,622 INFO L462 AbstractCegarLoop]: Abstraction has 10812 states and 25877 transitions. [2019-12-18 18:04:45,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:04:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 25877 transitions. [2019-12-18 18:04:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 18:04:45,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:45,632 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:45,632 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:45,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash 644265771, now seen corresponding path program 8 times [2019-12-18 18:04:45,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:45,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966306559] [2019-12-18 18:04:45,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:45,692 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,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966306559] [2019-12-18 18:04:45,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:45,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:04:45,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652446464] [2019-12-18 18:04:45,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:04:45,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:45,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:04:45,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:45,694 INFO L87 Difference]: Start difference. First operand 10812 states and 25877 transitions. Second operand 3 states. [2019-12-18 18:04:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:45,762 INFO L93 Difference]: Finished difference Result 7709 states and 18399 transitions. [2019-12-18 18:04:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:04:45,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 18:04:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:45,770 INFO L225 Difference]: With dead ends: 7709 [2019-12-18 18:04:45,770 INFO L226 Difference]: Without dead ends: 7709 [2019-12-18 18:04:45,770 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:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7709 states. [2019-12-18 18:04:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7709 to 7695. [2019-12-18 18:04:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7695 states. [2019-12-18 18:04:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7695 states to 7695 states and 18373 transitions. [2019-12-18 18:04:47,538 INFO L78 Accepts]: Start accepts. Automaton has 7695 states and 18373 transitions. Word has length 94 [2019-12-18 18:04:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:47,538 INFO L462 AbstractCegarLoop]: Abstraction has 7695 states and 18373 transitions. [2019-12-18 18:04:47,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:04:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 7695 states and 18373 transitions. [2019-12-18 18:04:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:47,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:47,546 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:47,546 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:47,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1786690136, now seen corresponding path program 1 times [2019-12-18 18:04:47,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:47,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992038626] [2019-12-18 18:04:47,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:47,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992038626] [2019-12-18 18:04:47,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:47,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:47,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045126704] [2019-12-18 18:04:47,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:47,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:47,641 INFO L87 Difference]: Start difference. First operand 7695 states and 18373 transitions. Second operand 6 states. [2019-12-18 18:04:48,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:48,241 INFO L93 Difference]: Finished difference Result 8191 states and 19359 transitions. [2019-12-18 18:04:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:48,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-18 18:04:48,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:48,252 INFO L225 Difference]: With dead ends: 8191 [2019-12-18 18:04:48,252 INFO L226 Difference]: Without dead ends: 8191 [2019-12-18 18:04:48,252 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:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states. [2019-12-18 18:04:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 7878. [2019-12-18 18:04:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7878 states. [2019-12-18 18:04:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 18765 transitions. [2019-12-18 18:04:48,342 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 18765 transitions. Word has length 95 [2019-12-18 18:04:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 7878 states and 18765 transitions. [2019-12-18 18:04:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 18765 transitions. [2019-12-18 18:04:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:48,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:48,350 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:48,350 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:48,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2108523736, now seen corresponding path program 2 times [2019-12-18 18:04:48,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:48,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495145687] [2019-12-18 18:04:48,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:48,468 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,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495145687] [2019-12-18 18:04:48,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:48,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:48,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223091373] [2019-12-18 18:04:48,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:48,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:48,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:48,471 INFO L87 Difference]: Start difference. First operand 7878 states and 18765 transitions. Second operand 7 states. [2019-12-18 18:04:49,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:49,496 INFO L93 Difference]: Finished difference Result 10196 states and 23567 transitions. [2019-12-18 18:04:49,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:49,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:49,509 INFO L225 Difference]: With dead ends: 10196 [2019-12-18 18:04:49,509 INFO L226 Difference]: Without dead ends: 10196 [2019-12-18 18:04:49,509 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:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10196 states. [2019-12-18 18:04:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10196 to 7755. [2019-12-18 18:04:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7755 states. [2019-12-18 18:04:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7755 states to 7755 states and 18485 transitions. [2019-12-18 18:04:49,611 INFO L78 Accepts]: Start accepts. Automaton has 7755 states and 18485 transitions. Word has length 95 [2019-12-18 18:04:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:49,612 INFO L462 AbstractCegarLoop]: Abstraction has 7755 states and 18485 transitions. [2019-12-18 18:04:49,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7755 states and 18485 transitions. [2019-12-18 18:04:49,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:49,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:49,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,620 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:49,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:49,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1986577122, now seen corresponding path program 3 times [2019-12-18 18:04:49,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:49,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573931550] [2019-12-18 18:04:49,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:49,725 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:49,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573931550] [2019-12-18 18:04:49,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:49,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:49,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942006629] [2019-12-18 18:04:49,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:49,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:49,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:49,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:49,727 INFO L87 Difference]: Start difference. First operand 7755 states and 18485 transitions. Second operand 7 states. [2019-12-18 18:04:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:50,469 INFO L93 Difference]: Finished difference Result 8758 states and 20563 transitions. [2019-12-18 18:04:50,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:04:50,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:50,479 INFO L225 Difference]: With dead ends: 8758 [2019-12-18 18:04:50,479 INFO L226 Difference]: Without dead ends: 8758 [2019-12-18 18:04:50,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8758 states. [2019-12-18 18:04:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8758 to 7830. [2019-12-18 18:04:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7830 states. [2019-12-18 18:04:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7830 states to 7830 states and 18668 transitions. [2019-12-18 18:04:50,568 INFO L78 Accepts]: Start accepts. Automaton has 7830 states and 18668 transitions. Word has length 95 [2019-12-18 18:04:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:50,568 INFO L462 AbstractCegarLoop]: Abstraction has 7830 states and 18668 transitions. [2019-12-18 18:04:50,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 7830 states and 18668 transitions. [2019-12-18 18:04:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:50,577 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:50,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:50,578 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:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:50,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1018864798, now seen corresponding path program 4 times [2019-12-18 18:04:50,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:50,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368189501] [2019-12-18 18:04:50,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:50,697 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:50,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368189501] [2019-12-18 18:04:50,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:50,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:04:50,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705886328] [2019-12-18 18:04:50,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:04:50,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:50,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:04:50,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:04:50,699 INFO L87 Difference]: Start difference. First operand 7830 states and 18668 transitions. Second operand 7 states. [2019-12-18 18:04:51,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:51,486 INFO L93 Difference]: Finished difference Result 8675 states and 20367 transitions. [2019-12-18 18:04:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:04:51,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-18 18:04:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:51,499 INFO L225 Difference]: With dead ends: 8675 [2019-12-18 18:04:51,499 INFO L226 Difference]: Without dead ends: 8675 [2019-12-18 18:04:51,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:04:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8675 states. [2019-12-18 18:04:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8675 to 7788. [2019-12-18 18:04:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7788 states. [2019-12-18 18:04:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7788 states to 7788 states and 18572 transitions. [2019-12-18 18:04:51,726 INFO L78 Accepts]: Start accepts. Automaton has 7788 states and 18572 transitions. Word has length 95 [2019-12-18 18:04:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:51,727 INFO L462 AbstractCegarLoop]: Abstraction has 7788 states and 18572 transitions. [2019-12-18 18:04:51,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:04:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 7788 states and 18572 transitions. [2019-12-18 18:04:51,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 18:04:51,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:51,739 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:51,739 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:51,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1103429564, now seen corresponding path program 5 times [2019-12-18 18:04:51,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:51,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600286201] [2019-12-18 18:04:51,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:51,832 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:51,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600286201] [2019-12-18 18:04:51,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:51,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:04:51,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494704790] [2019-12-18 18:04:51,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:04:51,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:51,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:04:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:04:51,836 INFO L87 Difference]: Start difference. First operand 7788 states and 18572 transitions. Second operand 3 states. [2019-12-18 18:04:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:51,899 INFO L93 Difference]: Finished difference Result 7788 states and 18571 transitions. [2019-12-18 18:04:51,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:04:51,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 18:04:51,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:51,910 INFO L225 Difference]: With dead ends: 7788 [2019-12-18 18:04:51,911 INFO L226 Difference]: Without dead ends: 7788 [2019-12-18 18:04:51,911 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:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7788 states. [2019-12-18 18:04:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7788 to 7211. [2019-12-18 18:04:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-18 18:04:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 17372 transitions. [2019-12-18 18:04:52,007 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 17372 transitions. Word has length 95 [2019-12-18 18:04:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:52,007 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 17372 transitions. [2019-12-18 18:04:52,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:04:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 17372 transitions. [2019-12-18 18:04:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:52,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:52,013 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,013 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:52,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2024800108, now seen corresponding path program 1 times [2019-12-18 18:04:52,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:52,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769195395] [2019-12-18 18:04:52,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:52,084 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,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769195395] [2019-12-18 18:04:52,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:52,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:04:52,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523455227] [2019-12-18 18:04:52,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:04:52,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:52,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:04:52,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:04:52,091 INFO L87 Difference]: Start difference. First operand 7211 states and 17372 transitions. Second operand 6 states. [2019-12-18 18:04:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:52,655 INFO L93 Difference]: Finished difference Result 7761 states and 18494 transitions. [2019-12-18 18:04:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:04:52,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 18:04:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:52,665 INFO L225 Difference]: With dead ends: 7761 [2019-12-18 18:04:52,665 INFO L226 Difference]: Without dead ends: 7761 [2019-12-18 18:04:52,666 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:52,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7761 states. [2019-12-18 18:04:52,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7761 to 7235. [2019-12-18 18:04:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7235 states. [2019-12-18 18:04:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7235 states to 7235 states and 17441 transitions. [2019-12-18 18:04:52,745 INFO L78 Accepts]: Start accepts. Automaton has 7235 states and 17441 transitions. Word has length 96 [2019-12-18 18:04:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:52,745 INFO L462 AbstractCegarLoop]: Abstraction has 7235 states and 17441 transitions. [2019-12-18 18:04:52,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:04:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 7235 states and 17441 transitions. [2019-12-18 18:04:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:52,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:52,751 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,751 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:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1261239740, now seen corresponding path program 2 times [2019-12-18 18:04:52,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:52,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937510386] [2019-12-18 18:04:52,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:52,904 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,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937510386] [2019-12-18 18:04:52,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:52,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:52,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709753724] [2019-12-18 18:04:52,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:52,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:52,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:52,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:52,906 INFO L87 Difference]: Start difference. First operand 7235 states and 17441 transitions. Second operand 10 states. [2019-12-18 18:04:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:53,888 INFO L93 Difference]: Finished difference Result 16681 states and 39439 transitions. [2019-12-18 18:04:53,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:04:53,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:53,907 INFO L225 Difference]: With dead ends: 16681 [2019-12-18 18:04:53,907 INFO L226 Difference]: Without dead ends: 15420 [2019-12-18 18:04:53,908 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:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15420 states. [2019-12-18 18:04:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15420 to 9990. [2019-12-18 18:04:54,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9990 states. [2019-12-18 18:04:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9990 states to 9990 states and 24565 transitions. [2019-12-18 18:04:54,049 INFO L78 Accepts]: Start accepts. Automaton has 9990 states and 24565 transitions. Word has length 96 [2019-12-18 18:04:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:54,050 INFO L462 AbstractCegarLoop]: Abstraction has 9990 states and 24565 transitions. [2019-12-18 18:04:54,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9990 states and 24565 transitions. [2019-12-18 18:04:54,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:54,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:54,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:04:54,058 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:54,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:54,059 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 3 times [2019-12-18 18:04:54,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:54,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435353634] [2019-12-18 18:04:54,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:54,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435353634] [2019-12-18 18:04:54,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:54,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:04:54,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876649255] [2019-12-18 18:04:54,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:54,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:54,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:54,260 INFO L87 Difference]: Start difference. First operand 9990 states and 24565 transitions. Second operand 10 states. [2019-12-18 18:04:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:55,274 INFO L93 Difference]: Finished difference Result 20638 states and 50205 transitions. [2019-12-18 18:04:55,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 18:04:55,274 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:55,292 INFO L225 Difference]: With dead ends: 20638 [2019-12-18 18:04:55,292 INFO L226 Difference]: Without dead ends: 16356 [2019-12-18 18:04:55,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:04:55,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16356 states. [2019-12-18 18:04:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16356 to 13909. [2019-12-18 18:04:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13909 states. [2019-12-18 18:04:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 34275 transitions. [2019-12-18 18:04:55,458 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 34275 transitions. Word has length 96 [2019-12-18 18:04:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:55,459 INFO L462 AbstractCegarLoop]: Abstraction has 13909 states and 34275 transitions. [2019-12-18 18:04:55,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 34275 transitions. [2019-12-18 18:04:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:55,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:55,473 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,473 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:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -478635746, now seen corresponding path program 4 times [2019-12-18 18:04:55,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:55,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519953606] [2019-12-18 18:04:55,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:55,771 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,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519953606] [2019-12-18 18:04:55,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:55,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:04:55,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651842124] [2019-12-18 18:04:55,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:04:55,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:55,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:04:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:04:55,773 INFO L87 Difference]: Start difference. First operand 13909 states and 34275 transitions. Second operand 15 states. [2019-12-18 18:04:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:57,275 INFO L93 Difference]: Finished difference Result 25894 states and 63708 transitions. [2019-12-18 18:04:57,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 18:04:57,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-18 18:04:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:57,306 INFO L225 Difference]: With dead ends: 25894 [2019-12-18 18:04:57,307 INFO L226 Difference]: Without dead ends: 25283 [2019-12-18 18:04:57,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 18:04:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25283 states. [2019-12-18 18:04:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25283 to 18235. [2019-12-18 18:04:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18235 states. [2019-12-18 18:04:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18235 states to 18235 states and 45862 transitions. [2019-12-18 18:04:57,573 INFO L78 Accepts]: Start accepts. Automaton has 18235 states and 45862 transitions. Word has length 96 [2019-12-18 18:04:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:57,573 INFO L462 AbstractCegarLoop]: Abstraction has 18235 states and 45862 transitions. [2019-12-18 18:04:57,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:04:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18235 states and 45862 transitions. [2019-12-18 18:04:57,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:57,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:57,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] [2019-12-18 18:04:57,592 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:57,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:57,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1047445466, now seen corresponding path program 5 times [2019-12-18 18:04:57,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:57,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244715392] [2019-12-18 18:04:57,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:04:57,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244715392] [2019-12-18 18:04:57,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:57,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:04:57,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672414265] [2019-12-18 18:04:57,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:57,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:57,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:57,746 INFO L87 Difference]: Start difference. First operand 18235 states and 45862 transitions. Second operand 10 states. [2019-12-18 18:04:59,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:04:59,434 INFO L93 Difference]: Finished difference Result 30668 states and 76981 transitions. [2019-12-18 18:04:59,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:04:59,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:04:59,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:04:59,468 INFO L225 Difference]: With dead ends: 30668 [2019-12-18 18:04:59,468 INFO L226 Difference]: Without dead ends: 30623 [2019-12-18 18:04:59,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:04:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30623 states. [2019-12-18 18:04:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30623 to 22678. [2019-12-18 18:04:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22678 states. [2019-12-18 18:04:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22678 states to 22678 states and 57386 transitions. [2019-12-18 18:04:59,771 INFO L78 Accepts]: Start accepts. Automaton has 22678 states and 57386 transitions. Word has length 96 [2019-12-18 18:04:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:04:59,771 INFO L462 AbstractCegarLoop]: Abstraction has 22678 states and 57386 transitions. [2019-12-18 18:04:59,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:04:59,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22678 states and 57386 transitions. [2019-12-18 18:04:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:04:59,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:04:59,794 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:59,794 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:59,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:04:59,794 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 6 times [2019-12-18 18:04:59,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:04:59,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751193832] [2019-12-18 18:04:59,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:04:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:04:59,952 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:59,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751193832] [2019-12-18 18:04:59,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:04:59,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:04:59,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117923285] [2019-12-18 18:04:59,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:04:59,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:04:59,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:04:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:04:59,954 INFO L87 Difference]: Start difference. First operand 22678 states and 57386 transitions. Second operand 10 states. [2019-12-18 18:05:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:00,810 INFO L93 Difference]: Finished difference Result 35078 states and 87749 transitions. [2019-12-18 18:05:00,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:05:00,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:00,853 INFO L225 Difference]: With dead ends: 35078 [2019-12-18 18:05:00,853 INFO L226 Difference]: Without dead ends: 33749 [2019-12-18 18:05:00,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:05:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33749 states. [2019-12-18 18:05:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33749 to 27788. [2019-12-18 18:05:01,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27788 states. [2019-12-18 18:05:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27788 states to 27788 states and 71179 transitions. [2019-12-18 18:05:01,249 INFO L78 Accepts]: Start accepts. Automaton has 27788 states and 71179 transitions. Word has length 96 [2019-12-18 18:05:01,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:01,249 INFO L462 AbstractCegarLoop]: Abstraction has 27788 states and 71179 transitions. [2019-12-18 18:05:01,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27788 states and 71179 transitions. [2019-12-18 18:05:01,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:01,442 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:01,442 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,442 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,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:01,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 7 times [2019-12-18 18:05:01,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:01,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641275253] [2019-12-18 18:05:01,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:01,796 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,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641275253] [2019-12-18 18:05:01,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:01,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:05:01,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635557838] [2019-12-18 18:05:01,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:05:01,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:05:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:01,798 INFO L87 Difference]: Start difference. First operand 27788 states and 71179 transitions. Second operand 14 states. [2019-12-18 18:05:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:03,263 INFO L93 Difference]: Finished difference Result 34374 states and 87082 transitions. [2019-12-18 18:05:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:05:03,264 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 18:05:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:03,306 INFO L225 Difference]: With dead ends: 34374 [2019-12-18 18:05:03,307 INFO L226 Difference]: Without dead ends: 34344 [2019-12-18 18:05:03,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:05:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34344 states. [2019-12-18 18:05:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34344 to 31163. [2019-12-18 18:05:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31163 states. [2019-12-18 18:05:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31163 states to 31163 states and 79920 transitions. [2019-12-18 18:05:03,740 INFO L78 Accepts]: Start accepts. Automaton has 31163 states and 79920 transitions. Word has length 96 [2019-12-18 18:05:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:03,740 INFO L462 AbstractCegarLoop]: Abstraction has 31163 states and 79920 transitions. [2019-12-18 18:05:03,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:05:03,740 INFO L276 IsEmpty]: Start isEmpty. Operand 31163 states and 79920 transitions. [2019-12-18 18:05:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:03,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:03,773 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,773 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,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1448749860, now seen corresponding path program 8 times [2019-12-18 18:05:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:03,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879800421] [2019-12-18 18:05:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:04,016 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:04,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879800421] [2019-12-18 18:05:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:04,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:05:04,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560619021] [2019-12-18 18:05:04,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:04,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:04,019 INFO L87 Difference]: Start difference. First operand 31163 states and 79920 transitions. Second operand 11 states. [2019-12-18 18:05:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:08,152 INFO L93 Difference]: Finished difference Result 62661 states and 159438 transitions. [2019-12-18 18:05:08,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 18:05:08,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:05:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:08,235 INFO L225 Difference]: With dead ends: 62661 [2019-12-18 18:05:08,235 INFO L226 Difference]: Without dead ends: 62604 [2019-12-18 18:05:08,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=290, Invalid=1116, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 18:05:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62604 states. [2019-12-18 18:05:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62604 to 39460. [2019-12-18 18:05:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39460 states. [2019-12-18 18:05:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39460 states to 39460 states and 101083 transitions. [2019-12-18 18:05:09,231 INFO L78 Accepts]: Start accepts. Automaton has 39460 states and 101083 transitions. Word has length 96 [2019-12-18 18:05:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:09,231 INFO L462 AbstractCegarLoop]: Abstraction has 39460 states and 101083 transitions. [2019-12-18 18:05:09,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 39460 states and 101083 transitions. [2019-12-18 18:05:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:09,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:09,269 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:09,269 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:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1482447806, now seen corresponding path program 9 times [2019-12-18 18:05:09,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:09,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168637366] [2019-12-18 18:05:09,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:09,413 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:09,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168637366] [2019-12-18 18:05:09,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:09,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:09,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147304182] [2019-12-18 18:05:09,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:09,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:09,415 INFO L87 Difference]: Start difference. First operand 39460 states and 101083 transitions. Second operand 10 states. [2019-12-18 18:05:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:10,970 INFO L93 Difference]: Finished difference Result 56223 states and 141933 transitions. [2019-12-18 18:05:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:05:10,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:11,062 INFO L225 Difference]: With dead ends: 56223 [2019-12-18 18:05:11,062 INFO L226 Difference]: Without dead ends: 55662 [2019-12-18 18:05:11,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:05:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55662 states. [2019-12-18 18:05:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55662 to 39376. [2019-12-18 18:05:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39376 states. [2019-12-18 18:05:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39376 states to 39376 states and 100727 transitions. [2019-12-18 18:05:11,683 INFO L78 Accepts]: Start accepts. Automaton has 39376 states and 100727 transitions. Word has length 96 [2019-12-18 18:05:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:11,683 INFO L462 AbstractCegarLoop]: Abstraction has 39376 states and 100727 transitions. [2019-12-18 18:05:11,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 39376 states and 100727 transitions. [2019-12-18 18:05:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:11,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:11,722 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:11,723 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:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -202074464, now seen corresponding path program 10 times [2019-12-18 18:05:11,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:11,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770346506] [2019-12-18 18:05:11,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:11,825 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:11,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770346506] [2019-12-18 18:05:11,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:11,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:05:11,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349837216] [2019-12-18 18:05:11,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:11,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:11,827 INFO L87 Difference]: Start difference. First operand 39376 states and 100727 transitions. Second operand 7 states. [2019-12-18 18:05:12,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:12,779 INFO L93 Difference]: Finished difference Result 40713 states and 103611 transitions. [2019-12-18 18:05:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:05:12,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 18:05:12,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:12,849 INFO L225 Difference]: With dead ends: 40713 [2019-12-18 18:05:12,849 INFO L226 Difference]: Without dead ends: 40070 [2019-12-18 18:05:12,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:05:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40070 states. [2019-12-18 18:05:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40070 to 39304. [2019-12-18 18:05:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39304 states. [2019-12-18 18:05:13,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39304 states to 39304 states and 100565 transitions. [2019-12-18 18:05:13,370 INFO L78 Accepts]: Start accepts. Automaton has 39304 states and 100565 transitions. Word has length 96 [2019-12-18 18:05:13,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:13,370 INFO L462 AbstractCegarLoop]: Abstraction has 39304 states and 100565 transitions. [2019-12-18 18:05:13,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:13,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39304 states and 100565 transitions. [2019-12-18 18:05:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:13,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:13,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,411 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:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash -965764708, now seen corresponding path program 11 times [2019-12-18 18:05:13,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:13,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206617322] [2019-12-18 18:05:13,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:13,642 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:13,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206617322] [2019-12-18 18:05:13,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:13,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:13,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616222220] [2019-12-18 18:05:13,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:05:13,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:13,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:05:13,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:05:13,645 INFO L87 Difference]: Start difference. First operand 39304 states and 100565 transitions. Second operand 12 states. [2019-12-18 18:05:15,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:15,085 INFO L93 Difference]: Finished difference Result 48635 states and 122219 transitions. [2019-12-18 18:05:15,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:05:15,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 18:05:15,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:15,142 INFO L225 Difference]: With dead ends: 48635 [2019-12-18 18:05:15,142 INFO L226 Difference]: Without dead ends: 44648 [2019-12-18 18:05:15,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:05:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44648 states. [2019-12-18 18:05:15,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44648 to 33466. [2019-12-18 18:05:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33466 states. [2019-12-18 18:05:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33466 states to 33466 states and 84561 transitions. [2019-12-18 18:05:15,864 INFO L78 Accepts]: Start accepts. Automaton has 33466 states and 84561 transitions. Word has length 96 [2019-12-18 18:05:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:15,864 INFO L462 AbstractCegarLoop]: Abstraction has 33466 states and 84561 transitions. [2019-12-18 18:05:15,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:05:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 33466 states and 84561 transitions. [2019-12-18 18:05:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:15,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:15,900 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:15,900 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:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -952141892, now seen corresponding path program 12 times [2019-12-18 18:05:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:15,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916906667] [2019-12-18 18:05:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:16,114 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:16,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916906667] [2019-12-18 18:05:16,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:16,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:16,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519580300] [2019-12-18 18:05:16,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:16,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:16,116 INFO L87 Difference]: Start difference. First operand 33466 states and 84561 transitions. Second operand 10 states. [2019-12-18 18:05:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:17,660 INFO L93 Difference]: Finished difference Result 46530 states and 116353 transitions. [2019-12-18 18:05:17,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:05:17,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:17,717 INFO L225 Difference]: With dead ends: 46530 [2019-12-18 18:05:17,717 INFO L226 Difference]: Without dead ends: 46530 [2019-12-18 18:05:17,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:05:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46530 states. [2019-12-18 18:05:18,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46530 to 34331. [2019-12-18 18:05:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34331 states. [2019-12-18 18:05:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34331 states to 34331 states and 86698 transitions. [2019-12-18 18:05:18,518 INFO L78 Accepts]: Start accepts. Automaton has 34331 states and 86698 transitions. Word has length 96 [2019-12-18 18:05:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:18,519 INFO L462 AbstractCegarLoop]: Abstraction has 34331 states and 86698 transitions. [2019-12-18 18:05:18,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34331 states and 86698 transitions. [2019-12-18 18:05:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:18,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:18,554 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:18,554 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:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 138397884, now seen corresponding path program 13 times [2019-12-18 18:05:18,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:18,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285387563] [2019-12-18 18:05:18,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:18,697 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:18,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285387563] [2019-12-18 18:05:18,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:18,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:18,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080876490] [2019-12-18 18:05:18,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:18,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:18,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:18,699 INFO L87 Difference]: Start difference. First operand 34331 states and 86698 transitions. Second operand 10 states. [2019-12-18 18:05:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:19,705 INFO L93 Difference]: Finished difference Result 47210 states and 116763 transitions. [2019-12-18 18:05:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:05:19,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 18:05:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:19,760 INFO L225 Difference]: With dead ends: 47210 [2019-12-18 18:05:19,760 INFO L226 Difference]: Without dead ends: 46471 [2019-12-18 18:05:19,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:05:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46471 states. [2019-12-18 18:05:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46471 to 33272. [2019-12-18 18:05:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-18 18:05:20,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 83498 transitions. [2019-12-18 18:05:20,248 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 83498 transitions. Word has length 96 [2019-12-18 18:05:20,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:20,248 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 83498 transitions. [2019-12-18 18:05:20,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:05:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 83498 transitions. [2019-12-18 18:05:20,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:20,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:20,281 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:20,281 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:20,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:20,281 INFO L82 PathProgramCache]: Analyzing trace with hash 334801602, now seen corresponding path program 14 times [2019-12-18 18:05:20,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:20,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923104338] [2019-12-18 18:05:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:20,405 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:20,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923104338] [2019-12-18 18:05:20,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:20,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:05:20,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67387559] [2019-12-18 18:05:20,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:05:20,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:20,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:05:20,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:20,407 INFO L87 Difference]: Start difference. First operand 33272 states and 83498 transitions. Second operand 9 states. [2019-12-18 18:05:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:21,430 INFO L93 Difference]: Finished difference Result 51847 states and 129541 transitions. [2019-12-18 18:05:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:05:21,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 18:05:21,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:21,480 INFO L225 Difference]: With dead ends: 51847 [2019-12-18 18:05:21,481 INFO L226 Difference]: Without dead ends: 45258 [2019-12-18 18:05:21,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-18 18:05:21,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 39473. [2019-12-18 18:05:21,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39473 states. [2019-12-18 18:05:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39473 states to 39473 states and 99601 transitions. [2019-12-18 18:05:21,979 INFO L78 Accepts]: Start accepts. Automaton has 39473 states and 99601 transitions. Word has length 96 [2019-12-18 18:05:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:21,979 INFO L462 AbstractCegarLoop]: Abstraction has 39473 states and 99601 transitions. [2019-12-18 18:05:21,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:05:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 39473 states and 99601 transitions. [2019-12-18 18:05:22,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:22,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:22,018 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:22,018 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:22,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash -428888642, now seen corresponding path program 15 times [2019-12-18 18:05:22,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:22,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695053779] [2019-12-18 18:05:22,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:22,177 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:22,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695053779] [2019-12-18 18:05:22,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:22,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:05:22,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322904422] [2019-12-18 18:05:22,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:05:22,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:05:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:05:22,178 INFO L87 Difference]: Start difference. First operand 39473 states and 99601 transitions. Second operand 9 states. [2019-12-18 18:05:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:23,118 INFO L93 Difference]: Finished difference Result 49652 states and 124702 transitions. [2019-12-18 18:05:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:05:23,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 18:05:23,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:23,187 INFO L225 Difference]: With dead ends: 49652 [2019-12-18 18:05:23,187 INFO L226 Difference]: Without dead ends: 49652 [2019-12-18 18:05:23,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:05:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49652 states. [2019-12-18 18:05:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49652 to 41114. [2019-12-18 18:05:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41114 states. [2019-12-18 18:05:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41114 states to 41114 states and 103861 transitions. [2019-12-18 18:05:24,083 INFO L78 Accepts]: Start accepts. Automaton has 41114 states and 103861 transitions. Word has length 96 [2019-12-18 18:05:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:24,083 INFO L462 AbstractCegarLoop]: Abstraction has 41114 states and 103861 transitions. [2019-12-18 18:05:24,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:05:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41114 states and 103861 transitions. [2019-12-18 18:05:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:24,127 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:24,127 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:24,127 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:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:24,127 INFO L82 PathProgramCache]: Analyzing trace with hash -144457054, now seen corresponding path program 16 times [2019-12-18 18:05:24,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:24,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793949842] [2019-12-18 18:05:24,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:24,285 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:24,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793949842] [2019-12-18 18:05:24,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:24,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:24,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297890254] [2019-12-18 18:05:24,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:24,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:24,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:24,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:24,289 INFO L87 Difference]: Start difference. First operand 41114 states and 103861 transitions. Second operand 11 states. [2019-12-18 18:05:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:25,430 INFO L93 Difference]: Finished difference Result 52730 states and 132575 transitions. [2019-12-18 18:05:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 18:05:25,431 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 18:05:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:25,496 INFO L225 Difference]: With dead ends: 52730 [2019-12-18 18:05:25,496 INFO L226 Difference]: Without dead ends: 51895 [2019-12-18 18:05:25,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:05:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51895 states. [2019-12-18 18:05:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51895 to 38369. [2019-12-18 18:05:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38369 states. [2019-12-18 18:05:26,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38369 states to 38369 states and 97127 transitions. [2019-12-18 18:05:26,038 INFO L78 Accepts]: Start accepts. Automaton has 38369 states and 97127 transitions. Word has length 96 [2019-12-18 18:05:26,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:26,038 INFO L462 AbstractCegarLoop]: Abstraction has 38369 states and 97127 transitions. [2019-12-18 18:05:26,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:26,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38369 states and 97127 transitions. [2019-12-18 18:05:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:26,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:26,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,075 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:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 304809122, now seen corresponding path program 17 times [2019-12-18 18:05:26,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:26,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189986558] [2019-12-18 18:05:26,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:26,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:26,445 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:26,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189986558] [2019-12-18 18:05:26,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:26,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:05:26,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344248776] [2019-12-18 18:05:26,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 18:05:26,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:26,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 18:05:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 18:05:26,447 INFO L87 Difference]: Start difference. First operand 38369 states and 97127 transitions. Second operand 19 states. [2019-12-18 18:05:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:32,963 INFO L93 Difference]: Finished difference Result 72481 states and 182111 transitions. [2019-12-18 18:05:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-18 18:05:32,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-18 18:05:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:33,049 INFO L225 Difference]: With dead ends: 72481 [2019-12-18 18:05:33,049 INFO L226 Difference]: Without dead ends: 62081 [2019-12-18 18:05:33,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=447, Invalid=3335, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 18:05:33,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62081 states. [2019-12-18 18:05:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62081 to 40436. [2019-12-18 18:05:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40436 states. [2019-12-18 18:05:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40436 states to 40436 states and 102118 transitions. [2019-12-18 18:05:33,956 INFO L78 Accepts]: Start accepts. Automaton has 40436 states and 102118 transitions. Word has length 96 [2019-12-18 18:05:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:33,956 INFO L462 AbstractCegarLoop]: Abstraction has 40436 states and 102118 transitions. [2019-12-18 18:05:33,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 18:05:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 40436 states and 102118 transitions. [2019-12-18 18:05:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 18:05:33,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:33,999 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:33,999 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:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -458881122, now seen corresponding path program 18 times [2019-12-18 18:05:33,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:33,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895320702] [2019-12-18 18:05:34,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:34,157 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:34,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895320702] [2019-12-18 18:05:34,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:34,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:05:34,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104215166] [2019-12-18 18:05:34,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:05:34,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:34,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:05:34,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:05:34,158 INFO L87 Difference]: Start difference. First operand 40436 states and 102118 transitions. Second operand 12 states. [2019-12-18 18:05:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:36,414 INFO L93 Difference]: Finished difference Result 62972 states and 159456 transitions. [2019-12-18 18:05:36,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:05:36,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-18 18:05:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:36,499 INFO L225 Difference]: With dead ends: 62972 [2019-12-18 18:05:36,499 INFO L226 Difference]: Without dead ends: 61510 [2019-12-18 18:05:36,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 18:05:36,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61510 states. [2019-12-18 18:05:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61510 to 37454. [2019-12-18 18:05:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37454 states. [2019-12-18 18:05:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37454 states to 37454 states and 94846 transitions. [2019-12-18 18:05:37,097 INFO L78 Accepts]: Start accepts. Automaton has 37454 states and 94846 transitions. Word has length 96 [2019-12-18 18:05:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:37,097 INFO L462 AbstractCegarLoop]: Abstraction has 37454 states and 94846 transitions. [2019-12-18 18:05:37,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:05:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 37454 states and 94846 transitions. [2019-12-18 18:05:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:37,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:37,463 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:37,463 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:37,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:37,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 18:05:37,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:37,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624292035] [2019-12-18 18:05:37,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:37,673 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:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624292035] [2019-12-18 18:05:37,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:37,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:05:37,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316522495] [2019-12-18 18:05:37,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:37,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:37,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:37,675 INFO L87 Difference]: Start difference. First operand 37454 states and 94846 transitions. Second operand 11 states. [2019-12-18 18:05:40,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:40,506 INFO L93 Difference]: Finished difference Result 77989 states and 196566 transitions. [2019-12-18 18:05:40,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 18:05:40,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:05:40,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:40,594 INFO L225 Difference]: With dead ends: 77989 [2019-12-18 18:05:40,594 INFO L226 Difference]: Without dead ends: 66971 [2019-12-18 18:05:40,595 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:40,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66971 states. [2019-12-18 18:05:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66971 to 41939. [2019-12-18 18:05:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41939 states. [2019-12-18 18:05:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41939 states to 41939 states and 106247 transitions. [2019-12-18 18:05:41,238 INFO L78 Accepts]: Start accepts. Automaton has 41939 states and 106247 transitions. Word has length 97 [2019-12-18 18:05:41,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:41,238 INFO L462 AbstractCegarLoop]: Abstraction has 41939 states and 106247 transitions. [2019-12-18 18:05:41,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:41,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41939 states and 106247 transitions. [2019-12-18 18:05:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:41,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:41,278 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:41,278 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:05:41,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 18:05:41,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:41,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333762877] [2019-12-18 18:05:41,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:41,427 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:41,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333762877] [2019-12-18 18:05:41,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:41,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:05:41,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839301255] [2019-12-18 18:05:41,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:05:41,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:05:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:05:41,429 INFO L87 Difference]: Start difference. First operand 41939 states and 106247 transitions. Second operand 6 states. [2019-12-18 18:05:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:41,847 INFO L93 Difference]: Finished difference Result 41187 states and 104080 transitions. [2019-12-18 18:05:41,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:05:41,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 18:05:41,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:41,900 INFO L225 Difference]: With dead ends: 41187 [2019-12-18 18:05:41,900 INFO L226 Difference]: Without dead ends: 41187 [2019-12-18 18:05:41,900 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:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41187 states. [2019-12-18 18:05:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41187 to 33591. [2019-12-18 18:05:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33591 states. [2019-12-18 18:05:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33591 states to 33591 states and 84574 transitions. [2019-12-18 18:05:42,369 INFO L78 Accepts]: Start accepts. Automaton has 33591 states and 84574 transitions. Word has length 97 [2019-12-18 18:05:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:42,369 INFO L462 AbstractCegarLoop]: Abstraction has 33591 states and 84574 transitions. [2019-12-18 18:05:42,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:05:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33591 states and 84574 transitions. [2019-12-18 18:05:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:42,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:42,403 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:42,403 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:42,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 18:05:42,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:42,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007606978] [2019-12-18 18:05:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:42,510 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,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007606978] [2019-12-18 18:05:42,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:42,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:05:42,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176798765] [2019-12-18 18:05:42,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:05:42,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:42,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:05:42,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:05:42,512 INFO L87 Difference]: Start difference. First operand 33591 states and 84574 transitions. Second operand 7 states. [2019-12-18 18:05:43,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:43,452 INFO L93 Difference]: Finished difference Result 45539 states and 113902 transitions. [2019-12-18 18:05:43,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:05:43,454 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 18:05:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:43,506 INFO L225 Difference]: With dead ends: 45539 [2019-12-18 18:05:43,506 INFO L226 Difference]: Without dead ends: 45532 [2019-12-18 18:05:43,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:43,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45532 states. [2019-12-18 18:05:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45532 to 39903. [2019-12-18 18:05:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39903 states. [2019-12-18 18:05:44,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39903 states to 39903 states and 100470 transitions. [2019-12-18 18:05:44,063 INFO L78 Accepts]: Start accepts. Automaton has 39903 states and 100470 transitions. Word has length 97 [2019-12-18 18:05:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:44,063 INFO L462 AbstractCegarLoop]: Abstraction has 39903 states and 100470 transitions. [2019-12-18 18:05:44,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:05:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 39903 states and 100470 transitions. [2019-12-18 18:05:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:44,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:44,438 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:44,438 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-18 18:05:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:44,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458029416] [2019-12-18 18:05:44,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:44,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:44,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458029416] [2019-12-18 18:05:44,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:44,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 18:05:44,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194168618] [2019-12-18 18:05:44,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:05:44,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:05:44,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:05:44,589 INFO L87 Difference]: Start difference. First operand 39903 states and 100470 transitions. Second operand 8 states. [2019-12-18 18:05:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:45,586 INFO L93 Difference]: Finished difference Result 45921 states and 114747 transitions. [2019-12-18 18:05:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:05:45,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 18:05:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:45,647 INFO L225 Difference]: With dead ends: 45921 [2019-12-18 18:05:45,647 INFO L226 Difference]: Without dead ends: 45914 [2019-12-18 18:05:45,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:05:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45914 states. [2019-12-18 18:05:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45914 to 38879. [2019-12-18 18:05:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38879 states. [2019-12-18 18:05:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38879 states to 38879 states and 97899 transitions. [2019-12-18 18:05:46,194 INFO L78 Accepts]: Start accepts. Automaton has 38879 states and 97899 transitions. Word has length 97 [2019-12-18 18:05:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:46,194 INFO L462 AbstractCegarLoop]: Abstraction has 38879 states and 97899 transitions. [2019-12-18 18:05:46,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:05:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 38879 states and 97899 transitions. [2019-12-18 18:05:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:46,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:46,234 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:46,234 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:46,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-18 18:05:46,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:46,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599188764] [2019-12-18 18:05:46,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:46,462 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:46,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599188764] [2019-12-18 18:05:46,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:46,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:05:46,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928759948] [2019-12-18 18:05:46,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:05:46,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:05:46,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:05:46,465 INFO L87 Difference]: Start difference. First operand 38879 states and 97899 transitions. Second operand 11 states. [2019-12-18 18:05:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:47,704 INFO L93 Difference]: Finished difference Result 43367 states and 108185 transitions. [2019-12-18 18:05:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:05:47,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2019-12-18 18:05:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:47,754 INFO L225 Difference]: With dead ends: 43367 [2019-12-18 18:05:47,754 INFO L226 Difference]: Without dead ends: 43367 [2019-12-18 18:05:47,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:05:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43367 states. [2019-12-18 18:05:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43367 to 39151. [2019-12-18 18:05:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39151 states. [2019-12-18 18:05:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39151 states to 39151 states and 98508 transitions. [2019-12-18 18:05:48,515 INFO L78 Accepts]: Start accepts. Automaton has 39151 states and 98508 transitions. Word has length 97 [2019-12-18 18:05:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:48,515 INFO L462 AbstractCegarLoop]: Abstraction has 39151 states and 98508 transitions. [2019-12-18 18:05:48,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:05:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39151 states and 98508 transitions. [2019-12-18 18:05:48,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:48,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:48,552 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:48,552 INFO L410 AbstractCegarLoop]: === Iteration 45 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:48,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:48,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-18 18:05:48,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:48,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550366224] [2019-12-18 18:05:48,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:49,176 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:49,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550366224] [2019-12-18 18:05:49,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:49,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-18 18:05:49,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7028913] [2019-12-18 18:05:49,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 18:05:49,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 18:05:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2019-12-18 18:05:49,178 INFO L87 Difference]: Start difference. First operand 39151 states and 98508 transitions. Second operand 24 states. [2019-12-18 18:05:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:56,099 INFO L93 Difference]: Finished difference Result 51535 states and 128220 transitions. [2019-12-18 18:05:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 18:05:56,100 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 97 [2019-12-18 18:05:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:56,150 INFO L225 Difference]: With dead ends: 51535 [2019-12-18 18:05:56,150 INFO L226 Difference]: Without dead ends: 48036 [2019-12-18 18:05:56,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=364, Invalid=2716, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 18:05:56,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48036 states. [2019-12-18 18:05:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48036 to 41903. [2019-12-18 18:05:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41903 states. [2019-12-18 18:05:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41903 states to 41903 states and 105355 transitions. [2019-12-18 18:05:56,647 INFO L78 Accepts]: Start accepts. Automaton has 41903 states and 105355 transitions. Word has length 97 [2019-12-18 18:05:56,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:56,647 INFO L462 AbstractCegarLoop]: Abstraction has 41903 states and 105355 transitions. [2019-12-18 18:05:56,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 18:05:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 41903 states and 105355 transitions. [2019-12-18 18:05:56,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:56,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:56,686 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:56,686 INFO L410 AbstractCegarLoop]: === Iteration 46 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:56,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:56,686 INFO L82 PathProgramCache]: Analyzing trace with hash -522924491, now seen corresponding path program 5 times [2019-12-18 18:05:56,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:56,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390323096] [2019-12-18 18:05:56,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:56,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390323096] [2019-12-18 18:05:56,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:56,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:05:56,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915927509] [2019-12-18 18:05:56,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 18:05:56,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 18:05:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:05:56,783 INFO L87 Difference]: Start difference. First operand 41903 states and 105355 transitions. Second operand 8 states. [2019-12-18 18:05:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:57,577 INFO L93 Difference]: Finished difference Result 42819 states and 107358 transitions. [2019-12-18 18:05:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:05:57,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 18:05:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:57,633 INFO L225 Difference]: With dead ends: 42819 [2019-12-18 18:05:57,633 INFO L226 Difference]: Without dead ends: 42819 [2019-12-18 18:05:57,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:05:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42819 states. [2019-12-18 18:05:58,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42819 to 41671. [2019-12-18 18:05:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41671 states. [2019-12-18 18:05:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41671 states to 41671 states and 104791 transitions. [2019-12-18 18:05:58,133 INFO L78 Accepts]: Start accepts. Automaton has 41671 states and 104791 transitions. Word has length 97 [2019-12-18 18:05:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:05:58,133 INFO L462 AbstractCegarLoop]: Abstraction has 41671 states and 104791 transitions. [2019-12-18 18:05:58,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 18:05:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 41671 states and 104791 transitions. [2019-12-18 18:05:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:05:58,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:05:58,172 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:58,172 INFO L410 AbstractCegarLoop]: === Iteration 47 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:05:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:05:58,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1147784417, now seen corresponding path program 6 times [2019-12-18 18:05:58,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:05:58,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925882488] [2019-12-18 18:05:58,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:05:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:05:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:05:58,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925882488] [2019-12-18 18:05:58,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:05:58,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:05:58,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713575546] [2019-12-18 18:05:58,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:05:58,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:05:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:05:58,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:05:58,386 INFO L87 Difference]: Start difference. First operand 41671 states and 104791 transitions. Second operand 10 states. [2019-12-18 18:05:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:05:59,909 INFO L93 Difference]: Finished difference Result 56174 states and 140813 transitions. [2019-12-18 18:05:59,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:05:59,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 18:05:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:05:59,976 INFO L225 Difference]: With dead ends: 56174 [2019-12-18 18:05:59,976 INFO L226 Difference]: Without dead ends: 56167 [2019-12-18 18:05:59,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:06:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56167 states. [2019-12-18 18:06:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56167 to 41278. [2019-12-18 18:06:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41278 states. [2019-12-18 18:06:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41278 states to 41278 states and 103831 transitions. [2019-12-18 18:06:00,515 INFO L78 Accepts]: Start accepts. Automaton has 41278 states and 103831 transitions. Word has length 97 [2019-12-18 18:06:00,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:00,516 INFO L462 AbstractCegarLoop]: Abstraction has 41278 states and 103831 transitions. [2019-12-18 18:06:00,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:06:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 41278 states and 103831 transitions. [2019-12-18 18:06:00,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:06:00,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:00,554 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:06:00,554 INFO L410 AbstractCegarLoop]: === Iteration 48 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:00,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:00,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1419727447, now seen corresponding path program 7 times [2019-12-18 18:06:00,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:00,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096669120] [2019-12-18 18:06:00,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:00,869 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:00,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096669120] [2019-12-18 18:06:00,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:00,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:06:00,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735902555] [2019-12-18 18:06:00,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:06:00,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:06:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:06:00,870 INFO L87 Difference]: Start difference. First operand 41278 states and 103831 transitions. Second operand 14 states. [2019-12-18 18:06:03,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:03,338 INFO L93 Difference]: Finished difference Result 67443 states and 168238 transitions. [2019-12-18 18:06:03,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:06:03,339 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 97 [2019-12-18 18:06:03,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:03,427 INFO L225 Difference]: With dead ends: 67443 [2019-12-18 18:06:03,427 INFO L226 Difference]: Without dead ends: 67443 [2019-12-18 18:06:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:06:03,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67443 states. [2019-12-18 18:06:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67443 to 44105. [2019-12-18 18:06:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44105 states. [2019-12-18 18:06:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44105 states to 44105 states and 111573 transitions. [2019-12-18 18:06:04,457 INFO L78 Accepts]: Start accepts. Automaton has 44105 states and 111573 transitions. Word has length 97 [2019-12-18 18:06:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:04,457 INFO L462 AbstractCegarLoop]: Abstraction has 44105 states and 111573 transitions. [2019-12-18 18:06:04,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:06:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44105 states and 111573 transitions. [2019-12-18 18:06:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:06:04,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:04,501 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:06:04,501 INFO L410 AbstractCegarLoop]: === Iteration 49 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash -920339781, now seen corresponding path program 8 times [2019-12-18 18:06:04,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:04,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868754106] [2019-12-18 18:06:04,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:04,659 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:04,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868754106] [2019-12-18 18:06:04,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:04,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:06:04,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704201129] [2019-12-18 18:06:04,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:06:04,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:04,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:06:04,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:06:04,660 INFO L87 Difference]: Start difference. First operand 44105 states and 111573 transitions. Second operand 10 states. [2019-12-18 18:06:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:06,294 INFO L93 Difference]: Finished difference Result 60470 states and 152311 transitions. [2019-12-18 18:06:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 18:06:06,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 18:06:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:06,375 INFO L225 Difference]: With dead ends: 60470 [2019-12-18 18:06:06,376 INFO L226 Difference]: Without dead ends: 60463 [2019-12-18 18:06:06,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:06:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60463 states. [2019-12-18 18:06:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60463 to 42444. [2019-12-18 18:06:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42444 states. [2019-12-18 18:06:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42444 states to 42444 states and 107275 transitions. [2019-12-18 18:06:07,008 INFO L78 Accepts]: Start accepts. Automaton has 42444 states and 107275 transitions. Word has length 97 [2019-12-18 18:06:07,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:07,009 INFO L462 AbstractCegarLoop]: Abstraction has 42444 states and 107275 transitions. [2019-12-18 18:06:07,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:06:07,009 INFO L276 IsEmpty]: Start isEmpty. Operand 42444 states and 107275 transitions. [2019-12-18 18:06:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 18:06:07,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:07,052 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:06:07,052 INFO L410 AbstractCegarLoop]: === Iteration 50 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:07,052 INFO L82 PathProgramCache]: Analyzing trace with hash 632383657, now seen corresponding path program 9 times [2019-12-18 18:06:07,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:07,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298292329] [2019-12-18 18:06:07,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:07,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298292329] [2019-12-18 18:06:07,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:07,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:06:07,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923136448] [2019-12-18 18:06:07,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:06:07,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:07,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:06:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:06:07,473 INFO L87 Difference]: Start difference. First operand 42444 states and 107275 transitions. Second operand 14 states. Received shutdown request... [2019-12-18 18:06:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:06:08,382 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 18:06:08,389 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 18:06:08,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:06:08 BasicIcfg [2019-12-18 18:06:08,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:06:08,392 INFO L168 Benchmark]: Toolchain (without parser) took 208125.18 ms. Allocated memory was 136.3 MB in the beginning and 2.9 GB in the end (delta: 2.8 GB). Free memory was 98.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 551.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,393 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.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:08,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 804.53 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 151.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 147.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,394 INFO L168 Benchmark]: Boogie Preprocessor took 49.68 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 144.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,395 INFO L168 Benchmark]: RCFGBuilder took 1233.32 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.4 MB in the beginning and 188.5 MB in the end (delta: -44.1 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,395 INFO L168 Benchmark]: TraceAbstraction took 205960.16 ms. Allocated memory was 229.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 188.5 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 548.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:08,398 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.46 ms. Allocated memory is still 136.3 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 804.53 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 151.4 MB in the end (delta: -53.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.54 ms. Allocated memory is still 200.3 MB. Free memory was 151.4 MB in the beginning and 147.9 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.68 ms. Allocated memory is still 200.3 MB. Free memory was 147.9 MB in the beginning and 144.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1233.32 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.4 MB in the beginning and 188.5 MB in the end (delta: -44.1 MB). Peak memory consumption was 69.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 205960.16 ms. Allocated memory was 229.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 188.5 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 548.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.3s, 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 (42444states) and FLOYD_HOARE automaton (currently 11 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (434 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 (42444states) and FLOYD_HOARE automaton (currently 11 states, 14 states before enhancement),while ReachableStatesComputation was computing reachable states (434 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 205.7s, OverallIterations: 50, TraceHistogramMax: 1, AutomataDifference: 97.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 22185 SDtfs, 26187 SDslu, 107154 SDs, 0 SdLazy, 50122 SolverSat, 1391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 185 SyntacticMatches, 78 SemanticMatches, 755 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4246 ImplicationChecksByTransitivity, 12.9s 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: 73.1s AutomataMinimizationTime, 49 MinimizatonAttempts, 410567 StatesRemovedByMinimization, 48 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 4204 NumberOfCodeBlocks, 4204 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 4154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 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