/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:06:33,193 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:06:33,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:06:33,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:06:33,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:06:33,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:06:33,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:06:33,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:06:33,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:06:33,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:06:33,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:06:33,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:06:33,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:06:33,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:06:33,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:06:33,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:06:33,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:06:33,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:06:33,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:06:33,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:06:33,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:06:33,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:06:33,231 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:06:33,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:06:33,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:06:33,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:06:33,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:06:33,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:06:33,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:06:33,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:06:33,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:06:33,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:06:33,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:06:33,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:06:33,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:06:33,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:06:33,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:06:33,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:06:33,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:06:33,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:06:33,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:06:33,246 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:06:33,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:06:33,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:06:33,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:06:33,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:06:33,262 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:06:33,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:06:33,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:06:33,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:06:33,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:06:33,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:06:33,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:06:33,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:06:33,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:06:33,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:06:33,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:06:33,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:06:33,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:33,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:06:33,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:06:33,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:06:33,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:06:33,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:06:33,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:06:33,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:06:33,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:06:33,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:06:33,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:06:33,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:06:33,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:06:33,555 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:06:33,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-18 14:06:33,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7940cc6/0d9a211e766f412da0d9240cdb940c2a/FLAG65c0a000e [2019-12-18 14:06:34,242 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:06:34,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_power.oepc.i [2019-12-18 14:06:34,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7940cc6/0d9a211e766f412da0d9240cdb940c2a/FLAG65c0a000e [2019-12-18 14:06:34,481 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7940cc6/0d9a211e766f412da0d9240cdb940c2a [2019-12-18 14:06:34,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:06:34,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:06:34,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:34,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:06:34,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:06:34,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:34" (1/1) ... [2019-12-18 14:06:34,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e5a994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:34, skipping insertion in model container [2019-12-18 14:06:34,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:06:34" (1/1) ... [2019-12-18 14:06:34,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:06:34,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:06:35,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:35,150 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:06:35,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:06:35,302 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:06:35,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35 WrapperNode [2019-12-18 14:06:35,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:06:35,303 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:35,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:06:35,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:06:35,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,388 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:06:35,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:06:35,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:06:35,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:06:35,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,409 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... [2019-12-18 14:06:35,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:06:35,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:06:35,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:06:35,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:06:35,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:06:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:06:35,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:06:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:06:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:06:35,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:06:35,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:06:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:06:35,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:06:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:06:35,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:06:35,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:06:35,536 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:06:36,680 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:06:36,681 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:06:36,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:36 BoogieIcfgContainer [2019-12-18 14:06:36,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:06:36,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:06:36,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:06:36,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:06:36,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:06:34" (1/3) ... [2019-12-18 14:06:36,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb3e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:36, skipping insertion in model container [2019-12-18 14:06:36,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:06:35" (2/3) ... [2019-12-18 14:06:36,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cb3e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:06:36, skipping insertion in model container [2019-12-18 14:06:36,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:06:36" (3/3) ... [2019-12-18 14:06:36,691 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_power.oepc.i [2019-12-18 14:06:36,702 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:06:36,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:06:36,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:06:36,712 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:06:36,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,759 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,766 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,767 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,771 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,772 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,786 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,791 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,792 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,793 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,795 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,802 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,819 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,821 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:06:36,850 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:06:36,870 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:06:36,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:06:36,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:06:36,871 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:06:36,871 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:06:36,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:06:36,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:06:36,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:06:36,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 14:06:36,892 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:37,032 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:37,033 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:37,098 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:37,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 14:06:37,341 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 14:06:37,342 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:06:37,369 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 14:06:37,429 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-18 14:06:37,430 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:06:40,317 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2019-12-18 14:06:45,182 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 14:06:45,296 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 14:06:45,423 INFO L206 etLargeBlockEncoding]: Checked pairs total: 326763 [2019-12-18 14:06:45,423 INFO L214 etLargeBlockEncoding]: Total number of compositions: 143 [2019-12-18 14:06:45,427 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 154 places, 193 transitions [2019-12-18 14:06:59,542 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 116492 states. [2019-12-18 14:06:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 116492 states. [2019-12-18 14:06:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:06:59,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:06:59,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:06:59,551 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:06:59,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:06:59,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1351330582, now seen corresponding path program 1 times [2019-12-18 14:06:59,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:06:59,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835806287] [2019-12-18 14:06:59,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:06:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:06:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:06:59,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835806287] [2019-12-18 14:06:59,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:06:59,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:06:59,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671136315] [2019-12-18 14:06:59,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:06:59,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:06:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:06:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:06:59,838 INFO L87 Difference]: Start difference. First operand 116492 states. Second operand 3 states. [2019-12-18 14:07:02,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:02,500 INFO L93 Difference]: Finished difference Result 116456 states and 442542 transitions. [2019-12-18 14:07:02,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:07:02,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:07:02,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:03,404 INFO L225 Difference]: With dead ends: 116456 [2019-12-18 14:07:03,405 INFO L226 Difference]: Without dead ends: 114036 [2019-12-18 14:07:03,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:07:12,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114036 states. [2019-12-18 14:07:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114036 to 114036. [2019-12-18 14:07:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114036 states. [2019-12-18 14:07:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114036 states to 114036 states and 433940 transitions. [2019-12-18 14:07:14,977 INFO L78 Accepts]: Start accepts. Automaton has 114036 states and 433940 transitions. Word has length 5 [2019-12-18 14:07:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:14,977 INFO L462 AbstractCegarLoop]: Abstraction has 114036 states and 433940 transitions. [2019-12-18 14:07:14,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:07:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 114036 states and 433940 transitions. [2019-12-18 14:07:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:14,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:14,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:14,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -168516540, now seen corresponding path program 1 times [2019-12-18 14:07:14,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:14,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415854428] [2019-12-18 14:07:14,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:15,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415854428] [2019-12-18 14:07:15,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:15,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:15,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35853866] [2019-12-18 14:07:15,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:15,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:15,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:15,133 INFO L87 Difference]: Start difference. First operand 114036 states and 433940 transitions. Second operand 4 states. [2019-12-18 14:07:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:19,910 INFO L93 Difference]: Finished difference Result 152998 states and 565528 transitions. [2019-12-18 14:07:19,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:19,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:20,391 INFO L225 Difference]: With dead ends: 152998 [2019-12-18 14:07:20,391 INFO L226 Difference]: Without dead ends: 152998 [2019-12-18 14:07:20,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152998 states. [2019-12-18 14:07:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152998 to 152836. [2019-12-18 14:07:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152836 states. [2019-12-18 14:07:35,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152836 states to 152836 states and 565076 transitions. [2019-12-18 14:07:35,331 INFO L78 Accepts]: Start accepts. Automaton has 152836 states and 565076 transitions. Word has length 11 [2019-12-18 14:07:35,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:35,331 INFO L462 AbstractCegarLoop]: Abstraction has 152836 states and 565076 transitions. [2019-12-18 14:07:35,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 152836 states and 565076 transitions. [2019-12-18 14:07:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:07:35,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:35,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:35,334 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:35,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1184191968, now seen corresponding path program 1 times [2019-12-18 14:07:35,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:35,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076632196] [2019-12-18 14:07:35,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:35,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076632196] [2019-12-18 14:07:35,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:35,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:07:35,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553841404] [2019-12-18 14:07:35,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:07:35,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:35,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:07:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:07:35,426 INFO L87 Difference]: Start difference. First operand 152836 states and 565076 transitions. Second operand 4 states. [2019-12-18 14:07:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:38,178 INFO L93 Difference]: Finished difference Result 198503 states and 719540 transitions. [2019-12-18 14:07:38,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:07:38,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:07:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:38,824 INFO L225 Difference]: With dead ends: 198503 [2019-12-18 14:07:38,824 INFO L226 Difference]: Without dead ends: 198503 [2019-12-18 14:07:38,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198503 states. [2019-12-18 14:07:54,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198503 to 184484. [2019-12-18 14:07:54,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184484 states. [2019-12-18 14:07:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184484 states to 184484 states and 671271 transitions. [2019-12-18 14:07:54,642 INFO L78 Accepts]: Start accepts. Automaton has 184484 states and 671271 transitions. Word has length 11 [2019-12-18 14:07:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:07:54,642 INFO L462 AbstractCegarLoop]: Abstraction has 184484 states and 671271 transitions. [2019-12-18 14:07:54,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:07:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 184484 states and 671271 transitions. [2019-12-18 14:07:54,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:07:54,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:07:54,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:07:54,649 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:07:54,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:07:54,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1389779890, now seen corresponding path program 1 times [2019-12-18 14:07:54,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:07:54,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437850539] [2019-12-18 14:07:54,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:07:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:07:54,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:07:54,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437850539] [2019-12-18 14:07:54,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:07:54,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:07:54,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881825533] [2019-12-18 14:07:54,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:07:54,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:07:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:07:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:07:54,731 INFO L87 Difference]: Start difference. First operand 184484 states and 671271 transitions. Second operand 5 states. [2019-12-18 14:07:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:07:57,634 INFO L93 Difference]: Finished difference Result 244942 states and 875227 transitions. [2019-12-18 14:07:57,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:07:57,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 14:07:57,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:07:58,448 INFO L225 Difference]: With dead ends: 244942 [2019-12-18 14:07:58,448 INFO L226 Difference]: Without dead ends: 244942 [2019-12-18 14:07:58,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244942 states. [2019-12-18 14:08:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244942 to 183475. [2019-12-18 14:08:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183475 states. [2019-12-18 14:08:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183475 states to 183475 states and 667588 transitions. [2019-12-18 14:08:16,654 INFO L78 Accepts]: Start accepts. Automaton has 183475 states and 667588 transitions. Word has length 17 [2019-12-18 14:08:16,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:16,655 INFO L462 AbstractCegarLoop]: Abstraction has 183475 states and 667588 transitions. [2019-12-18 14:08:16,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 183475 states and 667588 transitions. [2019-12-18 14:08:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:08:16,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:16,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:16,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:16,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1044109860, now seen corresponding path program 1 times [2019-12-18 14:08:16,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:16,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019598532] [2019-12-18 14:08:16,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:16,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019598532] [2019-12-18 14:08:16,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:16,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:16,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166359349] [2019-12-18 14:08:16,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:16,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:16,843 INFO L87 Difference]: Start difference. First operand 183475 states and 667588 transitions. Second operand 5 states. [2019-12-18 14:08:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:23,355 INFO L93 Difference]: Finished difference Result 255390 states and 912359 transitions. [2019-12-18 14:08:23,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:23,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-18 14:08:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:23,982 INFO L225 Difference]: With dead ends: 255390 [2019-12-18 14:08:23,982 INFO L226 Difference]: Without dead ends: 255390 [2019-12-18 14:08:23,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 14:08:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255390 states. [2019-12-18 14:08:38,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255390 to 240862. [2019-12-18 14:08:38,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240862 states. [2019-12-18 14:08:40,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240862 states to 240862 states and 862677 transitions. [2019-12-18 14:08:40,247 INFO L78 Accepts]: Start accepts. Automaton has 240862 states and 862677 transitions. Word has length 25 [2019-12-18 14:08:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:40,249 INFO L462 AbstractCegarLoop]: Abstraction has 240862 states and 862677 transitions. [2019-12-18 14:08:40,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 240862 states and 862677 transitions. [2019-12-18 14:08:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:08:40,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:40,273 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:40,274 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1942527613, now seen corresponding path program 1 times [2019-12-18 14:08:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:40,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401027495] [2019-12-18 14:08:40,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:40,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401027495] [2019-12-18 14:08:40,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:40,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:08:40,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471646310] [2019-12-18 14:08:40,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:08:40,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:08:40,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:08:40,354 INFO L87 Difference]: Start difference. First operand 240862 states and 862677 transitions. Second operand 4 states. [2019-12-18 14:08:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:40,433 INFO L93 Difference]: Finished difference Result 14741 states and 40177 transitions. [2019-12-18 14:08:40,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:08:40,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:08:40,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:40,447 INFO L225 Difference]: With dead ends: 14741 [2019-12-18 14:08:40,447 INFO L226 Difference]: Without dead ends: 10693 [2019-12-18 14:08:40,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2019-12-18 14:08:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10653. [2019-12-18 14:08:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10653 states. [2019-12-18 14:08:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10653 states to 10653 states and 26288 transitions. [2019-12-18 14:08:40,605 INFO L78 Accepts]: Start accepts. Automaton has 10653 states and 26288 transitions. Word has length 25 [2019-12-18 14:08:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:40,605 INFO L462 AbstractCegarLoop]: Abstraction has 10653 states and 26288 transitions. [2019-12-18 14:08:40,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:08:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10653 states and 26288 transitions. [2019-12-18 14:08:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 14:08:40,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:40,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:40,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:40,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:40,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1864535946, now seen corresponding path program 1 times [2019-12-18 14:08:40,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:40,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511018666] [2019-12-18 14:08:40,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:40,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511018666] [2019-12-18 14:08:40,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:40,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:40,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002139213] [2019-12-18 14:08:40,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:40,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:40,720 INFO L87 Difference]: Start difference. First operand 10653 states and 26288 transitions. Second operand 6 states. [2019-12-18 14:08:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:41,691 INFO L93 Difference]: Finished difference Result 11962 states and 29091 transitions. [2019-12-18 14:08:41,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:08:41,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-18 14:08:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:41,706 INFO L225 Difference]: With dead ends: 11962 [2019-12-18 14:08:41,706 INFO L226 Difference]: Without dead ends: 11914 [2019-12-18 14:08:41,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11914 states. [2019-12-18 14:08:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11914 to 11586. [2019-12-18 14:08:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11586 states. [2019-12-18 14:08:41,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11586 states to 11586 states and 28348 transitions. [2019-12-18 14:08:41,841 INFO L78 Accepts]: Start accepts. Automaton has 11586 states and 28348 transitions. Word has length 38 [2019-12-18 14:08:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:41,842 INFO L462 AbstractCegarLoop]: Abstraction has 11586 states and 28348 transitions. [2019-12-18 14:08:41,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:41,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11586 states and 28348 transitions. [2019-12-18 14:08:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 14:08:41,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:41,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:41,849 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -555471960, now seen corresponding path program 1 times [2019-12-18 14:08:41,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:41,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556676201] [2019-12-18 14:08:41,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:41,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556676201] [2019-12-18 14:08:41,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:41,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:41,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376400340] [2019-12-18 14:08:41,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:41,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:41,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:41,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:41,955 INFO L87 Difference]: Start difference. First operand 11586 states and 28348 transitions. Second operand 7 states. [2019-12-18 14:08:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:43,245 INFO L93 Difference]: Finished difference Result 13314 states and 32232 transitions. [2019-12-18 14:08:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:08:43,246 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 14:08:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:43,262 INFO L225 Difference]: With dead ends: 13314 [2019-12-18 14:08:43,263 INFO L226 Difference]: Without dead ends: 13314 [2019-12-18 14:08:43,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:08:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2019-12-18 14:08:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 11791. [2019-12-18 14:08:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11791 states. [2019-12-18 14:08:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11791 states to 11791 states and 28782 transitions. [2019-12-18 14:08:43,412 INFO L78 Accepts]: Start accepts. Automaton has 11791 states and 28782 transitions. Word has length 50 [2019-12-18 14:08:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:43,413 INFO L462 AbstractCegarLoop]: Abstraction has 11791 states and 28782 transitions. [2019-12-18 14:08:43,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11791 states and 28782 transitions. [2019-12-18 14:08:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 14:08:43,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:43,422 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:43,422 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:43,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:43,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1176117867, now seen corresponding path program 1 times [2019-12-18 14:08:43,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:43,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258334285] [2019-12-18 14:08:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:43,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258334285] [2019-12-18 14:08:43,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:43,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:43,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8244686] [2019-12-18 14:08:43,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:43,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:43,520 INFO L87 Difference]: Start difference. First operand 11791 states and 28782 transitions. Second operand 5 states. [2019-12-18 14:08:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:44,455 INFO L93 Difference]: Finished difference Result 13152 states and 31669 transitions. [2019-12-18 14:08:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:44,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-18 14:08:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:44,473 INFO L225 Difference]: With dead ends: 13152 [2019-12-18 14:08:44,473 INFO L226 Difference]: Without dead ends: 13152 [2019-12-18 14:08:44,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13152 states. [2019-12-18 14:08:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13152 to 12781. [2019-12-18 14:08:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12781 states. [2019-12-18 14:08:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12781 states to 12781 states and 30933 transitions. [2019-12-18 14:08:45,778 INFO L78 Accepts]: Start accepts. Automaton has 12781 states and 30933 transitions. Word has length 57 [2019-12-18 14:08:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:45,779 INFO L462 AbstractCegarLoop]: Abstraction has 12781 states and 30933 transitions. [2019-12-18 14:08:45,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 12781 states and 30933 transitions. [2019-12-18 14:08:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 14:08:45,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:45,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:45,797 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:45,797 INFO L82 PathProgramCache]: Analyzing trace with hash -313859631, now seen corresponding path program 1 times [2019-12-18 14:08:45,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:45,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798025308] [2019-12-18 14:08:45,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:45,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798025308] [2019-12-18 14:08:45,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:45,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:08:45,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83901848] [2019-12-18 14:08:45,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:45,943 INFO L87 Difference]: Start difference. First operand 12781 states and 30933 transitions. Second operand 5 states. [2019-12-18 14:08:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:45,999 INFO L93 Difference]: Finished difference Result 5405 states and 12587 transitions. [2019-12-18 14:08:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:08:46,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-18 14:08:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:46,007 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 14:08:46,008 INFO L226 Difference]: Without dead ends: 5151 [2019-12-18 14:08:46,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-12-18 14:08:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 4998. [2019-12-18 14:08:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4998 states. [2019-12-18 14:08:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4998 states to 4998 states and 11757 transitions. [2019-12-18 14:08:46,101 INFO L78 Accepts]: Start accepts. Automaton has 4998 states and 11757 transitions. Word has length 58 [2019-12-18 14:08:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:46,102 INFO L462 AbstractCegarLoop]: Abstraction has 4998 states and 11757 transitions. [2019-12-18 14:08:46,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4998 states and 11757 transitions. [2019-12-18 14:08:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:46,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:46,111 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:46,112 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:46,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:46,112 INFO L82 PathProgramCache]: Analyzing trace with hash 608253419, now seen corresponding path program 1 times [2019-12-18 14:08:46,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:46,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057964406] [2019-12-18 14:08:46,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:46,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057964406] [2019-12-18 14:08:46,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:46,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:46,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870639992] [2019-12-18 14:08:46,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:46,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:46,264 INFO L87 Difference]: Start difference. First operand 4998 states and 11757 transitions. Second operand 6 states. [2019-12-18 14:08:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:47,066 INFO L93 Difference]: Finished difference Result 6626 states and 15449 transitions. [2019-12-18 14:08:47,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:08:47,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-18 14:08:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:47,075 INFO L225 Difference]: With dead ends: 6626 [2019-12-18 14:08:47,076 INFO L226 Difference]: Without dead ends: 6626 [2019-12-18 14:08:47,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-12-18 14:08:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6177. [2019-12-18 14:08:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6177 states. [2019-12-18 14:08:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6177 states to 6177 states and 14495 transitions. [2019-12-18 14:08:47,188 INFO L78 Accepts]: Start accepts. Automaton has 6177 states and 14495 transitions. Word has length 94 [2019-12-18 14:08:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:47,189 INFO L462 AbstractCegarLoop]: Abstraction has 6177 states and 14495 transitions. [2019-12-18 14:08:47,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6177 states and 14495 transitions. [2019-12-18 14:08:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:47,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:47,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:47,203 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash 577720363, now seen corresponding path program 2 times [2019-12-18 14:08:47,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:47,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924349871] [2019-12-18 14:08:47,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:47,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924349871] [2019-12-18 14:08:47,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:47,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:08:47,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325364182] [2019-12-18 14:08:47,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:08:47,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:47,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:08:47,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:08:47,343 INFO L87 Difference]: Start difference. First operand 6177 states and 14495 transitions. Second operand 7 states. [2019-12-18 14:08:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:48,499 INFO L93 Difference]: Finished difference Result 7484 states and 17393 transitions. [2019-12-18 14:08:48,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:08:48,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-18 14:08:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:48,513 INFO L225 Difference]: With dead ends: 7484 [2019-12-18 14:08:48,513 INFO L226 Difference]: Without dead ends: 7484 [2019-12-18 14:08:48,514 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 14:08:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2019-12-18 14:08:48,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 6666. [2019-12-18 14:08:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6666 states. [2019-12-18 14:08:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6666 states to 6666 states and 15594 transitions. [2019-12-18 14:08:48,667 INFO L78 Accepts]: Start accepts. Automaton has 6666 states and 15594 transitions. Word has length 94 [2019-12-18 14:08:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:48,668 INFO L462 AbstractCegarLoop]: Abstraction has 6666 states and 15594 transitions. [2019-12-18 14:08:48,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:08:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6666 states and 15594 transitions. [2019-12-18 14:08:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:48,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:48,683 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:48,684 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:48,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:48,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1726596845, now seen corresponding path program 3 times [2019-12-18 14:08:48,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:48,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606279897] [2019-12-18 14:08:48,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:48,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606279897] [2019-12-18 14:08:48,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:48,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:08:48,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723141970] [2019-12-18 14:08:48,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:08:48,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:48,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:08:48,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:08:48,835 INFO L87 Difference]: Start difference. First operand 6666 states and 15594 transitions. Second operand 5 states. [2019-12-18 14:08:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:49,406 INFO L93 Difference]: Finished difference Result 7181 states and 16661 transitions. [2019-12-18 14:08:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:08:49,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-18 14:08:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:49,418 INFO L225 Difference]: With dead ends: 7181 [2019-12-18 14:08:49,418 INFO L226 Difference]: Without dead ends: 7181 [2019-12-18 14:08:49,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7181 states. [2019-12-18 14:08:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7181 to 6807. [2019-12-18 14:08:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6807 states. [2019-12-18 14:08:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6807 states to 6807 states and 15915 transitions. [2019-12-18 14:08:49,506 INFO L78 Accepts]: Start accepts. Automaton has 6807 states and 15915 transitions. Word has length 94 [2019-12-18 14:08:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:49,506 INFO L462 AbstractCegarLoop]: Abstraction has 6807 states and 15915 transitions. [2019-12-18 14:08:49,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:08:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6807 states and 15915 transitions. [2019-12-18 14:08:49,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-18 14:08:49,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:49,516 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:49,516 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:49,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:49,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2017255555, now seen corresponding path program 4 times [2019-12-18 14:08:49,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:49,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437042285] [2019-12-18 14:08:49,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:49,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437042285] [2019-12-18 14:08:49,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:49,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:49,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807558134] [2019-12-18 14:08:49,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:49,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:49,594 INFO L87 Difference]: Start difference. First operand 6807 states and 15915 transitions. Second operand 3 states. [2019-12-18 14:08:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:49,649 INFO L93 Difference]: Finished difference Result 6807 states and 15914 transitions. [2019-12-18 14:08:49,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:49,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-18 14:08:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:49,658 INFO L225 Difference]: With dead ends: 6807 [2019-12-18 14:08:49,659 INFO L226 Difference]: Without dead ends: 6807 [2019-12-18 14:08:49,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states. [2019-12-18 14:08:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 6683. [2019-12-18 14:08:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6683 states. [2019-12-18 14:08:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6683 states to 6683 states and 15685 transitions. [2019-12-18 14:08:51,110 INFO L78 Accepts]: Start accepts. Automaton has 6683 states and 15685 transitions. Word has length 94 [2019-12-18 14:08:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:51,110 INFO L462 AbstractCegarLoop]: Abstraction has 6683 states and 15685 transitions. [2019-12-18 14:08:51,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:51,110 INFO L276 IsEmpty]: Start isEmpty. Operand 6683 states and 15685 transitions. [2019-12-18 14:08:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 14:08:51,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:51,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:51,120 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash -524016775, now seen corresponding path program 1 times [2019-12-18 14:08:51,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:51,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632522743] [2019-12-18 14:08:51,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:51,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632522743] [2019-12-18 14:08:51,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:51,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:08:51,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108489427] [2019-12-18 14:08:51,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:08:51,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:51,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:08:51,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:51,212 INFO L87 Difference]: Start difference. First operand 6683 states and 15685 transitions. Second operand 3 states. [2019-12-18 14:08:51,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:51,277 INFO L93 Difference]: Finished difference Result 5572 states and 13115 transitions. [2019-12-18 14:08:51,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:08:51,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 14:08:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:51,285 INFO L225 Difference]: With dead ends: 5572 [2019-12-18 14:08:51,285 INFO L226 Difference]: Without dead ends: 5572 [2019-12-18 14:08:51,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:08:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2019-12-18 14:08:51,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5560. [2019-12-18 14:08:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5560 states. [2019-12-18 14:08:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5560 states to 5560 states and 13093 transitions. [2019-12-18 14:08:51,375 INFO L78 Accepts]: Start accepts. Automaton has 5560 states and 13093 transitions. Word has length 95 [2019-12-18 14:08:51,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:51,375 INFO L462 AbstractCegarLoop]: Abstraction has 5560 states and 13093 transitions. [2019-12-18 14:08:51,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:08:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5560 states and 13093 transitions. [2019-12-18 14:08:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:51,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:51,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:51,383 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2024800108, now seen corresponding path program 1 times [2019-12-18 14:08:51,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:51,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958933152] [2019-12-18 14:08:51,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:51,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958933152] [2019-12-18 14:08:51,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:51,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:08:51,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244903582] [2019-12-18 14:08:51,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:08:51,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:08:51,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:08:51,483 INFO L87 Difference]: Start difference. First operand 5560 states and 13093 transitions. Second operand 6 states. [2019-12-18 14:08:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:52,139 INFO L93 Difference]: Finished difference Result 5949 states and 13857 transitions. [2019-12-18 14:08:52,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:08:52,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-18 14:08:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:52,147 INFO L225 Difference]: With dead ends: 5949 [2019-12-18 14:08:52,147 INFO L226 Difference]: Without dead ends: 5949 [2019-12-18 14:08:52,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:08:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2019-12-18 14:08:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 5566. [2019-12-18 14:08:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5566 states. [2019-12-18 14:08:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5566 states to 5566 states and 13104 transitions. [2019-12-18 14:08:52,247 INFO L78 Accepts]: Start accepts. Automaton has 5566 states and 13104 transitions. Word has length 96 [2019-12-18 14:08:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:52,248 INFO L462 AbstractCegarLoop]: Abstraction has 5566 states and 13104 transitions. [2019-12-18 14:08:52,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:08:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5566 states and 13104 transitions. [2019-12-18 14:08:52,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:52,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:52,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:52,258 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:52,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1261239740, now seen corresponding path program 2 times [2019-12-18 14:08:52,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:52,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330840568] [2019-12-18 14:08:52,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:52,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330840568] [2019-12-18 14:08:52,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:52,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:52,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043741945] [2019-12-18 14:08:52,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:52,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:52,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:52,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:52,483 INFO L87 Difference]: Start difference. First operand 5566 states and 13104 transitions. Second operand 10 states. [2019-12-18 14:08:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:53,509 INFO L93 Difference]: Finished difference Result 13459 states and 30809 transitions. [2019-12-18 14:08:53,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:08:53,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:53,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:53,526 INFO L225 Difference]: With dead ends: 13459 [2019-12-18 14:08:53,527 INFO L226 Difference]: Without dead ends: 11838 [2019-12-18 14:08:53,528 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 14:08:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11838 states. [2019-12-18 14:08:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11838 to 7232. [2019-12-18 14:08:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7232 states. [2019-12-18 14:08:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7232 states to 7232 states and 17377 transitions. [2019-12-18 14:08:53,658 INFO L78 Accepts]: Start accepts. Automaton has 7232 states and 17377 transitions. Word has length 96 [2019-12-18 14:08:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:53,659 INFO L462 AbstractCegarLoop]: Abstraction has 7232 states and 17377 transitions. [2019-12-18 14:08:53,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7232 states and 17377 transitions. [2019-12-18 14:08:53,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:53,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:53,666 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:53,666 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:53,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:53,667 INFO L82 PathProgramCache]: Analyzing trace with hash -382325470, now seen corresponding path program 3 times [2019-12-18 14:08:53,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:53,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509527657] [2019-12-18 14:08:53,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:53,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509527657] [2019-12-18 14:08:53,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:53,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:08:53,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237883246] [2019-12-18 14:08:53,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:08:53,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:08:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:08:53,847 INFO L87 Difference]: Start difference. First operand 7232 states and 17377 transitions. Second operand 11 states. [2019-12-18 14:08:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:54,932 INFO L93 Difference]: Finished difference Result 15051 states and 36411 transitions. [2019-12-18 14:08:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:08:54,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:08:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:54,950 INFO L225 Difference]: With dead ends: 15051 [2019-12-18 14:08:54,950 INFO L226 Difference]: Without dead ends: 14281 [2019-12-18 14:08:54,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:08:54,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14281 states. [2019-12-18 14:08:55,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14281 to 12258. [2019-12-18 14:08:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12258 states. [2019-12-18 14:08:55,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12258 states to 12258 states and 30221 transitions. [2019-12-18 14:08:55,160 INFO L78 Accepts]: Start accepts. Automaton has 12258 states and 30221 transitions. Word has length 96 [2019-12-18 14:08:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:55,160 INFO L462 AbstractCegarLoop]: Abstraction has 12258 states and 30221 transitions. [2019-12-18 14:08:55,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:08:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 12258 states and 30221 transitions. [2019-12-18 14:08:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:55,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:55,173 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:55,173 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:55,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1742227332, now seen corresponding path program 4 times [2019-12-18 14:08:55,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:55,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340844937] [2019-12-18 14:08:55,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:55,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340844937] [2019-12-18 14:08:55,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:55,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:55,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444347684] [2019-12-18 14:08:55,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:55,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:55,354 INFO L87 Difference]: Start difference. First operand 12258 states and 30221 transitions. Second operand 10 states. [2019-12-18 14:08:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:56,398 INFO L93 Difference]: Finished difference Result 19896 states and 47571 transitions. [2019-12-18 14:08:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:08:56,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:56,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:56,424 INFO L225 Difference]: With dead ends: 19896 [2019-12-18 14:08:56,424 INFO L226 Difference]: Without dead ends: 17616 [2019-12-18 14:08:56,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:08:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17616 states. [2019-12-18 14:08:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17616 to 11502. [2019-12-18 14:08:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-12-18 14:08:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 28300 transitions. [2019-12-18 14:08:56,657 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 28300 transitions. Word has length 96 [2019-12-18 14:08:56,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:56,657 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 28300 transitions. [2019-12-18 14:08:56,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 28300 transitions. [2019-12-18 14:08:56,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:56,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:56,673 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:56,673 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:56,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:56,673 INFO L82 PathProgramCache]: Analyzing trace with hash 633350286, now seen corresponding path program 5 times [2019-12-18 14:08:56,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:56,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728773288] [2019-12-18 14:08:56,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:56,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728773288] [2019-12-18 14:08:56,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:56,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:56,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190184189] [2019-12-18 14:08:56,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:08:56,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:56,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:08:56,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:08:56,793 INFO L87 Difference]: Start difference. First operand 11502 states and 28300 transitions. Second operand 9 states. [2019-12-18 14:08:58,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:58,326 INFO L93 Difference]: Finished difference Result 17341 states and 42373 transitions. [2019-12-18 14:08:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:08:58,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:08:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:58,346 INFO L225 Difference]: With dead ends: 17341 [2019-12-18 14:08:58,346 INFO L226 Difference]: Without dead ends: 17341 [2019-12-18 14:08:58,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:08:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17341 states. [2019-12-18 14:08:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17341 to 14843. [2019-12-18 14:08:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14843 states. [2019-12-18 14:08:58,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14843 states to 14843 states and 36670 transitions. [2019-12-18 14:08:58,541 INFO L78 Accepts]: Start accepts. Automaton has 14843 states and 36670 transitions. Word has length 96 [2019-12-18 14:08:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:58,542 INFO L462 AbstractCegarLoop]: Abstraction has 14843 states and 36670 transitions. [2019-12-18 14:08:58,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:08:58,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14843 states and 36670 transitions. [2019-12-18 14:08:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:58,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:58,560 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:58,560 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash 798116452, now seen corresponding path program 6 times [2019-12-18 14:08:58,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:58,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768677003] [2019-12-18 14:08:58,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:08:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:08:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:08:58,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768677003] [2019-12-18 14:08:58,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:08:58,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:08:58,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592096987] [2019-12-18 14:08:58,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:08:58,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:08:58,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:08:58,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:08:58,734 INFO L87 Difference]: Start difference. First operand 14843 states and 36670 transitions. Second operand 10 states. [2019-12-18 14:08:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:08:59,680 INFO L93 Difference]: Finished difference Result 23399 states and 56904 transitions. [2019-12-18 14:08:59,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:08:59,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:08:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:08:59,706 INFO L225 Difference]: With dead ends: 23399 [2019-12-18 14:08:59,707 INFO L226 Difference]: Without dead ends: 22268 [2019-12-18 14:08:59,707 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 14:08:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22268 states. [2019-12-18 14:08:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22268 to 17332. [2019-12-18 14:08:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17332 states. [2019-12-18 14:08:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17332 states to 17332 states and 43399 transitions. [2019-12-18 14:08:59,953 INFO L78 Accepts]: Start accepts. Automaton has 17332 states and 43399 transitions. Word has length 96 [2019-12-18 14:08:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:08:59,953 INFO L462 AbstractCegarLoop]: Abstraction has 17332 states and 43399 transitions. [2019-12-18 14:08:59,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:08:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 17332 states and 43399 transitions. [2019-12-18 14:08:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:08:59,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:08:59,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:08:59,977 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:08:59,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:08:59,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1061893144, now seen corresponding path program 7 times [2019-12-18 14:08:59,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:08:59,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047371369] [2019-12-18 14:08:59,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:00,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047371369] [2019-12-18 14:09:00,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:00,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:09:00,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53751201] [2019-12-18 14:09:00,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:09:00,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:00,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:09:00,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:00,271 INFO L87 Difference]: Start difference. First operand 17332 states and 43399 transitions. Second operand 14 states. [2019-12-18 14:09:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:01,422 INFO L93 Difference]: Finished difference Result 22621 states and 55966 transitions. [2019-12-18 14:09:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:09:01,423 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 96 [2019-12-18 14:09:01,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:01,449 INFO L225 Difference]: With dead ends: 22621 [2019-12-18 14:09:01,449 INFO L226 Difference]: Without dead ends: 22591 [2019-12-18 14:09:01,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2019-12-18 14:09:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22591 states. [2019-12-18 14:09:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22591 to 19847. [2019-12-18 14:09:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19847 states. [2019-12-18 14:09:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19847 states to 19847 states and 49865 transitions. [2019-12-18 14:09:01,710 INFO L78 Accepts]: Start accepts. Automaton has 19847 states and 49865 transitions. Word has length 96 [2019-12-18 14:09:01,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:01,710 INFO L462 AbstractCegarLoop]: Abstraction has 19847 states and 49865 transitions. [2019-12-18 14:09:01,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:09:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19847 states and 49865 transitions. [2019-12-18 14:09:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:01,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:01,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:01,729 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1165421684, now seen corresponding path program 8 times [2019-12-18 14:09:01,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:01,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537581079] [2019-12-18 14:09:01,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:02,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537581079] [2019-12-18 14:09:02,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:02,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:02,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244228945] [2019-12-18 14:09:02,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:02,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:02,048 INFO L87 Difference]: Start difference. First operand 19847 states and 49865 transitions. Second operand 10 states. [2019-12-18 14:09:03,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:03,066 INFO L93 Difference]: Finished difference Result 29894 states and 73043 transitions. [2019-12-18 14:09:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:09:03,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:03,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:03,102 INFO L225 Difference]: With dead ends: 29894 [2019-12-18 14:09:03,102 INFO L226 Difference]: Without dead ends: 29137 [2019-12-18 14:09:03,102 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 14:09:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29137 states. [2019-12-18 14:09:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29137 to 19895. [2019-12-18 14:09:03,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19895 states. [2019-12-18 14:09:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19895 states to 19895 states and 49942 transitions. [2019-12-18 14:09:03,402 INFO L78 Accepts]: Start accepts. Automaton has 19895 states and 49942 transitions. Word has length 96 [2019-12-18 14:09:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:03,403 INFO L462 AbstractCegarLoop]: Abstraction has 19895 states and 49942 transitions. [2019-12-18 14:09:03,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 19895 states and 49942 transitions. [2019-12-18 14:09:03,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:03,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:03,423 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:03,423 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:03,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:03,423 INFO L82 PathProgramCache]: Analyzing trace with hash 353580028, now seen corresponding path program 9 times [2019-12-18 14:09:03,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:03,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526996467] [2019-12-18 14:09:03,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:03,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:03,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526996467] [2019-12-18 14:09:03,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:03,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:09:03,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8243573] [2019-12-18 14:09:03,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:03,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:03,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:03,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:03,536 INFO L87 Difference]: Start difference. First operand 19895 states and 49942 transitions. Second operand 7 states. [2019-12-18 14:09:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:03,797 INFO L93 Difference]: Finished difference Result 22660 states and 56091 transitions. [2019-12-18 14:09:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:09:03,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-12-18 14:09:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:03,825 INFO L225 Difference]: With dead ends: 22660 [2019-12-18 14:09:03,825 INFO L226 Difference]: Without dead ends: 21429 [2019-12-18 14:09:03,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-18 14:09:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20032. [2019-12-18 14:09:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20032 states. [2019-12-18 14:09:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20032 states to 20032 states and 50273 transitions. [2019-12-18 14:09:04,068 INFO L78 Accepts]: Start accepts. Automaton has 20032 states and 50273 transitions. Word has length 96 [2019-12-18 14:09:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:04,069 INFO L462 AbstractCegarLoop]: Abstraction has 20032 states and 50273 transitions. [2019-12-18 14:09:04,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 20032 states and 50273 transitions. [2019-12-18 14:09:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:04,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:04,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:04,089 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:04,089 INFO L82 PathProgramCache]: Analyzing trace with hash 277516946, now seen corresponding path program 10 times [2019-12-18 14:09:04,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:04,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66533209] [2019-12-18 14:09:04,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:04,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66533209] [2019-12-18 14:09:04,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:04,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:04,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612441833] [2019-12-18 14:09:04,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:04,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:04,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:04,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:04,230 INFO L87 Difference]: Start difference. First operand 20032 states and 50273 transitions. Second operand 10 states. [2019-12-18 14:09:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:04,837 INFO L93 Difference]: Finished difference Result 30457 states and 76444 transitions. [2019-12-18 14:09:04,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:09:04,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:04,872 INFO L225 Difference]: With dead ends: 30457 [2019-12-18 14:09:04,872 INFO L226 Difference]: Without dead ends: 29964 [2019-12-18 14:09:04,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:09:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29964 states. [2019-12-18 14:09:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29964 to 22189. [2019-12-18 14:09:05,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22189 states. [2019-12-18 14:09:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22189 states to 22189 states and 56004 transitions. [2019-12-18 14:09:05,177 INFO L78 Accepts]: Start accepts. Automaton has 22189 states and 56004 transitions. Word has length 96 [2019-12-18 14:09:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:05,177 INFO L462 AbstractCegarLoop]: Abstraction has 22189 states and 56004 transitions. [2019-12-18 14:09:05,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22189 states and 56004 transitions. [2019-12-18 14:09:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:05,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:05,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:05,201 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash -202074464, now seen corresponding path program 11 times [2019-12-18 14:09:05,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:05,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792401975] [2019-12-18 14:09:05,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792401975] [2019-12-18 14:09:05,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:05,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-18 14:09:05,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489882031] [2019-12-18 14:09:05,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 14:09:05,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:05,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 14:09:05,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:09:05,589 INFO L87 Difference]: Start difference. First operand 22189 states and 56004 transitions. Second operand 19 states. [2019-12-18 14:09:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:09,974 INFO L93 Difference]: Finished difference Result 45595 states and 113261 transitions. [2019-12-18 14:09:09,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:09:09,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 96 [2019-12-18 14:09:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:10,016 INFO L225 Difference]: With dead ends: 45595 [2019-12-18 14:09:10,016 INFO L226 Difference]: Without dead ends: 35788 [2019-12-18 14:09:10,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=315, Invalid=2037, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:09:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35788 states. [2019-12-18 14:09:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35788 to 27120. [2019-12-18 14:09:10,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27120 states. [2019-12-18 14:09:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27120 states to 27120 states and 68749 transitions. [2019-12-18 14:09:10,372 INFO L78 Accepts]: Start accepts. Automaton has 27120 states and 68749 transitions. Word has length 96 [2019-12-18 14:09:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:10,372 INFO L462 AbstractCegarLoop]: Abstraction has 27120 states and 68749 transitions. [2019-12-18 14:09:10,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 14:09:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27120 states and 68749 transitions. [2019-12-18 14:09:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:10,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:10,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:10,400 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:10,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:10,400 INFO L82 PathProgramCache]: Analyzing trace with hash -965764708, now seen corresponding path program 12 times [2019-12-18 14:09:10,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:10,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031231610] [2019-12-18 14:09:10,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:10,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031231610] [2019-12-18 14:09:10,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:10,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:10,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054581513] [2019-12-18 14:09:10,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:09:10,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:09:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:09:10,528 INFO L87 Difference]: Start difference. First operand 27120 states and 68749 transitions. Second operand 9 states. [2019-12-18 14:09:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:11,257 INFO L93 Difference]: Finished difference Result 42437 states and 108000 transitions. [2019-12-18 14:09:11,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:09:11,257 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-18 14:09:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:11,337 INFO L225 Difference]: With dead ends: 42437 [2019-12-18 14:09:11,337 INFO L226 Difference]: Without dead ends: 41481 [2019-12-18 14:09:11,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:09:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41481 states. [2019-12-18 14:09:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41481 to 37075. [2019-12-18 14:09:11,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37075 states. [2019-12-18 14:09:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37075 states to 37075 states and 95873 transitions. [2019-12-18 14:09:12,004 INFO L78 Accepts]: Start accepts. Automaton has 37075 states and 95873 transitions. Word has length 96 [2019-12-18 14:09:12,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:12,004 INFO L462 AbstractCegarLoop]: Abstraction has 37075 states and 95873 transitions. [2019-12-18 14:09:12,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:09:12,004 INFO L276 IsEmpty]: Start isEmpty. Operand 37075 states and 95873 transitions. [2019-12-18 14:09:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:12,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:12,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:12,041 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash -952141892, now seen corresponding path program 13 times [2019-12-18 14:09:12,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:12,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700863661] [2019-12-18 14:09:12,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:12,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700863661] [2019-12-18 14:09:12,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:12,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:12,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121794040] [2019-12-18 14:09:12,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:12,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:12,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:12,205 INFO L87 Difference]: Start difference. First operand 37075 states and 95873 transitions. Second operand 10 states. [2019-12-18 14:09:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:13,187 INFO L93 Difference]: Finished difference Result 48443 states and 122409 transitions. [2019-12-18 14:09:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:09:13,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:13,255 INFO L225 Difference]: With dead ends: 48443 [2019-12-18 14:09:13,255 INFO L226 Difference]: Without dead ends: 47831 [2019-12-18 14:09:13,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2019-12-18 14:09:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47831 states. [2019-12-18 14:09:13,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47831 to 34054. [2019-12-18 14:09:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34054 states. [2019-12-18 14:09:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34054 states to 34054 states and 87332 transitions. [2019-12-18 14:09:13,756 INFO L78 Accepts]: Start accepts. Automaton has 34054 states and 87332 transitions. Word has length 96 [2019-12-18 14:09:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:13,756 INFO L462 AbstractCegarLoop]: Abstraction has 34054 states and 87332 transitions. [2019-12-18 14:09:13,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 34054 states and 87332 transitions. [2019-12-18 14:09:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:13,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:13,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:13,789 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1214243056, now seen corresponding path program 14 times [2019-12-18 14:09:13,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525501499] [2019-12-18 14:09:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:14,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:14,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525501499] [2019-12-18 14:09:14,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:14,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:09:14,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106735530] [2019-12-18 14:09:14,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:09:14,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:14,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:09:14,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:09:14,221 INFO L87 Difference]: Start difference. First operand 34054 states and 87332 transitions. Second operand 13 states. [2019-12-18 14:09:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:16,202 INFO L93 Difference]: Finished difference Result 51113 states and 129335 transitions. [2019-12-18 14:09:16,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:09:16,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-18 14:09:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:16,265 INFO L225 Difference]: With dead ends: 51113 [2019-12-18 14:09:16,265 INFO L226 Difference]: Without dead ends: 50436 [2019-12-18 14:09:16,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:09:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50436 states. [2019-12-18 14:09:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50436 to 35928. [2019-12-18 14:09:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35928 states. [2019-12-18 14:09:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35928 states to 35928 states and 92473 transitions. [2019-12-18 14:09:16,795 INFO L78 Accepts]: Start accepts. Automaton has 35928 states and 92473 transitions. Word has length 96 [2019-12-18 14:09:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:16,795 INFO L462 AbstractCegarLoop]: Abstraction has 35928 states and 92473 transitions. [2019-12-18 14:09:16,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:09:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35928 states and 92473 transitions. [2019-12-18 14:09:16,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:16,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:16,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:16,830 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:16,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:16,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1451944912, now seen corresponding path program 15 times [2019-12-18 14:09:16,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:16,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309429706] [2019-12-18 14:09:16,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:16,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309429706] [2019-12-18 14:09:16,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:16,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:09:16,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526038519] [2019-12-18 14:09:16,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:09:16,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:09:16,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:09:16,898 INFO L87 Difference]: Start difference. First operand 35928 states and 92473 transitions. Second operand 4 states. [2019-12-18 14:09:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:17,499 INFO L93 Difference]: Finished difference Result 58086 states and 148192 transitions. [2019-12-18 14:09:17,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:09:17,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 14:09:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:17,568 INFO L225 Difference]: With dead ends: 58086 [2019-12-18 14:09:17,568 INFO L226 Difference]: Without dead ends: 58047 [2019-12-18 14:09:17,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:09:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58047 states. [2019-12-18 14:09:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58047 to 46312. [2019-12-18 14:09:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46312 states. [2019-12-18 14:09:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46312 states to 46312 states and 119877 transitions. [2019-12-18 14:09:18,192 INFO L78 Accepts]: Start accepts. Automaton has 46312 states and 119877 transitions. Word has length 96 [2019-12-18 14:09:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:18,193 INFO L462 AbstractCegarLoop]: Abstraction has 46312 states and 119877 transitions. [2019-12-18 14:09:18,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:09:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 46312 states and 119877 transitions. [2019-12-18 14:09:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:18,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:18,247 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:18,247 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash -942006980, now seen corresponding path program 16 times [2019-12-18 14:09:18,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:18,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105977096] [2019-12-18 14:09:18,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:18,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105977096] [2019-12-18 14:09:18,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:18,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:09:18,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81163709] [2019-12-18 14:09:18,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:09:18,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:18,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:09:18,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:18,772 INFO L87 Difference]: Start difference. First operand 46312 states and 119877 transitions. Second operand 16 states. [2019-12-18 14:09:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:22,975 INFO L93 Difference]: Finished difference Result 78441 states and 202302 transitions. [2019-12-18 14:09:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:09:22,975 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-18 14:09:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:23,074 INFO L225 Difference]: With dead ends: 78441 [2019-12-18 14:09:23,074 INFO L226 Difference]: Without dead ends: 73196 [2019-12-18 14:09:23,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 3 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=292, Invalid=2258, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 14:09:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73196 states. [2019-12-18 14:09:23,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73196 to 47791. [2019-12-18 14:09:23,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47791 states. [2019-12-18 14:09:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47791 states to 47791 states and 123814 transitions. [2019-12-18 14:09:23,850 INFO L78 Accepts]: Start accepts. Automaton has 47791 states and 123814 transitions. Word has length 96 [2019-12-18 14:09:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:23,850 INFO L462 AbstractCegarLoop]: Abstraction has 47791 states and 123814 transitions. [2019-12-18 14:09:23,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:09:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47791 states and 123814 transitions. [2019-12-18 14:09:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:24,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:24,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:24,206 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:24,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 627550158, now seen corresponding path program 17 times [2019-12-18 14:09:24,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:24,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754248943] [2019-12-18 14:09:24,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:24,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754248943] [2019-12-18 14:09:24,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:24,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:24,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909507164] [2019-12-18 14:09:24,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:09:24,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:24,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:09:24,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:24,319 INFO L87 Difference]: Start difference. First operand 47791 states and 123814 transitions. Second operand 8 states. [2019-12-18 14:09:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:24,730 INFO L93 Difference]: Finished difference Result 52417 states and 134522 transitions. [2019-12-18 14:09:24,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 14:09:24,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-18 14:09:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:24,798 INFO L225 Difference]: With dead ends: 52417 [2019-12-18 14:09:24,798 INFO L226 Difference]: Without dead ends: 51074 [2019-12-18 14:09:24,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:09:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51074 states. [2019-12-18 14:09:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51074 to 47824. [2019-12-18 14:09:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47824 states. [2019-12-18 14:09:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47824 states to 47824 states and 123891 transitions. [2019-12-18 14:09:25,446 INFO L78 Accepts]: Start accepts. Automaton has 47824 states and 123891 transitions. Word has length 96 [2019-12-18 14:09:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:25,446 INFO L462 AbstractCegarLoop]: Abstraction has 47824 states and 123891 transitions. [2019-12-18 14:09:25,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:09:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47824 states and 123891 transitions. [2019-12-18 14:09:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:25,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:25,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:25,506 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:25,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 249969050, now seen corresponding path program 18 times [2019-12-18 14:09:25,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:25,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140300873] [2019-12-18 14:09:25,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:25,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:25,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140300873] [2019-12-18 14:09:25,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:25,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:25,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287011886] [2019-12-18 14:09:25,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:25,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:25,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:25,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:25,637 INFO L87 Difference]: Start difference. First operand 47824 states and 123891 transitions. Second operand 11 states. [2019-12-18 14:09:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:26,391 INFO L93 Difference]: Finished difference Result 57859 states and 147721 transitions. [2019-12-18 14:09:26,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:09:26,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:09:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:26,706 INFO L225 Difference]: With dead ends: 57859 [2019-12-18 14:09:26,706 INFO L226 Difference]: Without dead ends: 56531 [2019-12-18 14:09:26,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:09:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56531 states. [2019-12-18 14:09:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56531 to 47741. [2019-12-18 14:09:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47741 states. [2019-12-18 14:09:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47741 states to 47741 states and 123638 transitions. [2019-12-18 14:09:27,301 INFO L78 Accepts]: Start accepts. Automaton has 47741 states and 123638 transitions. Word has length 96 [2019-12-18 14:09:27,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:27,301 INFO L462 AbstractCegarLoop]: Abstraction has 47741 states and 123638 transitions. [2019-12-18 14:09:27,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 47741 states and 123638 transitions. [2019-12-18 14:09:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:27,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:27,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:27,348 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:27,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -295095088, now seen corresponding path program 19 times [2019-12-18 14:09:27,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:27,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100676756] [2019-12-18 14:09:27,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:27,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100676756] [2019-12-18 14:09:27,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:27,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:09:27,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708111931] [2019-12-18 14:09:27,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:09:27,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:27,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:09:27,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:09:27,489 INFO L87 Difference]: Start difference. First operand 47741 states and 123638 transitions. Second operand 11 states. [2019-12-18 14:09:28,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:28,390 INFO L93 Difference]: Finished difference Result 64683 states and 166313 transitions. [2019-12-18 14:09:28,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:09:28,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 14:09:28,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:28,473 INFO L225 Difference]: With dead ends: 64683 [2019-12-18 14:09:28,473 INFO L226 Difference]: Without dead ends: 63960 [2019-12-18 14:09:28,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=672, Unknown=0, NotChecked=0, Total=812 [2019-12-18 14:09:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63960 states. [2019-12-18 14:09:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63960 to 42545. [2019-12-18 14:09:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42545 states. [2019-12-18 14:09:29,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42545 states to 42545 states and 109345 transitions. [2019-12-18 14:09:29,357 INFO L78 Accepts]: Start accepts. Automaton has 42545 states and 109345 transitions. Word has length 96 [2019-12-18 14:09:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:29,358 INFO L462 AbstractCegarLoop]: Abstraction has 42545 states and 109345 transitions. [2019-12-18 14:09:29,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:09:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 42545 states and 109345 transitions. [2019-12-18 14:09:29,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:29,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:29,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:29,399 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:29,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1394298756, now seen corresponding path program 20 times [2019-12-18 14:09:29,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:29,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760917222] [2019-12-18 14:09:29,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:29,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760917222] [2019-12-18 14:09:29,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:29,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:09:29,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589244147] [2019-12-18 14:09:29,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:09:29,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:09:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:09:29,473 INFO L87 Difference]: Start difference. First operand 42545 states and 109345 transitions. Second operand 4 states. [2019-12-18 14:09:29,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:29,876 INFO L93 Difference]: Finished difference Result 53766 states and 134659 transitions. [2019-12-18 14:09:29,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:09:29,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-18 14:09:29,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:29,944 INFO L225 Difference]: With dead ends: 53766 [2019-12-18 14:09:29,944 INFO L226 Difference]: Without dead ends: 53763 [2019-12-18 14:09:29,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:09:30,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53763 states. [2019-12-18 14:09:30,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53763 to 46110. [2019-12-18 14:09:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46110 states. [2019-12-18 14:09:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46110 states to 46110 states and 117121 transitions. [2019-12-18 14:09:30,551 INFO L78 Accepts]: Start accepts. Automaton has 46110 states and 117121 transitions. Word has length 96 [2019-12-18 14:09:30,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:30,551 INFO L462 AbstractCegarLoop]: Abstraction has 46110 states and 117121 transitions. [2019-12-18 14:09:30,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:09:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 46110 states and 117121 transitions. [2019-12-18 14:09:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:30,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:30,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:30,597 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:30,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1564975836, now seen corresponding path program 21 times [2019-12-18 14:09:30,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:30,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402904737] [2019-12-18 14:09:30,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:31,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402904737] [2019-12-18 14:09:31,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:31,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:31,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756497706] [2019-12-18 14:09:31,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:31,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:31,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:31,091 INFO L87 Difference]: Start difference. First operand 46110 states and 117121 transitions. Second operand 10 states. [2019-12-18 14:09:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:32,261 INFO L93 Difference]: Finished difference Result 75982 states and 192668 transitions. [2019-12-18 14:09:32,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:09:32,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:32,356 INFO L225 Difference]: With dead ends: 75982 [2019-12-18 14:09:32,356 INFO L226 Difference]: Without dead ends: 69437 [2019-12-18 14:09:32,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:32,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69437 states. [2019-12-18 14:09:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69437 to 46248. [2019-12-18 14:09:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46248 states. [2019-12-18 14:09:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46248 states to 46248 states and 117468 transitions. [2019-12-18 14:09:33,057 INFO L78 Accepts]: Start accepts. Automaton has 46248 states and 117468 transitions. Word has length 96 [2019-12-18 14:09:33,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:33,057 INFO L462 AbstractCegarLoop]: Abstraction has 46248 states and 117468 transitions. [2019-12-18 14:09:33,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:33,058 INFO L276 IsEmpty]: Start isEmpty. Operand 46248 states and 117468 transitions. [2019-12-18 14:09:33,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 14:09:33,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:33,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:33,103 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:33,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:33,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1250551768, now seen corresponding path program 22 times [2019-12-18 14:09:33,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:33,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273746444] [2019-12-18 14:09:33,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:33,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273746444] [2019-12-18 14:09:33,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:33,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:09:33,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456672063] [2019-12-18 14:09:33,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:09:33,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:33,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:09:33,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:09:33,232 INFO L87 Difference]: Start difference. First operand 46248 states and 117468 transitions. Second operand 10 states. [2019-12-18 14:09:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:34,921 INFO L93 Difference]: Finished difference Result 67913 states and 171440 transitions. [2019-12-18 14:09:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:09:34,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 14:09:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:34,998 INFO L225 Difference]: With dead ends: 67913 [2019-12-18 14:09:34,999 INFO L226 Difference]: Without dead ends: 61357 [2019-12-18 14:09:34,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:09:35,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61357 states. [2019-12-18 14:09:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61357 to 38774. [2019-12-18 14:09:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38774 states. [2019-12-18 14:09:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38774 states to 38774 states and 97806 transitions. [2019-12-18 14:09:35,565 INFO L78 Accepts]: Start accepts. Automaton has 38774 states and 97806 transitions. Word has length 96 [2019-12-18 14:09:35,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:35,565 INFO L462 AbstractCegarLoop]: Abstraction has 38774 states and 97806 transitions. [2019-12-18 14:09:35,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:09:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38774 states and 97806 transitions. [2019-12-18 14:09:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:35,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:35,605 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:35,605 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:35,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1931956007, now seen corresponding path program 1 times [2019-12-18 14:09:35,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:35,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194046465] [2019-12-18 14:09:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:35,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194046465] [2019-12-18 14:09:35,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:35,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:09:35,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559467544] [2019-12-18 14:09:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:09:35,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:09:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:09:35,920 INFO L87 Difference]: Start difference. First operand 38774 states and 97806 transitions. Second operand 15 states. [2019-12-18 14:09:39,785 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-18 14:09:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:40,879 INFO L93 Difference]: Finished difference Result 74800 states and 188052 transitions. [2019-12-18 14:09:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:09:40,880 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 97 [2019-12-18 14:09:40,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:40,961 INFO L225 Difference]: With dead ends: 74800 [2019-12-18 14:09:40,961 INFO L226 Difference]: Without dead ends: 66038 [2019-12-18 14:09:40,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=1987, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:09:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66038 states. [2019-12-18 14:09:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66038 to 51064. [2019-12-18 14:09:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51064 states. [2019-12-18 14:09:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 130634 transitions. [2019-12-18 14:09:41,636 INFO L78 Accepts]: Start accepts. Automaton has 51064 states and 130634 transitions. Word has length 97 [2019-12-18 14:09:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:41,636 INFO L462 AbstractCegarLoop]: Abstraction has 51064 states and 130634 transitions. [2019-12-18 14:09:41,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:09:41,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51064 states and 130634 transitions. [2019-12-18 14:09:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:41,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:41,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:41,688 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1686919759, now seen corresponding path program 2 times [2019-12-18 14:09:41,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:41,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446110316] [2019-12-18 14:09:41,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:41,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446110316] [2019-12-18 14:09:41,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:41,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:09:41,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620161452] [2019-12-18 14:09:41,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:09:41,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:41,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:09:41,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:09:41,803 INFO L87 Difference]: Start difference. First operand 51064 states and 130634 transitions. Second operand 6 states. [2019-12-18 14:09:42,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:42,024 INFO L93 Difference]: Finished difference Result 50338 states and 128642 transitions. [2019-12-18 14:09:42,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:09:42,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 14:09:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:42,110 INFO L225 Difference]: With dead ends: 50338 [2019-12-18 14:09:42,111 INFO L226 Difference]: Without dead ends: 50338 [2019-12-18 14:09:42,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-18 14:09:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 43340. [2019-12-18 14:09:42,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43340 states. [2019-12-18 14:09:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43340 states to 43340 states and 110687 transitions. [2019-12-18 14:09:42,912 INFO L78 Accepts]: Start accepts. Automaton has 43340 states and 110687 transitions. Word has length 97 [2019-12-18 14:09:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:42,915 INFO L462 AbstractCegarLoop]: Abstraction has 43340 states and 110687 transitions. [2019-12-18 14:09:42,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:09:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 43340 states and 110687 transitions. [2019-12-18 14:09:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:42,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:42,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:42,961 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1220428195, now seen corresponding path program 1 times [2019-12-18 14:09:42,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:42,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338990392] [2019-12-18 14:09:42,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:43,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338990392] [2019-12-18 14:09:43,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:43,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:09:43,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798720182] [2019-12-18 14:09:43,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 14:09:43,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:43,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 14:09:43,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:09:43,472 INFO L87 Difference]: Start difference. First operand 43340 states and 110687 transitions. Second operand 20 states. [2019-12-18 14:09:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:47,475 INFO L93 Difference]: Finished difference Result 49450 states and 125015 transitions. [2019-12-18 14:09:47,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 14:09:47,476 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2019-12-18 14:09:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:47,540 INFO L225 Difference]: With dead ends: 49450 [2019-12-18 14:09:47,541 INFO L226 Difference]: Without dead ends: 49443 [2019-12-18 14:09:47,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 14:09:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49443 states. [2019-12-18 14:09:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49443 to 45346. [2019-12-18 14:09:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45346 states. [2019-12-18 14:09:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45346 states to 45346 states and 115650 transitions. [2019-12-18 14:09:48,346 INFO L78 Accepts]: Start accepts. Automaton has 45346 states and 115650 transitions. Word has length 97 [2019-12-18 14:09:48,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:48,346 INFO L462 AbstractCegarLoop]: Abstraction has 45346 states and 115650 transitions. [2019-12-18 14:09:48,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 14:09:48,346 INFO L276 IsEmpty]: Start isEmpty. Operand 45346 states and 115650 transitions. [2019-12-18 14:09:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:48,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:48,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:48,390 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:48,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1780327349, now seen corresponding path program 2 times [2019-12-18 14:09:48,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:48,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098329390] [2019-12-18 14:09:48,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:48,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098329390] [2019-12-18 14:09:48,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:48,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:09:48,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039411270] [2019-12-18 14:09:48,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:09:48,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:09:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:09:48,511 INFO L87 Difference]: Start difference. First operand 45346 states and 115650 transitions. Second operand 8 states. [2019-12-18 14:09:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:49,929 INFO L93 Difference]: Finished difference Result 60825 states and 154132 transitions. [2019-12-18 14:09:49,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:09:49,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-18 14:09:49,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:50,006 INFO L225 Difference]: With dead ends: 60825 [2019-12-18 14:09:50,006 INFO L226 Difference]: Without dead ends: 60773 [2019-12-18 14:09:50,006 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 14:09:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60773 states. [2019-12-18 14:09:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60773 to 49373. [2019-12-18 14:09:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49373 states. [2019-12-18 14:09:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49373 states to 49373 states and 125938 transitions. [2019-12-18 14:09:50,699 INFO L78 Accepts]: Start accepts. Automaton has 49373 states and 125938 transitions. Word has length 97 [2019-12-18 14:09:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:50,699 INFO L462 AbstractCegarLoop]: Abstraction has 49373 states and 125938 transitions. [2019-12-18 14:09:50,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:09:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 49373 states and 125938 transitions. [2019-12-18 14:09:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:50,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:50,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, 1] [2019-12-18 14:09:50,751 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:50,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:50,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1166833459, now seen corresponding path program 3 times [2019-12-18 14:09:50,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:50,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900484358] [2019-12-18 14:09:50,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:50,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900484358] [2019-12-18 14:09:50,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:50,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:09:50,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239147520] [2019-12-18 14:09:50,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:09:50,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:50,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:09:50,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:09:50,865 INFO L87 Difference]: Start difference. First operand 49373 states and 125938 transitions. Second operand 7 states. [2019-12-18 14:09:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:09:51,967 INFO L93 Difference]: Finished difference Result 62730 states and 159424 transitions. [2019-12-18 14:09:51,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:09:51,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2019-12-18 14:09:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:09:52,046 INFO L225 Difference]: With dead ends: 62730 [2019-12-18 14:09:52,046 INFO L226 Difference]: Without dead ends: 62716 [2019-12-18 14:09:52,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:09:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62716 states. [2019-12-18 14:09:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62716 to 51757. [2019-12-18 14:09:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51757 states. [2019-12-18 14:09:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51757 states to 51757 states and 132030 transitions. [2019-12-18 14:09:52,734 INFO L78 Accepts]: Start accepts. Automaton has 51757 states and 132030 transitions. Word has length 97 [2019-12-18 14:09:52,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:09:52,734 INFO L462 AbstractCegarLoop]: Abstraction has 51757 states and 132030 transitions. [2019-12-18 14:09:52,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:09:52,734 INFO L276 IsEmpty]: Start isEmpty. Operand 51757 states and 132030 transitions. [2019-12-18 14:09:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 14:09:52,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:09:52,786 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:09:52,787 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:09:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:09:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1279789301, now seen corresponding path program 4 times [2019-12-18 14:09:52,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:09:52,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378615524] [2019-12-18 14:09:52,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:09:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:09:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:09:53,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378615524] [2019-12-18 14:09:53,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:09:53,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 14:09:53,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476840429] [2019-12-18 14:09:53,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 14:09:53,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:09:53,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 14:09:53,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:09:53,471 INFO L87 Difference]: Start difference. First operand 51757 states and 132030 transitions. Second operand 22 states. Received shutdown request... [2019-12-18 14:09:54,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:09:54,873 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 14:09:54,877 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 14:09:54,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:09:54 BasicIcfg [2019-12-18 14:09:54,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:09:54,878 INFO L168 Benchmark]: Toolchain (without parser) took 200385.42 ms. Allocated memory was 138.4 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 101.8 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,879 INFO L168 Benchmark]: CDTParser took 1.71 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.25 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.6 MB in the end (delta: -54.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.72 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 151.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,880 INFO L168 Benchmark]: Boogie Preprocessor took 70.93 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,880 INFO L168 Benchmark]: RCFGBuilder took 1223.09 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 148.9 MB in the beginning and 194.0 MB in the end (delta: -45.1 MB). Peak memory consumption was 67.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,881 INFO L168 Benchmark]: TraceAbstraction took 198193.52 ms. Allocated memory was 235.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 194.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:09:54,883 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.71 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.25 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.6 MB in the end (delta: -54.2 MB). Peak memory consumption was 28.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.72 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 151.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.93 ms. Allocated memory is still 202.4 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1223.09 ms. Allocated memory was 202.4 MB in the beginning and 235.9 MB in the end (delta: 33.6 MB). Free memory was 148.9 MB in the beginning and 194.0 MB in the end (delta: -45.1 MB). Peak memory consumption was 67.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 198193.52 ms. Allocated memory was 235.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 194.0 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 8.5s, 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 (51757states) and FLOYD_HOARE automaton (currently 19 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was constructing difference of abstraction (51757states) and FLOYD_HOARE automaton (currently 19 states, 22 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 198.0s, OverallIterations: 43, TraceHistogramMax: 1, AutomataDifference: 71.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 19704 SDtfs, 23678 SDslu, 98511 SDs, 0 SdLazy, 38327 SolverSat, 1190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 157 SyntacticMatches, 49 SemanticMatches, 673 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3961 ImplicationChecksByTransitivity, 9.5s 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: 93.8s AutomataMinimizationTime, 42 MinimizatonAttempts, 349893 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 3462 NumberOfCodeBlocks, 3462 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 3419 ConstructedInterpolants, 0 QuantifiedInterpolants, 1180983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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